/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dpor-d6e1636 [2023-01-10 14:15:13,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-10 14:15:13,505 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-10 14:15:13,536 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-10 14:15:13,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-10 14:15:13,538 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-10 14:15:13,540 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-10 14:15:13,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-10 14:15:13,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-10 14:15:13,547 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-10 14:15:13,548 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-10 14:15:13,549 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-10 14:15:13,549 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-10 14:15:13,551 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-10 14:15:13,553 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-10 14:15:13,554 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-10 14:15:13,554 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-10 14:15:13,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-10 14:15:13,556 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-10 14:15:13,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-10 14:15:13,561 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-10 14:15:13,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-10 14:15:13,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-10 14:15:13,563 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-10 14:15:13,569 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-10 14:15:13,569 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-10 14:15:13,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-10 14:15:13,570 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-10 14:15:13,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-10 14:15:13,571 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-10 14:15:13,571 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-10 14:15:13,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-10 14:15:13,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-10 14:15:13,573 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-10 14:15:13,573 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-10 14:15:13,573 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-10 14:15:13,574 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-10 14:15:13,574 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-10 14:15:13,574 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-10 14:15:13,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-10 14:15:13,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-10 14:15:13,576 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2023-01-10 14:15:13,596 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-10 14:15:13,596 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-10 14:15:13,596 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-01-10 14:15:13,597 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-01-10 14:15:13,598 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-10 14:15:13,598 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-10 14:15:13,598 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-10 14:15:13,598 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-10 14:15:13,598 INFO L138 SettingsManager]: * Use SBE=true [2023-01-10 14:15:13,598 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-10 14:15:13,599 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-10 14:15:13,599 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-10 14:15:13,599 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-10 14:15:13,599 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-10 14:15:13,599 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-10 14:15:13,599 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-10 14:15:13,599 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-10 14:15:13,600 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-10 14:15:13,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-10 14:15:13,600 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-10 14:15:13,600 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-10 14:15:13,600 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-10 14:15:13,600 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-10 14:15:13,600 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-10 14:15:13,600 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-10 14:15:13,600 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-10 14:15:13,600 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-10 14:15:13,600 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-10 14:15:13,600 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-10 14:15:13,601 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-10 14:15:13,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-10 14:15:13,601 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-01-10 14:15:13,601 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-01-10 14:15:13,601 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-01-10 14:15:13,601 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2023-01-10 14:15:13,601 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2023-01-10 14:15:13,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-10 14:15:13,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-10 14:15:13,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-10 14:15:13,809 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-10 14:15:13,810 INFO L275 PluginConnector]: CDTParser initialized [2023-01-10 14:15:13,811 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2023-01-10 14:15:14,713 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-10 14:15:14,864 INFO L351 CDTParser]: Found 1 translation units. [2023-01-10 14:15:14,864 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2023-01-10 14:15:14,868 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3346692c/6f68ef4e73884224ad043fbe9d0d2372/FLAGcbd9ef398 [2023-01-10 14:15:14,877 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3346692c/6f68ef4e73884224ad043fbe9d0d2372 [2023-01-10 14:15:14,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-10 14:15:14,879 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-10 14:15:14,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-10 14:15:14,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-10 14:15:14,885 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-10 14:15:14,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:15:14" (1/1) ... [2023-01-10 14:15:14,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@524ddb97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:15:14, skipping insertion in model container [2023-01-10 14:15:14,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:15:14" (1/1) ... [2023-01-10 14:15:14,890 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-10 14:15:14,901 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-10 14:15:15,049 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c[2987,3000] [2023-01-10 14:15:15,062 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-10 14:15:15,069 INFO L203 MainTranslator]: Completed pre-run [2023-01-10 14:15:15,097 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c[2987,3000] [2023-01-10 14:15:15,100 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-10 14:15:15,109 WARN L663 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-10 14:15:15,109 WARN L663 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-10 14:15:15,114 INFO L208 MainTranslator]: Completed translation [2023-01-10 14:15:15,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:15:15 WrapperNode [2023-01-10 14:15:15,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-10 14:15:15,115 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-10 14:15:15,115 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-10 14:15:15,115 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-10 14:15:15,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:15:15" (1/1) ... [2023-01-10 14:15:15,136 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:15:15" (1/1) ... [2023-01-10 14:15:15,163 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 207 [2023-01-10 14:15:15,164 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-10 14:15:15,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-10 14:15:15,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-10 14:15:15,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-10 14:15:15,173 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:15:15" (1/1) ... [2023-01-10 14:15:15,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:15:15" (1/1) ... [2023-01-10 14:15:15,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:15:15" (1/1) ... [2023-01-10 14:15:15,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:15:15" (1/1) ... [2023-01-10 14:15:15,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:15:15" (1/1) ... [2023-01-10 14:15:15,190 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:15:15" (1/1) ... [2023-01-10 14:15:15,191 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:15:15" (1/1) ... [2023-01-10 14:15:15,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:15:15" (1/1) ... [2023-01-10 14:15:15,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-10 14:15:15,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-10 14:15:15,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-10 14:15:15,195 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-10 14:15:15,195 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:15:15" (1/1) ... [2023-01-10 14:15:15,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-10 14:15:15,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 14:15:15,230 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-10 14:15:15,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-10 14:15:15,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-10 14:15:15,270 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-10 14:15:15,270 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-10 14:15:15,270 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-10 14:15:15,270 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-10 14:15:15,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-10 14:15:15,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-10 14:15:15,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-10 14:15:15,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-10 14:15:15,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-10 14:15:15,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-10 14:15:15,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-10 14:15:15,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-10 14:15:15,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-10 14:15:15,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-10 14:15:15,272 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-10 14:15:15,392 INFO L236 CfgBuilder]: Building ICFG [2023-01-10 14:15:15,393 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-10 14:15:15,669 INFO L277 CfgBuilder]: Performing block encoding [2023-01-10 14:15:15,730 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-10 14:15:15,731 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-01-10 14:15:15,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:15:15 BoogieIcfgContainer [2023-01-10 14:15:15,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-10 14:15:15,734 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-10 14:15:15,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-10 14:15:15,736 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-10 14:15:15,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:15:14" (1/3) ... [2023-01-10 14:15:15,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a44ef2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:15:15, skipping insertion in model container [2023-01-10 14:15:15,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:15:15" (2/3) ... [2023-01-10 14:15:15,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a44ef2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:15:15, skipping insertion in model container [2023-01-10 14:15:15,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:15:15" (3/3) ... [2023-01-10 14:15:15,737 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2023-01-10 14:15:15,742 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-01-10 14:15:15,753 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-10 14:15:15,753 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-10 14:15:15,754 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-10 14:15:15,812 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-01-10 14:15:15,852 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 14:15:15,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-10 14:15:15,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 14:15:15,855 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-10 14:15:15,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-01-10 14:15:15,877 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-01-10 14:15:15,882 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2023-01-10 14:15:15,886 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6b44dc3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 14:15:15,886 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-10 14:15:15,985 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 14:15:15,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 14:15:15,988 INFO L85 PathProgramCache]: Analyzing trace with hash -13419439, now seen corresponding path program 1 times [2023-01-10 14:15:15,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 14:15:15,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403612913] [2023-01-10 14:15:15,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 14:15:15,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 14:15:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 14:15:16,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-10 14:15:16,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 14:15:16,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403612913] [2023-01-10 14:15:16,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403612913] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-10 14:15:16,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-10 14:15:16,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-10 14:15:16,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530259892] [2023-01-10 14:15:16,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 14:15:16,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-10 14:15:16,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 14:15:16,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-10 14:15:16,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-10 14:15:16,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:15:16,245 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 14:15:16,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 67.5) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 14:15:16,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:15:16,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:15:16,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-10 14:15:16,289 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 14:15:16,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 14:15:16,290 INFO L85 PathProgramCache]: Analyzing trace with hash 96589719, now seen corresponding path program 1 times [2023-01-10 14:15:16,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 14:15:16,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080051517] [2023-01-10 14:15:16,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 14:15:16,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 14:15:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 14:15:16,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 14:15:16,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 14:15:16,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080051517] [2023-01-10 14:15:16,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080051517] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-10 14:15:16,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-10 14:15:16,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-10 14:15:16,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319302842] [2023-01-10 14:15:16,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 14:15:16,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-10 14:15:16,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 14:15:16,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-10 14:15:16,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-10 14:15:16,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:15:16,711 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 14:15:16,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 14:15:16,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:15:16,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:15:16,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:15:16,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 14:15:16,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-10 14:15:16,838 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 14:15:16,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 14:15:16,839 INFO L85 PathProgramCache]: Analyzing trace with hash -952799638, now seen corresponding path program 1 times [2023-01-10 14:15:16,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 14:15:16,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496236658] [2023-01-10 14:15:16,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 14:15:16,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 14:15:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 14:15:17,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-10 14:15:17,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 14:15:17,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496236658] [2023-01-10 14:15:17,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496236658] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-10 14:15:17,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-10 14:15:17,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-10 14:15:17,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648238325] [2023-01-10 14:15:17,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 14:15:17,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-10 14:15:17,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 14:15:17,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-10 14:15:17,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-10 14:15:17,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:15:17,088 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 14:15:17,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 14:15:17,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:15:17,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 14:15:17,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:15:17,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:15:17,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 14:15:17,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-10 14:15:17,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-10 14:15:17,162 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 14:15:17,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 14:15:17,163 INFO L85 PathProgramCache]: Analyzing trace with hash -26015528, now seen corresponding path program 1 times [2023-01-10 14:15:17,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 14:15:17,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256264554] [2023-01-10 14:15:17,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 14:15:17,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 14:15:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 14:15:20,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 14:15:20,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 14:15:20,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256264554] [2023-01-10 14:15:20,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256264554] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 14:15:20,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215832275] [2023-01-10 14:15:20,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 14:15:20,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 14:15:20,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 14:15:20,546 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 14:15:20,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-10 14:15:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 14:15:20,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 92 conjunts are in the unsatisfiable core [2023-01-10 14:15:20,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 14:15:20,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-10 14:15:21,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 14:15:21,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-01-10 14:15:21,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-10 14:15:22,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 14:15:22,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 14:15:22,553 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-10 14:15:22,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-01-10 14:15:22,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-10 14:15:23,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-10 14:15:23,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-10 14:15:24,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 18 [2023-01-10 14:15:24,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 14:15:24,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 14:15:40,747 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2023-01-10 14:15:40,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 217 treesize of output 115 [2023-01-10 14:15:40,857 INFO L321 Elim1Store]: treesize reduction 5, result has 96.9 percent of original size [2023-01-10 14:15:40,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 645 treesize of output 730 [2023-01-10 14:15:40,893 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 14:15:40,917 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 14:15:40,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 187 treesize of output 239 [2023-01-10 14:15:40,976 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 14:15:41,001 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 14:15:41,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 185 treesize of output 213 [2023-01-10 14:15:50,681 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2023-01-10 14:15:50,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 217 treesize of output 115 [2023-01-10 14:15:50,799 INFO L321 Elim1Store]: treesize reduction 4, result has 97.5 percent of original size [2023-01-10 14:15:50,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 317 treesize of output 435 [2023-01-10 14:15:50,842 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 14:15:50,842 INFO L350 Elim1Store]: Elim1 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 255 treesize of output 295 [2023-01-10 14:15:50,887 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 14:15:50,887 INFO L350 Elim1Store]: Elim1 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 161 treesize of output 225 [2023-01-10 14:16:22,383 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 14:16:22,389 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 14:16:22,395 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-01-10 14:16:22,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 12 [2023-01-10 14:16:22,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 14:16:22,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215832275] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 14:16:22,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 14:16:22,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 45, 45] total 121 [2023-01-10 14:16:22,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725502829] [2023-01-10 14:16:22,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 14:16:22,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 121 states [2023-01-10 14:16:22,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 14:16:22,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2023-01-10 14:16:22,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1644, Invalid=12810, Unknown=66, NotChecked=0, Total=14520 [2023-01-10 14:16:22,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:16:22,504 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 14:16:22,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 121 states, 121 states have (on average 3.272727272727273) internal successors, (396), 121 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 14:16:22,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:16:22,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 14:16:22,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-01-10 14:16:22,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:16:23,050 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~q2_back~0 4)) (.cse5 (* c_~q2_front~0 4)) (.cse38 (* c_~q1_back~0 4)) (.cse37 (* c_~q1_front~0 4)) (.cse6 (+ c_~i~0 1))) (let ((.cse59 (and (= .cse38 .cse37) (< c_~j~0 .cse6))) (.cse56 (< 0 c_~q2_back~0)) (.cse57 (= .cse8 .cse5)) (.cse58 (< c_~j~0 c_~i~0)) (.cse3 (+ .cse37 c_~q1~0.offset)) (.cse115 (select |c_#memory_int| c_~q2~0.base)) (.cse71 (+ c_~q2~0.offset .cse5)) (.cse117 (select |c_#memory_int| c_~q1~0.base)) (.cse7 (+ .cse38 c_~q1~0.offset))) (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse21 (let ((.cse120 (+ .cse37 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse121 (+ .cse38 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int) (v_ArrVal_77 (Array Int Int)) (v_ArrVal_78 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10| Int) (v_ArrVal_76 Int) (v_subst_1 Int)) (let ((.cse122 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) v_subst_1) v_ArrVal_76)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_77) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_78))) (let ((.cse118 (select .cse122 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|)) (.cse119 (select .cse122 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= c_~i~0 (select .cse118 (+ .cse8 v_subst_1)))) (< (select .cse118 (+ .cse5 v_subst_1)) c_~i~0) (< (select .cse119 .cse120) .cse6) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| c_~q2_back~0) (< 0 |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) 0)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) (not (= (select .cse119 .cse121) c_~j~0)))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int) (v_ArrVal_77 (Array Int Int)) (v_ArrVal_78 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10| Int) (v_ArrVal_76 Int) (v_subst_2 Int)) (let ((.cse125 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) v_subst_2) v_ArrVal_76)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_77) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_78))) (let ((.cse123 (select .cse125 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|)) (.cse124 (select .cse125 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse123 (+ .cse5 v_subst_2)) .cse6) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| c_~q2_back~0) (< 0 |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) 0)) (< (select .cse124 .cse120) c_~i~0) (not (= (select .cse123 (+ .cse8 v_subst_2)) c_~i~0)) (not (= c_~j~0 (select .cse124 .cse121))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|)))))))) (.cse18 (not (= (select .cse117 .cse7) c_~j~0))) (.cse15 (<= c_~n2~0 c_~q2_back~0)) (.cse69 (+ .cse8 c_~q2~0.offset)) (.cse19 (select .cse115 .cse71)) (.cse20 (select .cse117 .cse3)) (.cse0 (<= c_~n1~0 c_~q1_back~0)) (.cse1 (< c_~q2_back~0 0)) (.cse16 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse17 (< c_~q1_back~0 0)) (.cse28 (let ((.cse116 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) 0)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|))))) (and (or .cse116 .cse59 .cse56) (or .cse116 .cse56 .cse57 .cse58))))) (and (or .cse0 .cse1 (let ((.cse11 (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|))) (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_77 (Array Int Int)) (v_ArrVal_78 (Array Int Int)) (v_ArrVal_76 Int)) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse10 (+ .cse11 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_76)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_77) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_78))) (let ((.cse2 (select .cse9 c_~q1~0.base)) (.cse4 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse2 .cse3) c_~i~0) (< (select .cse4 (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse6) (not (= (select .cse2 .cse7) c_~j~0)) (not (= c_~i~0 (select .cse4 (+ .cse8 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_77 (Array Int Int)) (v_ArrVal_78 (Array Int Int)) (v_ArrVal_76 Int)) (let ((.cse14 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse10 (+ .cse11 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_76)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_77) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_78))) (let ((.cse13 (select .cse14 c_~q1~0.base)) (.cse12 (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse12 (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (< (select .cse13 .cse3) .cse6) (not (= (select .cse13 .cse7) c_~j~0)) (not (= c_~i~0 (select .cse12 (+ .cse8 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))))) .cse15 .cse16 .cse17) (or .cse18 .cse0 (and (or (< .cse19 c_~N~0) (< (+ .cse20 1) c_~N~0)) (or (< .cse20 c_~N~0) (< (+ .cse19 1) c_~N~0))) .cse17) (or .cse0 .cse1 (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post25#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse21 .cse17) (= c_~i~0 0) (or .cse0 .cse1 (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (or (< 0 |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16|) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_77 (Array Int Int)) (v_ArrVal_78 (Array Int Int)) (v_ArrVal_76 Int)) (let ((.cse24 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse10 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_76)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_77) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_78))) (let ((.cse22 (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse23 (select .cse24 c_~q1~0.base))) (or (< (select .cse22 (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (< (select .cse23 .cse3) .cse6) (not (= (select .cse22 (+ .cse8 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (not (= c_~j~0 (select .cse23 .cse7))))))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (or (< 0 |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16|) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_77 (Array Int Int)) (v_ArrVal_78 (Array Int Int)) (v_ArrVal_76 Int)) (let ((.cse27 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse10 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_76)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_77) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_78))) (let ((.cse25 (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse26 (select .cse27 c_~q1~0.base))) (or (< (select .cse25 (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse6) (< (select .cse26 .cse3) c_~i~0) (not (= (select .cse25 (+ .cse8 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (not (= c_~j~0 (select .cse26 .cse7))))))) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)))) .cse15 .cse17) (or .cse0 .cse1 .cse21 .cse17) (or .cse0 .cse1 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse17 .cse28) (or .cse0 .cse1 .cse17 (let ((.cse31 (+ .cse38 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse32 (+ .cse37 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_77 (Array Int Int)) (v_ArrVal_78 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10| Int) (v_ArrVal_76 Int)) (let ((.cse33 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_76)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_77) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_78))) (let ((.cse29 (select .cse33 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|)) (.cse30 (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< (select .cse29 (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse6) (not (= c_~j~0 (select .cse30 .cse31))) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| c_~q2_back~0) (< 0 |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) 0)) (not (= (select .cse29 (+ .cse8 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (< (select .cse30 .cse32) c_~i~0) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_77 (Array Int Int)) (v_ArrVal_78 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10| Int) (v_ArrVal_76 Int)) (let ((.cse36 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_76)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_77) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_78))) (let ((.cse34 (select .cse36 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse35 (select .cse36 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|))) (or (not (= c_~j~0 (select .cse34 .cse31))) (< (select .cse34 .cse32) .cse6) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| c_~q2_back~0) (< 0 |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) 0)) (not (= (select .cse35 (+ .cse8 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) (< (select .cse35 (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)))))))) (or .cse0 .cse1 .cse17 (let ((.cse42 (+ .cse37 |c_ULTIMATE.start_main_#t~ret16#1.offset|)) (.cse41 (+ .cse38 |c_ULTIMATE.start_main_#t~ret16#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_77 (Array Int Int)) (v_ArrVal_78 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10| Int) (v_ArrVal_76 Int)) (let ((.cse43 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_76)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_77) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_78))) (let ((.cse39 (select .cse43 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|)) (.cse40 (select .cse43 |c_ULTIMATE.start_main_#t~ret16#1.base|))) (or (< (select .cse39 (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse6) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| c_~q2_back~0) (< 0 |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) 0)) (not (= (select .cse39 (+ .cse8 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (not (= (select .cse40 .cse41) c_~j~0)) (< (select .cse40 .cse42) c_~i~0) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_77 (Array Int Int)) (v_ArrVal_78 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10| Int) (v_ArrVal_76 Int)) (let ((.cse46 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_76)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_77) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_78))) (let ((.cse44 (select .cse46 |c_ULTIMATE.start_main_#t~ret16#1.base|)) (.cse45 (select .cse46 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|))) (or (< (select .cse44 .cse42) .cse6) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| c_~q2_back~0) (< 0 |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) 0)) (not (= (select .cse45 (+ .cse8 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (not (= (select .cse44 .cse41) c_~j~0)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) (< (select .cse45 (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)))))))) (or .cse0 .cse1 (let ((.cse48 (+ .cse8 |c_ULTIMATE.start_main_#t~ret17#1.offset|)) (.cse49 (+ |c_ULTIMATE.start_main_#t~ret17#1.offset| .cse5))) (and (forall ((v_ArrVal_77 (Array Int Int)) (v_ArrVal_78 (Array Int Int))) (let ((.cse51 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_77) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_78))) (let ((.cse47 (select .cse51 |c_ULTIMATE.start_main_#t~ret17#1.base|)) (.cse50 (select .cse51 c_~q1~0.base))) (or (not (= c_~i~0 (select .cse47 .cse48))) (< (select .cse47 .cse49) .cse6) (not (= c_~j~0 (select .cse50 .cse7))) (< (select .cse50 .cse3) c_~i~0))))) (forall ((v_ArrVal_77 (Array Int Int)) (v_ArrVal_78 (Array Int Int))) (let ((.cse54 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_77) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_78))) (let ((.cse53 (select .cse54 |c_ULTIMATE.start_main_#t~ret17#1.base|)) (.cse52 (select .cse54 c_~q1~0.base))) (or (< (select .cse52 .cse3) .cse6) (not (= c_~i~0 (select .cse53 .cse48))) (< (select .cse53 .cse49) c_~i~0) (not (= c_~j~0 (select .cse52 .cse7))))))))) .cse15 .cse17) (or .cse0 .cse1 (let ((.cse55 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10| Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_13| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_13|) 0)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_13|) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_13| 1) |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) 0)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|))))) (and (or .cse55 .cse56 .cse57 .cse58) (or .cse55 .cse59 .cse56))) .cse17 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or .cse0 .cse1 (let ((.cse61 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse62 (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_77 (Array Int Int)) (v_ArrVal_78 (Array Int Int))) (let ((.cse64 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_77) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_78))) (let ((.cse60 (select .cse64 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse63 (select .cse64 c_~q1~0.base))) (or (not (= (select .cse60 .cse61) c_~i~0)) (< (select .cse60 .cse62) .cse6) (not (= c_~j~0 (select .cse63 .cse7))) (< (select .cse63 .cse3) c_~i~0))))) (forall ((v_ArrVal_77 (Array Int Int)) (v_ArrVal_78 (Array Int Int))) (let ((.cse67 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_77) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_78))) (let ((.cse65 (select .cse67 c_~q1~0.base)) (.cse66 (select .cse67 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse65 .cse3) .cse6) (not (= (select .cse66 .cse61) c_~i~0)) (not (= c_~j~0 (select .cse65 .cse7))) (< (select .cse66 .cse62) c_~i~0))))))) .cse15 .cse17) (or .cse0 .cse1 .cse15 .cse17 (and (forall ((v_ArrVal_78 (Array Int Int))) (let ((.cse72 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_78))) (let ((.cse68 (select .cse72 c_~q2~0.base)) (.cse70 (select .cse72 c_~q1~0.base))) (or (not (= c_~i~0 (select .cse68 .cse69))) (< (select .cse70 .cse3) c_~i~0) (< (select .cse68 .cse71) .cse6) (not (= c_~j~0 (select .cse70 .cse7))))))) (forall ((v_ArrVal_78 (Array Int Int))) (let ((.cse75 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_78))) (let ((.cse74 (select .cse75 c_~q2~0.base)) (.cse73 (select .cse75 c_~q1~0.base))) (or (< (select .cse73 .cse3) .cse6) (not (= c_~i~0 (select .cse74 .cse69))) (< (select .cse74 .cse71) c_~i~0) (not (= c_~j~0 (select .cse73 .cse7))))))))) (or .cse0 .cse1 (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_77 (Array Int Int)) (v_ArrVal_78 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10| Int) (v_ArrVal_76 Int)) (let ((.cse78 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_76)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_77) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_78))) (let ((.cse77 (select .cse78 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|)) (.cse76 (select .cse78 c_~q1~0.base))) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| c_~q2_back~0) (< 0 |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16|) (< (select .cse76 .cse3) .cse6) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) 0)) (not (= (select .cse77 (+ .cse8 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) (< (select .cse77 (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (not (= c_~j~0 (select .cse76 .cse7))))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_77 (Array Int Int)) (v_ArrVal_78 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10| Int) (v_ArrVal_76 Int)) (let ((.cse81 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_76)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_77) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_78))) (let ((.cse79 (select .cse81 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|)) (.cse80 (select .cse81 c_~q1~0.base))) (or (< (select .cse79 (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse6) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| c_~q2_back~0) (< 0 |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) 0)) (not (= (select .cse79 (+ .cse8 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (< (select .cse80 .cse3) c_~i~0) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) (not (= c_~j~0 (select .cse80 .cse7)))))))) .cse17) (or .cse0 .cse1 .cse15 .cse17 (let ((.cse85 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_77 (Array Int Int)) (v_ArrVal_78 (Array Int Int)) (v_ArrVal_76 Int)) (let ((.cse84 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base| (store .cse85 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_76)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_77) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_78))) (let ((.cse82 (select .cse84 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base|)) (.cse83 (select .cse84 c_~q1~0.base))) (or (not (= c_~i~0 (select .cse82 (+ .cse8 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select .cse83 .cse7) c_~j~0)) (< (select .cse82 (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (< (select .cse83 .cse3) .cse6))))) (< 0 |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16|) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (or (< 0 |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16|) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_77 (Array Int Int)) (v_ArrVal_78 (Array Int Int)) (v_ArrVal_76 Int)) (let ((.cse88 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base| (store .cse85 (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_76)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_77) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_78))) (let ((.cse86 (select .cse88 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base|)) (.cse87 (select .cse88 c_~q1~0.base))) (or (< (select .cse86 (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse6) (< (select .cse87 .cse3) c_~i~0) (not (= c_~i~0 (select .cse86 (+ .cse8 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select .cse87 .cse7) c_~j~0)))))) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)))))) (or .cse0 .cse1 (let ((.cse90 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse91 (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_77 (Array Int Int)) (v_ArrVal_78 (Array Int Int))) (let ((.cse93 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_77) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_78))) (let ((.cse89 (select .cse93 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse92 (select .cse93 c_~q1~0.base))) (or (not (= (select .cse89 .cse90) c_~i~0)) (< (select .cse89 .cse91) .cse6) (not (= c_~j~0 (select .cse92 .cse7))) (< (select .cse92 .cse3) c_~i~0))))) (forall ((v_ArrVal_77 (Array Int Int)) (v_ArrVal_78 (Array Int Int))) (let ((.cse96 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_77) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_78))) (let ((.cse94 (select .cse96 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse95 (select .cse96 c_~q1~0.base))) (or (not (= (select .cse94 .cse90) c_~i~0)) (< (select .cse94 .cse91) c_~i~0) (< (select .cse95 .cse3) .cse6) (not (= c_~j~0 (select .cse95 .cse7))))))))) .cse15 .cse17) (or .cse0 .cse1 .cse15 .cse17 (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) 0)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_77 (Array Int Int)) (v_ArrVal_78 (Array Int Int)) (v_ArrVal_76 Int)) (let ((.cse99 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_76)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_77) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_78))) (let ((.cse98 (select .cse99 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|)) (.cse97 (select .cse99 c_~q1~0.base))) (or (< (select .cse97 .cse3) .cse6) (not (= (select .cse98 (+ .cse8 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (< (select .cse98 (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (not (= c_~j~0 (select .cse97 .cse7))))))) (< 0 |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16|) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) 0)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int)) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_77 (Array Int Int)) (v_ArrVal_78 (Array Int Int)) (v_ArrVal_76 Int)) (let ((.cse102 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_76)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_77) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_78))) (let ((.cse100 (select .cse102 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|)) (.cse101 (select .cse102 c_~q1~0.base))) (or (< (select .cse100 (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse6) (not (= (select .cse100 (+ .cse8 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (< (select .cse101 .cse3) c_~i~0) (not (= c_~j~0 (select .cse101 .cse7))))))) (< 0 |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16|) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|))))))) (or (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_77 (Array Int Int)) (v_ArrVal_78 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10| Int) (v_ArrVal_76 Int)) (let ((.cse105 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_76)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_77) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_78))) (let ((.cse103 (select .cse105 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|)) (.cse104 (select .cse105 c_~q1~0.base))) (or (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1) |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (select .cse103 (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse6) (< 0 |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) 0)) (not (= (select .cse103 (+ .cse8 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (< (select .cse104 .cse3) c_~i~0) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) (not (= c_~j~0 (select .cse104 .cse7))))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| Int) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_77 (Array Int Int)) (v_ArrVal_78 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10| Int) (v_ArrVal_76 Int)) (let ((.cse108 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10| (store (select |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_76)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_77) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_78))) (let ((.cse107 (select .cse108 |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|)) (.cse106 (select .cse108 c_~q1~0.base))) (or (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16| 1) |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< 0 |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_16|) (< (select .cse106 .cse3) .cse6) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) 0)) (not (= (select .cse107 (+ .cse8 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc24#1.base_10|) (< (select .cse107 (+ .cse5 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (not (= c_~j~0 (select .cse106 .cse7)))))))) .cse0 .cse1 .cse15 .cse17) (or .cse0 .cse1 .cse15 (and (forall ((v_ArrVal_77 (Array Int Int)) (v_ArrVal_78 (Array Int Int))) (let ((.cse111 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_77) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_78))) (let ((.cse110 (select .cse111 c_~q1~0.base)) (.cse109 (select .cse111 c_~q2~0.base))) (or (not (= (select .cse109 .cse69) c_~i~0)) (not (= c_~j~0 (select .cse110 .cse7))) (< (select .cse110 .cse3) c_~i~0) (< (select .cse109 .cse71) .cse6))))) (forall ((v_ArrVal_77 (Array Int Int)) (v_ArrVal_78 (Array Int Int))) (let ((.cse114 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_77) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_78))) (let ((.cse112 (select .cse114 c_~q2~0.base)) (.cse113 (select .cse114 c_~q1~0.base))) (or (not (= (select .cse112 .cse69) c_~i~0)) (< (select .cse113 .cse3) .cse6) (< (select .cse112 .cse71) c_~i~0) (not (= c_~j~0 (select .cse113 .cse7)))))))) .cse17) (or .cse18 .cse0 .cse1 .cse15 .cse17 (not (= c_~i~0 (select .cse115 .cse69))) (and (or (< .cse20 .cse6) (< .cse19 c_~i~0)) (or (< .cse19 .cse6) (< .cse20 c_~i~0)))) (or .cse0 .cse1 .cse16 .cse17 .cse28) (= c_~j~0 0))))) is different from false [2023-01-10 14:16:39,853 WARN L222 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 194 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 14:16:54,501 WARN L222 SmtUtils]: Spent 13.16s on a formula simplification that was a NOOP. DAG size: 193 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 14:17:15,027 WARN L222 SmtUtils]: Spent 18.28s on a formula simplification that was a NOOP. DAG size: 208 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 14:17:17,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 14:17:20,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 14:17:31,770 WARN L222 SmtUtils]: Spent 7.31s on a formula simplification. DAG size of input: 255 DAG size of output: 209 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 14:17:33,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 14:17:47,665 WARN L222 SmtUtils]: Spent 13.10s on a formula simplification that was a NOOP. DAG size: 200 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 14:17:47,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:17:47,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 14:17:47,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-10 14:17:47,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-01-10 14:17:47,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-01-10 14:17:48,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-01-10 14:17:48,044 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 14:17:48,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 14:17:48,044 INFO L85 PathProgramCache]: Analyzing trace with hash 132588677, now seen corresponding path program 2 times [2023-01-10 14:17:48,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 14:17:48,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363731810] [2023-01-10 14:17:48,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 14:17:48,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 14:17:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 14:17:48,249 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-10 14:17:48,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 14:17:48,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363731810] [2023-01-10 14:17:48,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363731810] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 14:17:48,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856132601] [2023-01-10 14:17:48,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-10 14:17:48,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 14:17:48,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 14:17:48,267 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 14:17:48,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-10 14:17:48,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-10 14:17:48,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 14:17:48,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 9 conjunts are in the unsatisfiable core [2023-01-10 14:17:48,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 14:17:48,518 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-10 14:17:48,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 14:17:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-10 14:17:48,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856132601] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 14:17:48,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 14:17:48,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2023-01-10 14:17:48,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713201006] [2023-01-10 14:17:48,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 14:17:48,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-01-10 14:17:48,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 14:17:48,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-01-10 14:17:48,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2023-01-10 14:17:48,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:17:48,701 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 14:17:48,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.842105263157896) internal successors, (206), 19 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 14:17:48,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:17:48,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 14:17:48,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-01-10 14:17:48,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-01-10 14:17:48,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:17:48,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:17:48,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 14:17:48,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-10 14:17:48,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-01-10 14:17:48,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-10 14:17:48,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-10 14:17:49,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 14:17:49,117 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 14:17:49,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 14:17:49,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1914479475, now seen corresponding path program 3 times [2023-01-10 14:17:49,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 14:17:49,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652611359] [2023-01-10 14:17:49,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 14:17:49,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 14:17:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 14:17:49,249 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-01-10 14:17:49,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 14:17:49,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652611359] [2023-01-10 14:17:49,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652611359] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-10 14:17:49,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-10 14:17:49,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-10 14:17:49,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170294068] [2023-01-10 14:17:49,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 14:17:49,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-10 14:17:49,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 14:17:49,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-10 14:17:49,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-10 14:17:49,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:17:49,251 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 14:17:49,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 14:17:49,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:17:49,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 14:17:49,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-01-10 14:17:49,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-01-10 14:17:49,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-01-10 14:17:49,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:17:49,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:17:49,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 14:17:49,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-10 14:17:49,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-01-10 14:17:49,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-10 14:17:49,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-10 14:17:49,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-10 14:17:49,592 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 14:17:49,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 14:17:49,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1940396991, now seen corresponding path program 4 times [2023-01-10 14:17:49,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 14:17:49,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494502814] [2023-01-10 14:17:49,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 14:17:49,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 14:17:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 14:17:49,846 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 22 proven. 32 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-01-10 14:17:49,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 14:17:49,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494502814] [2023-01-10 14:17:49,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494502814] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 14:17:49,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073894162] [2023-01-10 14:17:49,846 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-10 14:17:49,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 14:17:49,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 14:17:49,861 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 14:17:49,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-10 14:17:49,977 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-10 14:17:49,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 14:17:49,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-10 14:17:49,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 14:17:50,362 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 43 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-01-10 14:17:50,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 14:17:50,716 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 25 proven. 28 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-01-10 14:17:50,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073894162] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 14:17:50,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 14:17:50,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2023-01-10 14:17:50,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905707115] [2023-01-10 14:17:50,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 14:17:50,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-01-10 14:17:50,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 14:17:50,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-01-10 14:17:50,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2023-01-10 14:17:50,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:17:50,719 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 14:17:50,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.25) internal successors, (287), 28 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 14:17:50,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:17:50,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 14:17:50,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-01-10 14:17:50,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2023-01-10 14:17:50,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-01-10 14:17:50,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-01-10 14:17:50,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:17:51,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:17:51,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 14:17:51,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-10 14:17:51,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-01-10 14:17:51,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-10 14:17:51,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-10 14:17:51,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 14:17:51,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-10 14:17:51,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 14:17:51,264 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 14:17:51,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 14:17:51,265 INFO L85 PathProgramCache]: Analyzing trace with hash 253027860, now seen corresponding path program 5 times [2023-01-10 14:17:51,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 14:17:51,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43357852] [2023-01-10 14:17:51,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 14:17:51,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 14:17:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 14:17:51,574 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 39 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-10 14:17:51,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 14:17:51,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43357852] [2023-01-10 14:17:51,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43357852] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 14:17:51,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374583676] [2023-01-10 14:17:51,574 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-10 14:17:51,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 14:17:51,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 14:17:51,581 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 14:17:51,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-10 14:17:51,689 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-01-10 14:17:51,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 14:17:51,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 10 conjunts are in the unsatisfiable core [2023-01-10 14:17:51,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 14:17:51,883 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-01-10 14:17:51,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 14:17:52,336 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 25 proven. 19 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-01-10 14:17:52,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374583676] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 14:17:52,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 14:17:52,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 7] total 23 [2023-01-10 14:17:52,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323647718] [2023-01-10 14:17:52,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 14:17:52,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-01-10 14:17:52,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 14:17:52,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-01-10 14:17:52,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2023-01-10 14:17:52,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:17:52,338 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 14:17:52,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 17.217391304347824) internal successors, (396), 23 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 14:17:52,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:17:52,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 14:17:52,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-01-10 14:17:52,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2023-01-10 14:17:52,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-01-10 14:17:52,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-01-10 14:17:52,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 14:17:52,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:17:52,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:17:52,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 14:17:52,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-10 14:17:52,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-01-10 14:17:52,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-10 14:17:52,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-10 14:17:52,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 14:17:52,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-01-10 14:17:52,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-01-10 14:17:52,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 14:17:52,938 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 14:17:52,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 14:17:52,938 INFO L85 PathProgramCache]: Analyzing trace with hash 193078835, now seen corresponding path program 6 times [2023-01-10 14:17:52,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 14:17:52,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412730437] [2023-01-10 14:17:52,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 14:17:52,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 14:17:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 14:18:08,671 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 14:18:08,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 14:18:08,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412730437] [2023-01-10 14:18:08,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412730437] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 14:18:08,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194143215] [2023-01-10 14:18:08,671 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-10 14:18:08,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 14:18:08,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 14:18:08,672 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 14:18:08,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-10 14:18:09,029 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-01-10 14:18:09,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 14:18:09,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 86 conjunts are in the unsatisfiable core [2023-01-10 14:18:09,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 14:18:10,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-10 14:18:11,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-10 14:18:11,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-10 14:18:12,876 INFO L321 Elim1Store]: treesize reduction 29, result has 45.3 percent of original size [2023-01-10 14:18:12,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 38 [2023-01-10 14:18:13,292 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 3 proven. 62 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-01-10 14:18:13,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 14:18:35,097 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_~q1_front~0 4)) (.cse6 (* c_~q1_back~0 4))) (and (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_270 (Array Int Int)) (~q1~0.base Int) (v_~q2_front~0_45 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (let ((.cse4 (select .cse8 c_~q2~0.base)) (.cse5 (select .cse8 ~q1~0.base))) (let ((.cse0 (select .cse5 (+ .cse7 ~q1~0.offset 4))) (.cse1 (select .cse5 (+ .cse6 ~q1~0.offset 4))) (.cse3 (select .cse4 (+ (* 4 v_~q2_front~0_45) c_~q2~0.offset))) (.cse2 (select .cse4 (+ c_~q2~0.offset (* ~q2_back~0 4))))) (or (< .cse0 (+ .cse1 1)) (< .cse0 (+ .cse2 1)) (< v_~q2_front~0_45 1) (< .cse3 .cse1) (< .cse3 .cse2) (<= c_~n2~0 ~q2_back~0) (< ~q2_back~0 v_~q2_front~0_45)))))) (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_270 (Array Int Int)) (~q1~0.base Int) (v_~q2_front~0_45 Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (let ((.cse13 (select .cse15 c_~q2~0.base)) (.cse14 (select .cse15 ~q1~0.base))) (let ((.cse10 (select .cse14 (+ .cse6 ~q1~0.offset 4))) (.cse11 (select .cse14 (+ .cse7 ~q1~0.offset 4))) (.cse9 (select .cse13 (+ (* 4 v_~q2_front~0_45) c_~q2~0.offset))) (.cse12 (select .cse13 (+ c_~q2~0.offset (* ~q2_back~0 4))))) (or (< v_~q2_front~0_45 1) (< .cse9 (+ .cse10 1)) (< .cse11 .cse10) (< .cse11 .cse12) (< .cse9 (+ .cse12 1)) (<= c_~n2~0 ~q2_back~0) (< ~q2_back~0 v_~q2_front~0_45)))))))) is different from false [2023-01-10 14:18:35,425 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_~q1_back~0 4)) (.cse6 (* c_~q1_front~0 4))) (and (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_270 (Array Int Int)) (~q1~0.base Int) (v_~q2_front~0_45 Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (let ((.cse5 (select .cse8 ~q1~0.base)) (.cse4 (select .cse8 c_~q2~0.base))) (let ((.cse0 (select .cse4 (+ (* 4 v_~q2_front~0_45) c_~q2~0.offset))) (.cse1 (select .cse5 (+ .cse7 ~q1~0.offset 4))) (.cse3 (select .cse5 (+ .cse6 ~q1~0.offset 4))) (.cse2 (select .cse4 (+ c_~q2~0.offset (* ~q2_back~0 4))))) (or (< .cse0 .cse1) (< v_~q2_front~0_45 1) (< .cse0 .cse2) (< .cse3 (+ .cse1 1)) (< .cse3 (+ .cse2 1)) (<= c_~n2~0 ~q2_back~0) (< ~q2_back~0 v_~q2_front~0_45)))))) (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_270 (Array Int Int)) (~q1~0.base Int) (v_~q2_front~0_45 Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (let ((.cse13 (select .cse15 ~q1~0.base)) (.cse14 (select .cse15 c_~q2~0.base))) (let ((.cse9 (select .cse14 (+ (* 4 v_~q2_front~0_45) c_~q2~0.offset))) (.cse11 (select .cse14 (+ c_~q2~0.offset (* ~q2_back~0 4)))) (.cse12 (select .cse13 (+ .cse6 ~q1~0.offset 4))) (.cse10 (select .cse13 (+ .cse7 ~q1~0.offset 4)))) (or (< .cse9 (+ .cse10 1)) (< .cse9 (+ .cse11 1)) (< .cse12 .cse11) (< v_~q2_front~0_45 1) (< .cse12 .cse10) (<= c_~n2~0 ~q2_back~0) (< ~q2_back~0 v_~q2_front~0_45)))))))) is different from false [2023-01-10 14:18:35,660 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_~q1_front~0 4)) (.cse5 (* c_~q1_back~0 4))) (and (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_270 (Array Int Int)) (~q1~0.base Int) (v_~q2_front~0_45 Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (let ((.cse4 (select .cse8 ~q1~0.base)) (.cse6 (select .cse8 |c_ULTIMATE.start_main_#t~ret17#1.base|))) (let ((.cse1 (select .cse6 (+ |c_ULTIMATE.start_main_#t~ret17#1.offset| (* ~q2_back~0 4)))) (.cse0 (select .cse4 (+ .cse7 ~q1~0.offset 4))) (.cse2 (select .cse6 (+ (* 4 v_~q2_front~0_45) |c_ULTIMATE.start_main_#t~ret17#1.offset|))) (.cse3 (select .cse4 (+ .cse5 ~q1~0.offset 4)))) (or (< .cse0 .cse1) (< v_~q2_front~0_45 1) (< .cse2 (+ .cse1 1)) (< .cse0 .cse3) (<= c_~n2~0 ~q2_back~0) (< .cse2 (+ .cse3 1)) (< ~q2_back~0 v_~q2_front~0_45)))))) (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_270 (Array Int Int)) (~q1~0.base Int) (v_~q2_front~0_45 Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (let ((.cse13 (select .cse15 |c_ULTIMATE.start_main_#t~ret17#1.base|)) (.cse14 (select .cse15 ~q1~0.base))) (let ((.cse10 (select .cse14 (+ .cse5 ~q1~0.offset 4))) (.cse9 (select .cse14 (+ .cse7 ~q1~0.offset 4))) (.cse11 (select .cse13 (+ (* 4 v_~q2_front~0_45) |c_ULTIMATE.start_main_#t~ret17#1.offset|))) (.cse12 (select .cse13 (+ |c_ULTIMATE.start_main_#t~ret17#1.offset| (* ~q2_back~0 4))))) (or (< v_~q2_front~0_45 1) (< .cse9 (+ .cse10 1)) (< .cse11 .cse10) (< .cse9 (+ .cse12 1)) (< .cse11 .cse12) (<= c_~n2~0 ~q2_back~0) (< ~q2_back~0 v_~q2_front~0_45)))))))) is different from false [2023-01-10 14:18:35,720 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_~q1_back~0 4)) (.cse6 (* c_~q1_front~0 4))) (and (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_270 (Array Int Int)) (~q1~0.base Int) (v_~q2_front~0_45 Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (let ((.cse4 (select .cse8 ~q1~0.base)) (.cse7 (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse1 (select .cse7 (+ (* ~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (.cse0 (select .cse7 (+ (* 4 v_~q2_front~0_45) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (.cse2 (select .cse4 (+ .cse6 ~q1~0.offset 4))) (.cse3 (select .cse4 (+ .cse5 ~q1~0.offset 4)))) (or (< v_~q2_front~0_45 1) (< .cse0 (+ .cse1 1)) (< .cse2 .cse1) (< .cse0 (+ .cse3 1)) (< .cse2 .cse3) (<= c_~n2~0 ~q2_back~0) (< ~q2_back~0 v_~q2_front~0_45)))))) (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_270 (Array Int Int)) (~q1~0.base Int) (v_~q2_front~0_45 Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (let ((.cse13 (select .cse15 ~q1~0.base)) (.cse14 (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse9 (select .cse14 (+ (* 4 v_~q2_front~0_45) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (.cse12 (select .cse14 (+ (* ~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (.cse11 (select .cse13 (+ .cse6 ~q1~0.offset 4))) (.cse10 (select .cse13 (+ .cse5 ~q1~0.offset 4)))) (or (< .cse9 .cse10) (< .cse11 (+ .cse12 1)) (< v_~q2_front~0_45 1) (< .cse9 .cse12) (< .cse11 (+ .cse10 1)) (<= c_~n2~0 ~q2_back~0) (< ~q2_back~0 v_~q2_front~0_45)))))))) is different from false [2023-01-10 14:18:35,781 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_~q1_back~0 4)) (.cse6 (* c_~q1_front~0 4))) (and (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_270 (Array Int Int)) (~q1~0.base Int) (v_~q2_front~0_45 Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (let ((.cse4 (select .cse8 ~q1~0.base)) (.cse7 (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse7 (+ (* 4 v_~q2_front~0_45) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse1 (select .cse7 (+ (* ~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse3 (select .cse4 (+ .cse6 ~q1~0.offset 4))) (.cse2 (select .cse4 (+ .cse5 ~q1~0.offset 4)))) (or (< v_~q2_front~0_45 1) (< .cse0 (+ .cse1 1)) (< .cse0 (+ .cse2 1)) (< .cse3 .cse1) (< .cse3 .cse2) (<= c_~n2~0 ~q2_back~0) (< ~q2_back~0 v_~q2_front~0_45)))))) (forall ((~q1~0.offset Int) (~q2_back~0 Int) (v_ArrVal_270 (Array Int Int)) (~q1~0.base Int) (v_~q2_front~0_45 Int) (v_ArrVal_269 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270))) (let ((.cse13 (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse14 (select .cse15 ~q1~0.base))) (let ((.cse11 (select .cse14 (+ .cse6 ~q1~0.offset 4))) (.cse10 (select .cse14 (+ .cse5 ~q1~0.offset 4))) (.cse9 (select .cse13 (+ (* 4 v_~q2_front~0_45) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse12 (select .cse13 (+ (* ~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse9 .cse10) (< .cse11 (+ .cse12 1)) (< v_~q2_front~0_45 1) (< .cse11 (+ .cse10 1)) (< .cse9 .cse12) (<= c_~n2~0 ~q2_back~0) (< ~q2_back~0 v_~q2_front~0_45)))))))) is different from false [2023-01-10 14:18:37,030 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 14:18:37,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 145 [2023-01-10 14:18:37,100 INFO L321 Elim1Store]: treesize reduction 9, result has 91.4 percent of original size [2023-01-10 14:18:37,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2085 treesize of output 1858 [2023-01-10 14:18:37,150 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 14:18:37,198 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 14:18:37,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 870 treesize of output 690 [2023-01-10 14:18:37,219 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 14:18:37,247 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 14:18:37,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 602 treesize of output 552 [2023-01-10 14:18:55,851 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 14:18:55,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 145 [2023-01-10 14:18:55,902 INFO L321 Elim1Store]: treesize reduction 57, result has 45.7 percent of original size [2023-01-10 14:18:55,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3989 treesize of output 3424 [2023-01-10 14:18:55,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 14:18:55,980 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 14:18:55,992 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 14:18:55,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 801 treesize of output 694 [2023-01-10 14:18:56,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 14:18:56,009 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-10 14:18:56,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 14:18:56,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 731 treesize of output 485 [2023-01-10 14:18:57,417 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 25 refuted. 1 times theorem prover too weak. 52 trivial. 0 not checked. [2023-01-10 14:18:57,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194143215] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 14:18:57,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 14:18:57,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 41, 34] total 127 [2023-01-10 14:18:57,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727455958] [2023-01-10 14:18:57,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 14:18:57,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 127 states [2023-01-10 14:18:57,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 14:18:57,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2023-01-10 14:18:57,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=777, Invalid=13991, Unknown=14, NotChecked=1220, Total=16002 [2023-01-10 14:18:57,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:18:57,427 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 14:18:57,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 127 states, 127 states have (on average 3.795275590551181) internal successors, (482), 127 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 14:18:57,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:18:57,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 14:18:57,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-01-10 14:18:57,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2023-01-10 14:18:57,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-01-10 14:18:57,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-01-10 14:18:57,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 14:18:57,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-01-10 14:18:57,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:19:06,096 WARN L222 SmtUtils]: Spent 8.11s on a formula simplification. DAG size of input: 98 DAG size of output: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 14:19:12,452 WARN L222 SmtUtils]: Spent 6.11s on a formula simplification. DAG size of input: 99 DAG size of output: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 14:19:18,806 WARN L222 SmtUtils]: Spent 6.11s on a formula simplification. DAG size of input: 100 DAG size of output: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 14:19:57,709 WARN L222 SmtUtils]: Spent 38.46s on a formula simplification. DAG size of input: 169 DAG size of output: 118 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 14:19:59,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 14:20:01,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 14:20:26,230 WARN L222 SmtUtils]: Spent 24.25s on a formula simplification. DAG size of input: 95 DAG size of output: 94 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 14:20:50,824 WARN L222 SmtUtils]: Spent 24.20s on a formula simplification. DAG size of input: 99 DAG size of output: 98 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 14:20:52,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 14:20:54,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 14:20:56,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 14:20:58,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 14:21:00,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 14:21:02,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 14:21:04,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 14:21:07,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 14:21:09,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 14:21:11,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 14:21:35,557 WARN L222 SmtUtils]: Spent 24.22s on a formula simplification. DAG size of input: 101 DAG size of output: 100 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 14:21:37,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 14:21:50,029 WARN L222 SmtUtils]: Spent 12.10s on a formula simplification that was a NOOP. DAG size: 97 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 14:22:07,063 WARN L222 SmtUtils]: Spent 8.21s on a formula simplification. DAG size of input: 133 DAG size of output: 84 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 14:22:16,258 WARN L222 SmtUtils]: Spent 8.21s on a formula simplification. DAG size of input: 133 DAG size of output: 84 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 14:22:26,318 WARN L222 SmtUtils]: Spent 6.42s on a formula simplification. DAG size of input: 137 DAG size of output: 88 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 14:22:32,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:22:32,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 14:22:32,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-10 14:22:32,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-01-10 14:22:32,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-10 14:22:32,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-10 14:22:32,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 14:22:32,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-01-10 14:22:32,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-01-10 14:22:32,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-01-10 14:22:32,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 14:22:32,667 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 14:22:32,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 14:22:32,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1777810444, now seen corresponding path program 7 times [2023-01-10 14:22:32,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 14:22:32,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578516277] [2023-01-10 14:22:32,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 14:22:32,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 14:22:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 14:22:43,252 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 14:22:43,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 14:22:43,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578516277] [2023-01-10 14:22:43,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578516277] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 14:22:43,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937572344] [2023-01-10 14:22:43,258 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-10 14:22:43,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 14:22:43,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 14:22:43,259 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 14:22:43,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-10 14:22:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 14:22:43,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 87 conjunts are in the unsatisfiable core [2023-01-10 14:22:43,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 14:22:49,429 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 14:22:49,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 35 [2023-01-10 14:22:49,834 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 14:22:49,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 14:22:51,414 INFO L321 Elim1Store]: treesize reduction 30, result has 87.6 percent of original size [2023-01-10 14:22:51,415 INFO L350 Elim1Store]: Elim1 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 88 treesize of output 240 [2023-01-10 14:22:57,494 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 14:22:57,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937572344] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 14:22:57,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 14:22:57,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 46, 46] total 145 [2023-01-10 14:22:57,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042944543] [2023-01-10 14:22:57,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 14:22:57,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 145 states [2023-01-10 14:22:57,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 14:22:57,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2023-01-10 14:22:57,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1755, Invalid=19124, Unknown=1, NotChecked=0, Total=20880 [2023-01-10 14:22:57,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:22:57,500 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 14:22:57,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 145 states, 145 states have (on average 3.7724137931034485) internal successors, (547), 145 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 14:22:57,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:22:57,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-01-10 14:22:57,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-01-10 14:22:57,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2023-01-10 14:22:57,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-01-10 14:22:57,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-01-10 14:22:57,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-01-10 14:22:57,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-01-10 14:22:57,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2023-01-10 14:22:57,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:23:10,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 14:23:10,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-10 14:23:10,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-10 14:23:10,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-01-10 14:23:10,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-10 14:23:10,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-10 14:23:10,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-10 14:23:10,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-01-10 14:23:10,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-01-10 14:23:10,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-01-10 14:23:10,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-01-10 14:23:10,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 14:23:10,267 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 14:23:10,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 14:23:10,267 INFO L85 PathProgramCache]: Analyzing trace with hash 383468219, now seen corresponding path program 8 times [2023-01-10 14:23:10,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 14:23:10,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164741373] [2023-01-10 14:23:10,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 14:23:10,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 14:23:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 14:23:22,354 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 14:23:22,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 14:23:22,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164741373] [2023-01-10 14:23:22,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164741373] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 14:23:22,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049057102] [2023-01-10 14:23:22,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-10 14:23:22,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 14:23:22,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 14:23:22,355 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-10 14:23:22,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-10 14:23:22,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-10 14:23:22,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 14:23:22,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 66 conjunts are in the unsatisfiable core [2023-01-10 14:23:22,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 14:23:25,396 INFO L321 Elim1Store]: treesize reduction 29, result has 45.3 percent of original size [2023-01-10 14:23:25,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 38 [2023-01-10 14:23:25,740 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-01-10 14:23:25,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 14:23:27,638 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 14:23:27,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 108 treesize of output 400 [2023-01-10 14:23:32,156 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:23:53,197 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:23:56,824 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:23:57,692 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:24:18,599 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:24:21,496 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:24:36,493 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:24:37,000 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:24:37,231 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:24:37,358 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:24:37,481 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:24:37,688 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:24:37,775 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:24:37,831 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:24:37,885 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:25:38,264 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:25:47,491 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:25:48,488 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:25:49,427 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:25:49,909 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:25:50,215 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:25:50,225 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:25:58,941 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:25:59,447 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:25:59,635 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:25:59,806 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:26:00,021 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:26:00,199 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:26:00,392 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:26:00,595 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:26:00,894 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:26:06,598 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:26:09,411 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:26:09,508 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:26:14,619 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:26:20,683 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:26:25,152 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:26:26,026 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:26:35,902 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:26:57,975 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:27:03,755 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:28:17,435 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:28:18,508 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:28:18,764 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:28:19,211 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:28:19,698 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:28:20,021 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:28:20,345 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:28:20,440 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-01-10 14:28:20,548 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. Received shutdown request... [2023-01-10 14:29:19,336 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 14:29:19,337 WARN L238 SmtUtils]: Removed 2 from assertion stack [2023-01-10 14:29:19,339 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-01-10 14:29:19,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-01-10 14:29:19,349 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 14:29:19,375 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 14:29:19,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-01-10 14:29:19,550 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 227 with TraceHistMax 6,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 8ms.. [2023-01-10 14:29:19,569 INFO L445 BasicCegarLoop]: Path program histogram: [8, 1, 1, 1] [2023-01-10 14:29:19,570 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/3) [2023-01-10 14:29:19,572 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-10 14:29:19,572 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-10 14:29:19,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:29:19 BasicIcfg [2023-01-10 14:29:19,574 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-10 14:29:19,574 INFO L158 Benchmark]: Toolchain (without parser) took 844695.09ms. Allocated memory was 324.0MB in the beginning and 978.3MB in the end (delta: 654.3MB). Free memory was 286.3MB in the beginning and 551.1MB in the end (delta: -264.9MB). Peak memory consumption was 644.3MB. Max. memory is 8.0GB. [2023-01-10 14:29:19,575 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 177.2MB. Free memory was 127.8MB in the beginning and 127.7MB in the end (delta: 122.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-01-10 14:29:19,575 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.39ms. Allocated memory is still 324.0MB. Free memory was 285.8MB in the beginning and 274.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-01-10 14:29:19,575 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.80ms. Allocated memory is still 324.0MB. Free memory was 274.2MB in the beginning and 272.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-01-10 14:29:19,576 INFO L158 Benchmark]: Boogie Preprocessor took 29.90ms. Allocated memory is still 324.0MB. Free memory was 272.1MB in the beginning and 270.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-01-10 14:29:19,576 INFO L158 Benchmark]: RCFGBuilder took 537.83ms. Allocated memory is still 324.0MB. Free memory was 270.0MB in the beginning and 240.7MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2023-01-10 14:29:19,577 INFO L158 Benchmark]: TraceAbstraction took 843840.61ms. Allocated memory was 324.0MB in the beginning and 978.3MB in the end (delta: 654.3MB). Free memory was 240.1MB in the beginning and 551.1MB in the end (delta: -311.0MB). Peak memory consumption was 598.2MB. Max. memory is 8.0GB. [2023-01-10 14:29:19,579 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 177.2MB. Free memory was 127.8MB in the beginning and 127.7MB in the end (delta: 122.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 234.39ms. Allocated memory is still 324.0MB. Free memory was 285.8MB in the beginning and 274.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.80ms. Allocated memory is still 324.0MB. Free memory was 274.2MB in the beginning and 272.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.90ms. Allocated memory is still 324.0MB. Free memory was 272.1MB in the beginning and 270.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 537.83ms. Allocated memory is still 324.0MB. Free memory was 270.0MB in the beginning and 240.7MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 843840.61ms. Allocated memory was 324.0MB in the beginning and 978.3MB in the end (delta: 654.3MB). Free memory was 240.1MB in the beginning and 551.1MB in the end (delta: -311.0MB). Peak memory consumption was 598.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2292, independent: 1296, independent conditional: 1296, independent unconditional: 0, dependent: 996, dependent conditional: 996, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1313, independent: 1296, independent conditional: 1296, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1313, independent: 1296, independent conditional: 1296, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1380, independent: 1296, independent conditional: 0, independent unconditional: 1296, dependent: 84, dependent conditional: 67, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1380, independent: 1296, independent conditional: 0, independent unconditional: 1296, dependent: 84, dependent conditional: 32, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1380, independent: 1296, independent conditional: 0, independent unconditional: 1296, dependent: 84, dependent conditional: 32, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 109, independent: 100, independent conditional: 0, independent unconditional: 100, dependent: 9, dependent conditional: 8, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 109, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 10, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 9, dependent conditional: 8, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 9, dependent conditional: 8, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 72, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 67, dependent conditional: 35, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1380, independent: 1196, independent conditional: 0, independent unconditional: 1196, dependent: 75, dependent conditional: 24, dependent unconditional: 51, unknown: 109, unknown conditional: 8, unknown unconditional: 101] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 100, Positive conditional cache size: 0, Positive unconditional cache size: 100, Negative cache size: 9, Negative conditional cache size: 8, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 35, Maximal queried relation: 7, Independence queries for same thread: 979 - StatisticsResult: Traversal Statistics Data States: 191, Transitions: 209, Traversal time: 83317636.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 4 - StatisticsResult: Traversal Statistics Data States: 191, Transitions: 214, Traversal time: 38925630.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 4 - StatisticsResult: Traversal Statistics Data States: 198, Transitions: 221, Traversal time: 119513964.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 4 - StatisticsResult: Traversal Statistics Data States: 205, Transitions: 228, Traversal time: 71082214.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 4 - StatisticsResult: Traversal Statistics Data States: 180, Transitions: 189, Traversal time: 55821531790.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Traversal Statistics Data States: 188, Transitions: 197, Traversal time: 212836374.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Traversal Statistics Data States: 205, Transitions: 215, Traversal time: 333567487.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Traversal Statistics Data States: 213, Transitions: 223, Traversal time: 325321611.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Traversal Statistics Data States: 210, Transitions: 220, Traversal time: 386382449.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Traversal Statistics Data States: 226, Transitions: 236, Traversal time: 201743361411.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Traversal Statistics Data States: 246, Transitions: 257, Traversal time: 10201343840.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 227 with TraceHistMax 6,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 8ms.. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 178 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 843710393107.0ns, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 8, EmptinessCheckTime: 314563778796.0ns, FeasibilityCheckTime: 527604609852.0ns, RefinementTime: 48350470.0ns, AutomataDifference: 0.0ns, DeadEndRemovalTime: 0.0ns, HoareAnnotationTime: 0.0ns, InitialAbstractionConstructionTime: 15377488.0ns, HoareTripleCheckerStatistics: 41 mSolverCounterUnknown, 4870 SdHoareTripleChecker+Valid, 45625923243.0ns IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4870 mSDsluCounter, 24813 SdHoareTripleChecker+Invalid, 44493634236.0ns Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1313 IncrementalHoareTripleChecker+Unchecked, 23423 mSDsCounter, 346 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15329 IncrementalHoareTripleChecker+Invalid, 17029 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 346 mSolverCounterUnsat, 1390 mSDtfsCounter, 15329 mSolverCounterSat, 123637816.0ns SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: No data available, 0.0ns BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 278, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ns DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 141216130.0ns SsaConstructionTime, 1025690863.0ns SatisfiabilityAnalysisTime, 156838107186.0ns InterpolantComputationTime, 2735 NumberOfCodeBlocks, 2718 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3795 ConstructedInterpolants, 172 QuantifiedInterpolants, 86788 SizeOfPredicates, 191 NumberOfNonLiveVariables, 2567 ConjunctsInSsa, 296 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 488/1185 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown