./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/cart.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-data/cart.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85f7d1ed54d862786907cd1b4275170af31fb3969b21d7a2f2e5e352106544af --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 14:58:58,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 14:58:58,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 14:58:58,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 14:58:58,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 14:58:58,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 14:58:58,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 14:58:58,927 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 14:58:58,929 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 14:58:58,932 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 14:58:58,933 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 14:58:58,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 14:58:58,935 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 14:58:58,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 14:58:58,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 14:58:58,939 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 14:58:58,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 14:58:58,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 14:58:58,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 14:58:58,945 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 14:58:58,947 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 14:58:58,948 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 14:58:58,948 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 14:58:58,949 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 14:58:58,950 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 14:58:58,955 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 14:58:58,955 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 14:58:58,955 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 14:58:58,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 14:58:58,957 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 14:58:58,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 14:58:58,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 14:58:58,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 14:58:58,959 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 14:58:58,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 14:58:58,960 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 14:58:58,960 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 14:58:58,961 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 14:58:58,961 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 14:58:58,961 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 14:58:58,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 14:58:58,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 14:58:58,964 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 14:58:58,987 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 14:58:58,988 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 14:58:58,988 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 14:58:58,988 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 14:58:58,989 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 14:58:58,989 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 14:58:58,989 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 14:58:58,989 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 14:58:58,989 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 14:58:58,990 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 14:58:58,990 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 14:58:58,991 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 14:58:58,991 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 14:58:58,991 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 14:58:58,991 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 14:58:58,991 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 14:58:58,991 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 14:58:58,991 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 14:58:58,992 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 14:58:58,992 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 14:58:58,992 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 14:58:58,992 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 14:58:58,992 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 14:58:58,992 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 14:58:58,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:58:58,993 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 14:58:58,993 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 14:58:58,993 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 14:58:58,993 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 14:58:58,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 14:58:58,993 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 14:58:58,993 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 14:58:58,994 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 14:58:58,994 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 85f7d1ed54d862786907cd1b4275170af31fb3969b21d7a2f2e5e352106544af [2022-07-22 14:58:59,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 14:58:59,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 14:58:59,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 14:58:59,214 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 14:58:59,214 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 14:58:59,215 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/cart.i [2022-07-22 14:58:59,268 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5df8e1d0/1e5d209fecf542a4b2154b866152dc53/FLAG4a60ea9c6 [2022-07-22 14:58:59,634 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 14:58:59,634 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/cart.i [2022-07-22 14:58:59,641 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5df8e1d0/1e5d209fecf542a4b2154b866152dc53/FLAG4a60ea9c6 [2022-07-22 14:58:59,649 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5df8e1d0/1e5d209fecf542a4b2154b866152dc53 [2022-07-22 14:58:59,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 14:58:59,652 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 14:58:59,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 14:58:59,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 14:58:59,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 14:58:59,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:58:59" (1/1) ... [2022-07-22 14:58:59,656 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e1388c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:58:59, skipping insertion in model container [2022-07-22 14:58:59,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:58:59" (1/1) ... [2022-07-22 14:58:59,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 14:58:59,679 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:58:59,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/cart.i[23713,23726] [2022-07-22 14:58:59,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:58:59,902 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 14:58:59,938 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/cart.i[23713,23726] [2022-07-22 14:58:59,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:58:59,972 INFO L208 MainTranslator]: Completed translation [2022-07-22 14:58:59,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:58:59 WrapperNode [2022-07-22 14:58:59,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 14:58:59,973 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 14:58:59,973 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 14:58:59,974 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 14:58:59,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:58:59" (1/1) ... [2022-07-22 14:58:59,996 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:58:59" (1/1) ... [2022-07-22 14:59:00,009 INFO L137 Inliner]: procedures = 121, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2022-07-22 14:59:00,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 14:59:00,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 14:59:00,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 14:59:00,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 14:59:00,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:58:59" (1/1) ... [2022-07-22 14:59:00,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:58:59" (1/1) ... [2022-07-22 14:59:00,018 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:58:59" (1/1) ... [2022-07-22 14:59:00,018 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:58:59" (1/1) ... [2022-07-22 14:59:00,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:58:59" (1/1) ... [2022-07-22 14:59:00,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:58:59" (1/1) ... [2022-07-22 14:59:00,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:58:59" (1/1) ... [2022-07-22 14:59:00,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 14:59:00,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 14:59:00,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 14:59:00,028 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 14:59:00,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:58:59" (1/1) ... [2022-07-22 14:59:00,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:59:00,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:59:00,052 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 14:59:00,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 14:59:00,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 14:59:00,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 14:59:00,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 14:59:00,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 14:59:00,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 14:59:00,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 14:59:00,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 14:59:00,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 14:59:00,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 14:59:00,133 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 14:59:00,134 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 14:59:00,225 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 14:59:00,229 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 14:59:00,229 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 14:59:00,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:59:00 BoogieIcfgContainer [2022-07-22 14:59:00,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 14:59:00,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 14:59:00,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 14:59:00,234 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 14:59:00,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 02:58:59" (1/3) ... [2022-07-22 14:59:00,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a132d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:59:00, skipping insertion in model container [2022-07-22 14:59:00,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:58:59" (2/3) ... [2022-07-22 14:59:00,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a132d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:59:00, skipping insertion in model container [2022-07-22 14:59:00,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:59:00" (3/3) ... [2022-07-22 14:59:00,236 INFO L111 eAbstractionObserver]: Analyzing ICFG cart.i [2022-07-22 14:59:00,246 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 14:59:00,247 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 14:59:00,277 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 14:59:00,281 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=PETRI_NET, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@205507f3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@47a8c84d [2022-07-22 14:59:00,282 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 14:59:00,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:00,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 14:59:00,288 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:59:00,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:59:00,289 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:59:00,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:59:00,293 INFO L85 PathProgramCache]: Analyzing trace with hash -680841488, now seen corresponding path program 1 times [2022-07-22 14:59:00,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:59:00,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190472312] [2022-07-22 14:59:00,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:59:00,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:59:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:59:00,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:59:00,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:59:00,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190472312] [2022-07-22 14:59:00,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190472312] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:59:00,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:59:00,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 14:59:00,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937177713] [2022-07-22 14:59:00,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:59:00,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 14:59:00,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:59:00,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 14:59:00,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:59:00,422 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 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) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:00,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:59:00,431 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2022-07-22 14:59:00,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 14:59:00,433 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) Word has length 9 [2022-07-22 14:59:00,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:59:00,438 INFO L225 Difference]: With dead ends: 34 [2022-07-22 14:59:00,438 INFO L226 Difference]: Without dead ends: 17 [2022-07-22 14:59:00,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:59:00,443 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:59:00,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:59:00,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-22 14:59:00,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-22 14:59:00,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:00,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2022-07-22 14:59:00,470 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 9 [2022-07-22 14:59:00,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:59:00,470 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2022-07-22 14:59:00,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:00,471 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2022-07-22 14:59:00,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-22 14:59:00,471 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:59:00,471 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:59:00,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 14:59:00,472 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:59:00,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:59:00,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1910225148, now seen corresponding path program 1 times [2022-07-22 14:59:00,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:59:00,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541298090] [2022-07-22 14:59:00,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:59:00,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:59:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:59:00,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:59:00,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:59:00,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541298090] [2022-07-22 14:59:00,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541298090] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:59:00,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:59:00,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:59:00,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858751947] [2022-07-22 14:59:00,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:59:00,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:59:00,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:59:00,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:59:00,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:59:00,564 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:00,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:59:00,607 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-07-22 14:59:00,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 14:59:00,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) Word has length 12 [2022-07-22 14:59:00,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:59:00,608 INFO L225 Difference]: With dead ends: 36 [2022-07-22 14:59:00,608 INFO L226 Difference]: Without dead ends: 21 [2022-07-22 14:59:00,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:59:00,609 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:59:00,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 48 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:59:00,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-22 14:59:00,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-22 14:59:00,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:00,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-07-22 14:59:00,613 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 12 [2022-07-22 14:59:00,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:59:00,614 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-07-22 14:59:00,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:00,614 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-07-22 14:59:00,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 14:59:00,615 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:59:00,615 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:59:00,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 14:59:00,615 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:59:00,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:59:00,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1849394690, now seen corresponding path program 1 times [2022-07-22 14:59:00,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:59:00,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162543664] [2022-07-22 14:59:00,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:59:00,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:59:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:59:00,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:59:00,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:59:00,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162543664] [2022-07-22 14:59:00,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162543664] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:59:00,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:59:00,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:59:00,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181040779] [2022-07-22 14:59:00,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:59:00,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:59:00,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:59:00,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:59:00,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:59:00,671 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:00,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:59:00,698 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-07-22 14:59:00,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 14:59:00,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) Word has length 16 [2022-07-22 14:59:00,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:59:00,701 INFO L225 Difference]: With dead ends: 36 [2022-07-22 14:59:00,701 INFO L226 Difference]: Without dead ends: 30 [2022-07-22 14:59:00,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:59:00,703 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 33 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:59:00,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 41 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:59:00,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-22 14:59:00,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2022-07-22 14:59:00,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:00,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-07-22 14:59:00,712 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 16 [2022-07-22 14:59:00,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:59:00,713 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-07-22 14:59:00,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:00,713 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-07-22 14:59:00,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 14:59:00,715 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:59:00,715 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:59:00,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 14:59:00,715 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:59:00,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:59:00,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1690179633, now seen corresponding path program 1 times [2022-07-22 14:59:00,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:59:00,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582662141] [2022-07-22 14:59:00,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:59:00,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:59:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:59:00,777 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 14:59:00,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:59:00,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582662141] [2022-07-22 14:59:00,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582662141] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:59:00,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:59:00,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:59:00,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212987544] [2022-07-22 14:59:00,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:59:00,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:59:00,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:59:00,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:59:00,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:59:00,779 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:00,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:59:00,788 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2022-07-22 14:59:00,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:59:00,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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) Word has length 20 [2022-07-22 14:59:00,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:59:00,789 INFO L225 Difference]: With dead ends: 37 [2022-07-22 14:59:00,789 INFO L226 Difference]: Without dead ends: 27 [2022-07-22 14:59:00,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:59:00,790 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:59:00,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:59:00,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-22 14:59:00,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-22 14:59:00,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:00,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-07-22 14:59:00,794 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 20 [2022-07-22 14:59:00,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:59:00,794 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-07-22 14:59:00,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:00,794 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-07-22 14:59:00,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 14:59:00,795 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:59:00,795 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:59:00,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 14:59:00,795 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:59:00,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:59:00,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1795441037, now seen corresponding path program 1 times [2022-07-22 14:59:00,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:59:00,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602658653] [2022-07-22 14:59:00,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:59:00,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:59:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:59:00,987 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:59:00,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:59:00,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602658653] [2022-07-22 14:59:00,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602658653] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:59:00,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165762645] [2022-07-22 14:59:00,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:59:00,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:59:00,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:59:01,008 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:59:01,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 14:59:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:59:01,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-22 14:59:01,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:59:01,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-07-22 14:59:01,332 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:59:01,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 26 treesize of output 10 [2022-07-22 14:59:01,338 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:59:01,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:59:01,472 INFO L356 Elim1Store]: treesize reduction 30, result has 30.2 percent of original size [2022-07-22 14:59:01,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 488 treesize of output 441 [2022-07-22 14:59:01,680 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 14:59:01,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165762645] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:59:01,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:59:01,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 13 [2022-07-22 14:59:01,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283771579] [2022-07-22 14:59:01,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:59:01,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 14:59:01,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:59:01,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 14:59:01,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-07-22 14:59:01,687 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:01,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:59:01,850 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-07-22 14:59:01,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 14:59:01,851 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 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) Word has length 20 [2022-07-22 14:59:01,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:59:01,851 INFO L225 Difference]: With dead ends: 48 [2022-07-22 14:59:01,851 INFO L226 Difference]: Without dead ends: 46 [2022-07-22 14:59:01,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2022-07-22 14:59:01,852 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 67 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:59:01,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 125 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 78 Invalid, 0 Unknown, 21 Unchecked, 0.1s Time] [2022-07-22 14:59:01,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-22 14:59:01,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2022-07-22 14:59:01,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:01,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2022-07-22 14:59:01,857 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 20 [2022-07-22 14:59:01,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:59:01,857 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2022-07-22 14:59:01,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:01,857 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-07-22 14:59:01,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-22 14:59:01,858 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:59:01,858 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:59:01,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 14:59:02,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:59:02,068 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:59:02,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:59:02,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1534874359, now seen corresponding path program 1 times [2022-07-22 14:59:02,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:59:02,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094075076] [2022-07-22 14:59:02,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:59:02,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:59:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:59:02,171 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 14:59:02,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:59:02,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094075076] [2022-07-22 14:59:02,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094075076] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:59:02,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462669555] [2022-07-22 14:59:02,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:59:02,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:59:02,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:59:02,176 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:59:02,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 14:59:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:59:02,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-22 14:59:02,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:59:02,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:59:02,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:59:02,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:59:02,353 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:59:02,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:59:02,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-07-22 14:59:02,399 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:59:02,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2022-07-22 14:59:02,407 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-22 14:59:02,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2022-07-22 14:59:02,420 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 14:59:02,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462669555] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:59:02,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:59:02,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 13 [2022-07-22 14:59:02,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086458363] [2022-07-22 14:59:02,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:59:02,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 14:59:02,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:59:02,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 14:59:02,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-07-22 14:59:02,422 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:02,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:59:02,585 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2022-07-22 14:59:02,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 14:59:02,586 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 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) Word has length 23 [2022-07-22 14:59:02,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:59:02,587 INFO L225 Difference]: With dead ends: 59 [2022-07-22 14:59:02,587 INFO L226 Difference]: Without dead ends: 49 [2022-07-22 14:59:02,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-07-22 14:59:02,588 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 84 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:59:02,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 141 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 14:59:02,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-22 14:59:02,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2022-07-22 14:59:02,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:02,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-07-22 14:59:02,592 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 23 [2022-07-22 14:59:02,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:59:02,592 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-07-22 14:59:02,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:02,592 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-07-22 14:59:02,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 14:59:02,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:59:02,592 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:59:02,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 14:59:02,803 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,SelfDestructingSolverStorable5 [2022-07-22 14:59:02,804 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:59:02,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:59:02,804 INFO L85 PathProgramCache]: Analyzing trace with hash 379469720, now seen corresponding path program 2 times [2022-07-22 14:59:02,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:59:02,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332037296] [2022-07-22 14:59:02,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:59:02,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:59:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:59:02,908 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:59:02,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:59:02,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332037296] [2022-07-22 14:59:02,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332037296] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:59:02,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559776283] [2022-07-22 14:59:02,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 14:59:02,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:59:02,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:59:02,910 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:59:02,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 14:59:02,978 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 14:59:02,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:59:02,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-22 14:59:02,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:59:02,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:59:02,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:59:03,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:59:03,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:59:03,063 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:59:03,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:59:03,096 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:59:03,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559776283] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:59:03,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:59:03,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-07-22 14:59:03,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164844193] [2022-07-22 14:59:03,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:59:03,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 14:59:03,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:59:03,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 14:59:03,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-22 14:59:03,098 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:03,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:59:03,208 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2022-07-22 14:59:03,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 14:59:03,209 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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) Word has length 24 [2022-07-22 14:59:03,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:59:03,209 INFO L225 Difference]: With dead ends: 67 [2022-07-22 14:59:03,209 INFO L226 Difference]: Without dead ends: 40 [2022-07-22 14:59:03,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-22 14:59:03,210 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:59:03,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 118 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 14:59:03,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-22 14:59:03,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-07-22 14:59:03,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:03,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2022-07-22 14:59:03,214 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 24 [2022-07-22 14:59:03,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:59:03,214 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2022-07-22 14:59:03,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:03,214 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2022-07-22 14:59:03,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-22 14:59:03,214 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:59:03,214 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:59:03,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 14:59:03,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:59:03,423 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:59:03,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:59:03,424 INFO L85 PathProgramCache]: Analyzing trace with hash -3886178, now seen corresponding path program 3 times [2022-07-22 14:59:03,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:59:03,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907786222] [2022-07-22 14:59:03,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:59:03,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:59:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:59:03,601 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:59:03,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:59:03,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907786222] [2022-07-22 14:59:03,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907786222] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:59:03,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703091463] [2022-07-22 14:59:03,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 14:59:03,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:59:03,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:59:03,603 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:59:03,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 14:59:03,729 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-22 14:59:03,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:59:03,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-22 14:59:03,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:59:03,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:59:03,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:59:03,752 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-22 14:59:03,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-22 14:59:03,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-22 14:59:03,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-07-22 14:59:03,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-07-22 14:59:03,848 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:59:03,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 26 treesize of output 10 [2022-07-22 14:59:03,850 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:59:03,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:59:03,877 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_386 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_386) |c_ULTIMATE.start_main_~l~0#1.base|))) (<= (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))))) is different from false [2022-07-22 14:59:03,925 WARN L833 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_main_#t~short8#1| (forall ((v_ArrVal_379 Int) (v_ArrVal_380 Int) (v_ArrVal_386 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (or (not (<= v_ArrVal_380 |c_ULTIMATE.start_main_~order~0#1|)) (not (<= (select .cse0 .cse1) v_ArrVal_379)) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse0 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_380) .cse1 v_ArrVal_379)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_386) |c_ULTIMATE.start_main_~l~0#1.base|))) (<= (select .cse2 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (select .cse2 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)))))))) is different from false [2022-07-22 14:59:03,958 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-22 14:59:03,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 57 [2022-07-22 14:59:04,003 INFO L356 Elim1Store]: treesize reduction 36, result has 57.6 percent of original size [2022-07-22 14:59:04,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 83 [2022-07-22 14:59:04,016 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:59:04,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 11 [2022-07-22 14:59:04,106 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-22 14:59:04,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703091463] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:59:04,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:59:04,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 17 [2022-07-22 14:59:04,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907895795] [2022-07-22 14:59:04,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:59:04,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-22 14:59:04,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:59:04,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 14:59:04,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=171, Unknown=2, NotChecked=54, Total=272 [2022-07-22 14:59:04,109 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:04,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:59:04,346 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2022-07-22 14:59:04,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 14:59:04,346 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 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) Word has length 28 [2022-07-22 14:59:04,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:59:04,347 INFO L225 Difference]: With dead ends: 61 [2022-07-22 14:59:04,347 INFO L226 Difference]: Without dead ends: 56 [2022-07-22 14:59:04,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=351, Unknown=2, NotChecked=82, Total=552 [2022-07-22 14:59:04,348 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 75 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:59:04,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 192 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 116 Invalid, 0 Unknown, 97 Unchecked, 0.1s Time] [2022-07-22 14:59:04,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-22 14:59:04,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2022-07-22 14:59:04,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2022-07-22 14:59:04,352 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 28 [2022-07-22 14:59:04,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:59:04,353 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2022-07-22 14:59:04,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:04,353 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2022-07-22 14:59:04,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-22 14:59:04,354 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:59:04,354 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:59:04,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 14:59:04,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:59:04,567 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:59:04,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:59:04,568 INFO L85 PathProgramCache]: Analyzing trace with hash 194884952, now seen corresponding path program 2 times [2022-07-22 14:59:04,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:59:04,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716361365] [2022-07-22 14:59:04,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:59:04,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:59:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:59:04,738 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:59:04,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:59:04,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716361365] [2022-07-22 14:59:04,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716361365] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:59:04,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253627250] [2022-07-22 14:59:04,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 14:59:04,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:59:04,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:59:04,740 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:59:04,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 14:59:04,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 14:59:04,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:59:04,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-22 14:59:04,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:59:04,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:59:04,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:59:04,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:59:04,884 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-22 14:59:04,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-22 14:59:04,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:59:04,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:59:04,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:59:04,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2022-07-22 14:59:04,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:59:04,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:59:04,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:59:04,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-22 14:59:05,050 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:59:05,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 90 [2022-07-22 14:59:05,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:59:05,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 41 [2022-07-22 14:59:05,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2022-07-22 14:59:05,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2022-07-22 14:59:05,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2022-07-22 14:59:05,145 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:59:05,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 26 treesize of output 10 [2022-07-22 14:59:05,158 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:59:05,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:59:05,228 WARN L833 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_main_#t~short8#1| (forall ((v_ArrVal_516 (Array Int Int)) (v_ArrVal_519 Int) (v_ArrVal_517 Int) (v_ArrVal_522 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (or (not (<= (select .cse0 .cse1) v_ArrVal_517)) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse0 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_519) .cse1 v_ArrVal_517)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_522) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (.cse3 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (<= (select .cse2 (+ .cse3 8)) (select .cse2 (+ .cse3 4)))) (not (<= v_ArrVal_519 |c_ULTIMATE.start_main_~order~0#1|)))))) is different from false [2022-07-22 14:59:05,257 INFO L356 Elim1Store]: treesize reduction 58, result has 31.8 percent of original size [2022-07-22 14:59:05,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2075 treesize of output 1770 [2022-07-22 14:59:05,480 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_522 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_522) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) |c_ULTIMATE.start_main_~i~0#1.base|)) (forall ((v_ArrVal_516 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) |c_ULTIMATE.start_main_~i~0#1.offset|))) is different from false [2022-07-22 14:59:05,495 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_511 Int) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_508 Int)) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base|))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse0 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_508) (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4) v_ArrVal_511)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|)))) (forall ((v_ArrVal_509 Int) (v_ArrVal_513 Int) (v_ArrVal_522 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~i~0#1.offset|))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse2 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_509) (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4) v_ArrVal_513)) .cse1 v_ArrVal_522) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))))) is different from false [2022-07-22 14:59:05,518 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_511 Int) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_508 Int)) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8) v_ArrVal_508) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4) v_ArrVal_511)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) v_ArrVal_516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) (select .cse0 |c_ULTIMATE.start_main_~l~0#1.offset|)))) (forall ((v_ArrVal_509 Int) (v_ArrVal_513 Int) (v_ArrVal_522 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~l~0#1.offset|))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse2 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8) v_ArrVal_509) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4) v_ArrVal_513)) .cse1 v_ArrVal_522) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))))) is different from false [2022-07-22 14:59:05,556 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:59:05,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 60 [2022-07-22 14:59:05,561 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:59:05,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 70 [2022-07-22 14:59:05,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2022-07-22 14:59:05,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2022-07-22 14:59:05,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-07-22 14:59:05,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2022-07-22 14:59:05,591 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-22 14:59:05,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253627250] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:59:05,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:59:05,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2022-07-22 14:59:05,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700695214] [2022-07-22 14:59:05,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:59:05,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-22 14:59:05,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:59:05,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-22 14:59:05,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=361, Unknown=4, NotChecked=164, Total=600 [2022-07-22 14:59:05,594 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:06,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:59:06,018 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2022-07-22 14:59:06,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 14:59:06,019 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 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) Word has length 31 [2022-07-22 14:59:06,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:59:06,019 INFO L225 Difference]: With dead ends: 63 [2022-07-22 14:59:06,019 INFO L226 Difference]: Without dead ends: 61 [2022-07-22 14:59:06,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=541, Unknown=4, NotChecked=204, Total=870 [2022-07-22 14:59:06,020 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 60 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 14:59:06,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 404 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 280 Invalid, 0 Unknown, 155 Unchecked, 0.3s Time] [2022-07-22 14:59:06,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-22 14:59:06,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2022-07-22 14:59:06,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2022-07-22 14:59:06,025 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 31 [2022-07-22 14:59:06,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:59:06,025 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2022-07-22 14:59:06,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:06,025 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2022-07-22 14:59:06,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 14:59:06,025 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:59:06,025 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:59:06,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-22 14:59:06,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:59:06,242 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:59:06,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:59:06,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1832566487, now seen corresponding path program 4 times [2022-07-22 14:59:06,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:59:06,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179063141] [2022-07-22 14:59:06,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:59:06,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:59:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:59:06,435 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:59:06,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:59:06,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179063141] [2022-07-22 14:59:06,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179063141] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:59:06,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580003906] [2022-07-22 14:59:06,436 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 14:59:06,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:59:06,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:59:06,438 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:59:06,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 14:59:06,683 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 14:59:06,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:59:06,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-22 14:59:06,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:59:06,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:59:06,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:59:06,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:59:06,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-22 14:59:06,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-22 14:59:06,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:59:06,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-22 14:59:06,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:59:06,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-22 14:59:06,780 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-22 14:59:06,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-22 14:59:06,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 58 [2022-07-22 14:59:06,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:59:06,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:59:06,890 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:59:06,891 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 14:59:06,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 54 [2022-07-22 14:59:06,958 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:59:06,959 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 14:59:06,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2022-07-22 14:59:06,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 18 [2022-07-22 14:59:06,967 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:59:06,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:59:07,086 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:59:07,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 49 [2022-07-22 14:59:07,093 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:59:07,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 58 [2022-07-22 14:59:07,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-22 14:59:07,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-22 14:59:07,182 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:59:07,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-22 14:59:07,184 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:59:07,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-22 14:59:07,190 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:59:07,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-07-22 14:59:07,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2022-07-22 14:59:07,196 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:59:07,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-22 14:59:07,205 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:59:07,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580003906] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:59:07,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:59:07,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-07-22 14:59:07,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946286484] [2022-07-22 14:59:07,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:59:07,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 14:59:07,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:59:07,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 14:59:07,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-22 14:59:07,207 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:07,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:59:07,294 INFO L93 Difference]: Finished difference Result 88 states and 116 transitions. [2022-07-22 14:59:07,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 14:59:07,295 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 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) Word has length 32 [2022-07-22 14:59:07,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:59:07,295 INFO L225 Difference]: With dead ends: 88 [2022-07-22 14:59:07,295 INFO L226 Difference]: Without dead ends: 69 [2022-07-22 14:59:07,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-07-22 14:59:07,296 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 34 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:59:07,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 180 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 42 Unchecked, 0.1s Time] [2022-07-22 14:59:07,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-22 14:59:07,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-07-22 14:59:07,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 68 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:07,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 90 transitions. [2022-07-22 14:59:07,302 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 90 transitions. Word has length 32 [2022-07-22 14:59:07,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:59:07,302 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 90 transitions. [2022-07-22 14:59:07,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:07,302 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2022-07-22 14:59:07,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-22 14:59:07,302 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:59:07,303 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:59:07,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 14:59:07,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:59:07,520 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:59:07,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:59:07,520 INFO L85 PathProgramCache]: Analyzing trace with hash -974282402, now seen corresponding path program 3 times [2022-07-22 14:59:07,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:59:07,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175686150] [2022-07-22 14:59:07,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:59:07,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:59:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:59:07,709 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:59:07,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:59:07,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175686150] [2022-07-22 14:59:07,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175686150] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:59:07,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445054838] [2022-07-22 14:59:07,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 14:59:07,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:59:07,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:59:07,711 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:59:07,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 14:59:07,829 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-22 14:59:07,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:59:07,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-22 14:59:07,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:59:07,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:59:07,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:59:07,855 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-22 14:59:07,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-22 14:59:07,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:59:07,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:59:07,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:59:07,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2022-07-22 14:59:07,957 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:59:07,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 56 [2022-07-22 14:59:07,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2022-07-22 14:59:08,083 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-22 14:59:08,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2022-07-22 14:59:08,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2022-07-22 14:59:08,089 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:59:08,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:59:08,283 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:59:08,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 153 [2022-07-22 14:59:08,292 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:59:08,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 76 [2022-07-22 14:59:08,542 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:59:08,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 266 treesize of output 365 [2022-07-22 14:59:08,572 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:59:08,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 270 treesize of output 308 [2022-07-22 14:59:51,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-22 14:59:52,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-22 14:59:52,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-22 14:59:52,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-22 14:59:53,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-22 15:00:01,092 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:00:01,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445054838] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:00:01,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 15:00:01,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 27 [2022-07-22 15:00:01,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131482622] [2022-07-22 15:00:01,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 15:00:01,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-22 15:00:01,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:00:01,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-22 15:00:01,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=588, Unknown=22, NotChecked=0, Total=702 [2022-07-22 15:00:01,094 INFO L87 Difference]: Start difference. First operand 69 states and 90 transitions. Second operand has 27 states, 27 states have (on average 3.074074074074074) internal successors, (83), 27 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:00:01,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:00:01,804 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2022-07-22 15:00:01,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-22 15:00:01,805 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.074074074074074) internal successors, (83), 27 states have internal predecessors, (83), 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) Word has length 34 [2022-07-22 15:00:01,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:00:01,805 INFO L225 Difference]: With dead ends: 82 [2022-07-22 15:00:01,805 INFO L226 Difference]: Without dead ends: 54 [2022-07-22 15:00:01,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=330, Invalid=1438, Unknown=38, NotChecked=0, Total=1806 [2022-07-22 15:00:01,807 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 155 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 15:00:01,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 433 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 288 Invalid, 0 Unknown, 18 Unchecked, 0.3s Time] [2022-07-22 15:00:01,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-22 15:00:01,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2022-07-22 15:00:01,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:00:01,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2022-07-22 15:00:01,811 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 34 [2022-07-22 15:00:01,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:00:01,813 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2022-07-22 15:00:01,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.074074074074074) internal successors, (83), 27 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:00:01,813 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2022-07-22 15:00:01,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-22 15:00:01,813 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:00:01,813 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:00:01,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-22 15:00:02,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:00:02,028 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:00:02,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:00:02,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1909608239, now seen corresponding path program 5 times [2022-07-22 15:00:02,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:00:02,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573786839] [2022-07-22 15:00:02,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:00:02,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:00:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:00:02,310 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:00:02,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:00:02,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573786839] [2022-07-22 15:00:02,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573786839] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:00:02,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114851815] [2022-07-22 15:00:02,310 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 15:00:02,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:00:02,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:00:02,312 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 15:00:02,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-22 15:00:05,769 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-22 15:00:05,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 15:00:05,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-22 15:00:05,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:00:05,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 15:00:05,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 15:00:05,811 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-22 15:00:05,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-07-22 15:00:05,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-22 15:00:05,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:05,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-22 15:00:05,837 INFO L356 Elim1Store]: treesize reduction 37, result has 24.5 percent of original size [2022-07-22 15:00:05,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 22 [2022-07-22 15:00:05,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 15:00:05,903 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 15:00:05,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 36 [2022-07-22 15:00:05,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 15:00:05,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-07-22 15:00:05,971 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 15:00:05,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2022-07-22 15:00:05,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-07-22 15:00:05,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-07-22 15:00:06,008 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:00:06,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 26 treesize of output 10 [2022-07-22 15:00:06,010 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:00:06,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:00:06,053 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1017 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1017) |c_ULTIMATE.start_main_~l~0#1.base|))) (<= (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))))) is different from false [2022-07-22 15:00:06,064 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1012) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1017) |c_ULTIMATE.start_main_~l~0#1.base|))) (<= (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))))) is different from false [2022-07-22 15:00:06,099 WARN L833 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_main_#t~short8#1| (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1001 Int) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1005 Int) (v_ArrVal_1008 Int) (v_ArrVal_1007 Int)) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (or (let ((.cse0 (select (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse4 (select .cse5 |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse1 .cse2 v_ArrVal_1008) .cse3 v_ArrVal_1007)) .cse4 v_ArrVal_1012) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse5 .cse2 v_ArrVal_1005) .cse3 v_ArrVal_1001)) .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) v_ArrVal_1017))) |c_ULTIMATE.start_main_~l~0#1.base|))) (<= (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)))) (not (<= v_ArrVal_1008 |c_ULTIMATE.start_main_~order~0#1|)) (not (<= (select .cse1 .cse3) v_ArrVal_1007)))))) is different from false [2022-07-22 15:00:06,116 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-22 15:00:06,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 117 [2022-07-22 15:00:06,161 INFO L356 Elim1Store]: treesize reduction 36, result has 57.6 percent of original size [2022-07-22 15:00:06,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 209 treesize of output 233 [2022-07-22 15:00:06,165 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:00:06,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 182 treesize of output 166 [2022-07-22 15:00:06,169 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:00:06,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 86 treesize of output 78 [2022-07-22 15:00:06,336 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:00:06,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2022-07-22 15:00:06,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-22 15:00:06,386 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:00:06,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-07-22 15:00:06,389 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:00:06,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-22 15:00:06,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-22 15:00:06,415 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-07-22 15:00:06,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114851815] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:00:06,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 15:00:06,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2022-07-22 15:00:06,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470907514] [2022-07-22 15:00:06,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 15:00:06,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-22 15:00:06,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:00:06,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-22 15:00:06,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=285, Unknown=3, NotChecked=108, Total=462 [2022-07-22 15:00:06,417 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand has 22 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:00:06,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:00:06,823 INFO L93 Difference]: Finished difference Result 74 states and 95 transitions. [2022-07-22 15:00:06,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 15:00:06,824 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 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) Word has length 36 [2022-07-22 15:00:06,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:00:06,825 INFO L225 Difference]: With dead ends: 74 [2022-07-22 15:00:06,825 INFO L226 Difference]: Without dead ends: 69 [2022-07-22 15:00:06,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 61 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=640, Unknown=3, NotChecked=168, Total=992 [2022-07-22 15:00:06,826 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 71 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 15:00:06,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 291 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 133 Invalid, 0 Unknown, 155 Unchecked, 0.1s Time] [2022-07-22 15:00:06,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-22 15:00:06,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2022-07-22 15:00:06,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 57 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:00:06,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2022-07-22 15:00:06,833 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 36 [2022-07-22 15:00:06,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:00:06,833 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2022-07-22 15:00:06,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:00:06,833 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2022-07-22 15:00:06,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-22 15:00:06,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:00:06,834 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:00:06,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-22 15:00:07,050 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,SelfDestructingSolverStorable11 [2022-07-22 15:00:07,051 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:00:07,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:00:07,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1993858009, now seen corresponding path program 4 times [2022-07-22 15:00:07,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:00:07,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220565430] [2022-07-22 15:00:07,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:00:07,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:00:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:00:07,360 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:00:07,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:00:07,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220565430] [2022-07-22 15:00:07,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220565430] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:00:07,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538226177] [2022-07-22 15:00:07,361 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 15:00:07,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:00:07,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:00:07,362 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 15:00:07,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-22 15:00:07,601 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 15:00:07,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 15:00:07,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-22 15:00:07,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:00:07,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 15:00:07,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 15:00:07,642 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-22 15:00:07,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-07-22 15:00:07,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 15:00:07,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-22 15:00:07,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:07,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-07-22 15:00:07,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:07,691 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-22 15:00:07,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 22 [2022-07-22 15:00:07,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:07,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:07,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:07,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-22 15:00:07,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:07,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:07,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:07,796 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 15:00:07,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2022-07-22 15:00:07,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:07,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:07,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:07,888 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 15:00:07,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 156 treesize of output 121 [2022-07-22 15:00:07,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:07,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 41 [2022-07-22 15:00:07,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:07,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2022-07-22 15:00:07,970 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-22 15:00:07,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 95 [2022-07-22 15:00:07,978 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 15:00:07,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 72 [2022-07-22 15:00:07,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:07,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2022-07-22 15:00:08,071 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 15:00:08,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 42 [2022-07-22 15:00:08,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2022-07-22 15:00:08,097 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:00:08,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 26 treesize of output 10 [2022-07-22 15:00:08,099 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:00:08,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:00:08,168 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1221 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1222) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1221) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1223) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (<= (select .cse0 (+ .cse1 8)) (select .cse0 (+ .cse1 4))))) is different from false [2022-07-22 15:00:08,190 WARN L833 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_main_#t~short8#1| (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1211 Int) (v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1213 Int) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1221 (Array Int Int)) (v_ArrVal_1212 Int) (v_ArrVal_1215 Int)) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (or (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse0 (let ((.cse4 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|))) (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse3 .cse4 v_ArrVal_1211) .cse5 v_ArrVal_1212)) .cse2 v_ArrVal_1222) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse6 .cse4 v_ArrVal_1215) .cse5 v_ArrVal_1213)) .cse2 v_ArrVal_1221) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))) (.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1218) .cse2 v_ArrVal_1223) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (<= (select .cse0 (+ .cse1 8)) (select .cse0 (+ .cse1 4)))))) (not (<= (select .cse3 .cse5) v_ArrVal_1212)) (not (<= v_ArrVal_1211 |c_ULTIMATE.start_main_~order~0#1|)))))) is different from false [2022-07-22 15:00:08,208 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-22 15:00:08,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 137 [2022-07-22 15:00:08,271 INFO L356 Elim1Store]: treesize reduction 64, result has 76.6 percent of original size [2022-07-22 15:00:08,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 219 treesize of output 323 [2022-07-22 15:00:08,277 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:00:08,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 73 treesize of output 37 [2022-07-22 15:00:08,379 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1223 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1218) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1223) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) |c_ULTIMATE.start_main_~i~0#1.offset|)) (forall ((v_ArrVal_1213 Int) (v_ArrVal_1221 (Array Int Int)) (v_ArrVal_1215 Int)) (= |c_ULTIMATE.start_main_~i~0#1.base| (select (select (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse0 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1215) (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4) v_ArrVal_1213)) (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1221)) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1223 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1218) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1223) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (+ .cse1 4) |c_ULTIMATE.start_main_~i~0#1.offset|) (= .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|)))) (forall ((v_ArrVal_1213 Int) (v_ArrVal_1221 (Array Int Int)) (v_ArrVal_1215 Int)) (not (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|))) (= .cse2 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse3 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1215) (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4) v_ArrVal_1213)) .cse2 v_ArrVal_1221) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))))) (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1223 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1218) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1223) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|) (= (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4) .cse4))))) is different from false [2022-07-22 15:00:08,444 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1213 Int) (v_ArrVal_1221 (Array Int Int)) (v_ArrVal_1204 Int) (v_ArrVal_1215 Int) (v_ArrVal_1208 Int)) (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse4 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1204) (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4) v_ArrVal_1208)))) (let ((.cse2 (select .cse1 .cse0)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (store .cse1 .cse0 (store (store .cse2 (+ 8 .cse3) v_ArrVal_1215) (+ 4 .cse3) v_ArrVal_1213)) (select .cse2 .cse3) v_ArrVal_1221))) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))))) (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1202 Int) (v_ArrVal_1204 Int) (v_ArrVal_1206 Int) (v_ArrVal_1208 Int)) (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse6 (select (select (let ((.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse8 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse9 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4)) (.cse10 (select .cse11 |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse7 .cse8 v_ArrVal_1206) .cse9 v_ArrVal_1202)) .cse10 v_ArrVal_1218) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse11 .cse8 v_ArrVal_1204) .cse9 v_ArrVal_1208)) .cse10) .cse5) v_ArrVal_1223))) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (+ 4 .cse5) .cse6) (= .cse6 .cse5)))))) (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1202 Int) (v_ArrVal_1204 Int) (v_ArrVal_1206 Int) (v_ArrVal_1208 Int)) (let ((.cse14 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse13 (select .cse14 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse12 (select (select (let ((.cse18 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse15 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse16 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4)) (.cse17 (select .cse18 |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse14 .cse15 v_ArrVal_1206) .cse16 v_ArrVal_1202)) .cse17 v_ArrVal_1218) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse18 .cse15 v_ArrVal_1204) .cse16 v_ArrVal_1208)) .cse17) .cse13) v_ArrVal_1223))) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= .cse12 .cse13) (= (+ .cse12 4) .cse13)))))) (forall ((v_ArrVal_1213 Int) (v_ArrVal_1221 (Array Int Int)) (v_ArrVal_1204 Int) (v_ArrVal_1215 Int) (v_ArrVal_1208 Int)) (not (let ((.cse24 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse24 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1204) (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4) v_ArrVal_1208))) (.cse21 (select .cse24 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse22 (select .cse20 .cse21)) (.cse23 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse19 (select .cse22 .cse23))) (= .cse19 (select (select (store (store .cse20 .cse21 (store (store .cse22 (+ 8 .cse23) v_ArrVal_1215) (+ 4 .cse23) v_ArrVal_1213)) .cse19 v_ArrVal_1221) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))))))) (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1202 Int) (v_ArrVal_1204 Int) (v_ArrVal_1206 Int) (v_ArrVal_1208 Int)) (let ((.cse25 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse30 (select .cse25 |c_ULTIMATE.start_main_~i~0#1.offset|))) (= (select (select (let ((.cse29 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse26 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse27 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4)) (.cse28 (select .cse29 |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse25 .cse26 v_ArrVal_1206) .cse27 v_ArrVal_1202)) .cse28 v_ArrVal_1218) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse29 .cse26 v_ArrVal_1204) .cse27 v_ArrVal_1208)) .cse28) .cse30) v_ArrVal_1223))) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse30))))) is different from false [2022-07-22 15:00:08,570 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1202 Int) (v_ArrVal_1204 Int) (v_ArrVal_1206 Int) (v_ArrVal_1208 Int)) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse1 (select (select (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse4 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) (.cse5 (select .cse6 |c_ULTIMATE.start_main_~l~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse2 .cse3 v_ArrVal_1206) .cse4 v_ArrVal_1202)) .cse5 v_ArrVal_1218) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse6 .cse3 v_ArrVal_1204) .cse4 v_ArrVal_1208)) .cse5) .cse0) v_ArrVal_1223))) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (+ .cse0 4) .cse1) (= .cse0 .cse1)))))) (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1202 Int) (v_ArrVal_1204 Int) (v_ArrVal_1206 Int) (v_ArrVal_1208 Int)) (let ((.cse9 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse7 (select (select (let ((.cse13 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse10 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse11 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) (.cse12 (select .cse13 |c_ULTIMATE.start_main_~l~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse9 .cse10 v_ArrVal_1206) .cse11 v_ArrVal_1202)) .cse12 v_ArrVal_1218) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse13 .cse10 v_ArrVal_1204) .cse11 v_ArrVal_1208)) .cse12) .cse8) v_ArrVal_1223))) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (+ .cse7 4) .cse8) (= .cse8 .cse7)))))) (forall ((v_ArrVal_1213 Int) (v_ArrVal_1221 (Array Int Int)) (v_ArrVal_1204 Int) (v_ArrVal_1215 Int) (v_ArrVal_1208 Int)) (let ((.cse18 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse14 (select .cse18 |c_ULTIMATE.start_main_~l~0#1.offset|))) (= .cse14 (select (select (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse18 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8) v_ArrVal_1204) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4) v_ArrVal_1208)))) (let ((.cse16 (select .cse15 .cse14)) (.cse17 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (store (store .cse15 .cse14 (store (store .cse16 (+ 8 .cse17) v_ArrVal_1215) (+ .cse17 4) v_ArrVal_1213)) (select .cse16 .cse17) v_ArrVal_1221))) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))))) (forall ((v_ArrVal_1213 Int) (v_ArrVal_1221 (Array Int Int)) (v_ArrVal_1204 Int) (v_ArrVal_1215 Int) (v_ArrVal_1208 Int)) (not (let ((.cse24 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse24 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8) v_ArrVal_1204) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4) v_ArrVal_1208))) (.cse21 (select .cse24 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse22 (select .cse20 .cse21)) (.cse23 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse19 (select .cse22 .cse23))) (= .cse19 (select (select (store (store .cse20 .cse21 (store (store .cse22 (+ 8 .cse23) v_ArrVal_1215) (+ .cse23 4) v_ArrVal_1213)) .cse19 v_ArrVal_1221) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))))))) (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1202 Int) (v_ArrVal_1204 Int) (v_ArrVal_1206 Int) (v_ArrVal_1208 Int)) (let ((.cse26 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse25 (select .cse26 |c_ULTIMATE.start_main_~l~0#1.offset|))) (= .cse25 (select (select (let ((.cse30 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse27 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse28 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) (.cse29 (select .cse30 |c_ULTIMATE.start_main_~l~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse26 .cse27 v_ArrVal_1206) .cse28 v_ArrVal_1202)) .cse29 v_ArrVal_1218) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse30 .cse27 v_ArrVal_1204) .cse28 v_ArrVal_1208)) .cse29) .cse25) v_ArrVal_1223))) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))))) is different from false [2022-07-22 15:00:08,845 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:00:08,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 369 treesize of output 399 [2022-07-22 15:00:14,146 WARN L233 SmtUtils]: Spent 5.29s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-22 15:00:14,147 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:00:14,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 5 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 399 treesize of output 721 [2022-07-22 15:00:14,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 475 treesize of output 450 [2022-07-22 15:00:14,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 443 treesize of output 435 [2022-07-22 15:00:14,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 435 treesize of output 431 [2022-07-22 15:00:14,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 564 treesize of output 552 [2022-07-22 15:00:14,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 513 treesize of output 509 [2022-07-22 15:00:14,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 509 treesize of output 501 [2022-07-22 15:00:14,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 501 treesize of output 497 [2022-07-22 15:00:14,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 497 treesize of output 489 [2022-07-22 15:00:14,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 496 treesize of output 490 [2022-07-22 15:00:14,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 476 treesize of output 470 [2022-07-22 15:00:14,656 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:00:14,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 288 treesize of output 316 [2022-07-22 15:00:14,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 4 [2022-07-22 15:00:14,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 4 [2022-07-22 15:00:14,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 4 [2022-07-22 15:00:14,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-22 15:00:16,139 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:00:16,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 200 treesize of output 145 [2022-07-22 15:00:16,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 473 treesize of output 405 [2022-07-22 15:00:16,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 325 treesize of output 313 [2022-07-22 15:00:16,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 313 treesize of output 303 [2022-07-22 15:00:16,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 303 treesize of output 295 [2022-07-22 15:00:16,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 295 treesize of output 291 [2022-07-22 15:00:16,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 291 treesize of output 273 [2022-07-22 15:00:16,263 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 24 not checked. [2022-07-22 15:00:16,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538226177] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:00:16,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 15:00:16,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 34 [2022-07-22 15:00:16,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706142364] [2022-07-22 15:00:16,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 15:00:16,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-22 15:00:16,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:00:16,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-22 15:00:16,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=723, Unknown=5, NotChecked=290, Total=1122 [2022-07-22 15:00:16,265 INFO L87 Difference]: Start difference. First operand 58 states and 76 transitions. Second operand has 34 states, 34 states have (on average 3.0294117647058822) internal successors, (103), 34 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:00:17,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:00:17,282 INFO L93 Difference]: Finished difference Result 114 states and 143 transitions. [2022-07-22 15:00:17,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-22 15:00:17,282 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.0294117647058822) internal successors, (103), 34 states have internal predecessors, (103), 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) Word has length 39 [2022-07-22 15:00:17,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:00:17,284 INFO L225 Difference]: With dead ends: 114 [2022-07-22 15:00:17,284 INFO L226 Difference]: Without dead ends: 112 [2022-07-22 15:00:17,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 5 IntricatePredicates, 4 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=250, Invalid=1571, Unknown=5, NotChecked=430, Total=2256 [2022-07-22 15:00:17,287 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 120 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 264 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 15:00:17,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 487 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 201 Invalid, 0 Unknown, 264 Unchecked, 0.2s Time] [2022-07-22 15:00:17,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-22 15:00:17,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 84. [2022-07-22 15:00:17,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 83 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:00:17,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 112 transitions. [2022-07-22 15:00:17,302 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 112 transitions. Word has length 39 [2022-07-22 15:00:17,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:00:17,302 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 112 transitions. [2022-07-22 15:00:17,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.0294117647058822) internal successors, (103), 34 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:00:17,302 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 112 transitions. [2022-07-22 15:00:17,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-22 15:00:17,303 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:00:17,303 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:00:17,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-22 15:00:17,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-22 15:00:17,504 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:00:17,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:00:17,504 INFO L85 PathProgramCache]: Analyzing trace with hash -964121542, now seen corresponding path program 6 times [2022-07-22 15:00:17,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:00:17,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788534700] [2022-07-22 15:00:17,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:00:17,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:00:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:00:17,685 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:00:17,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:00:17,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788534700] [2022-07-22 15:00:17,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788534700] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:00:17,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172887091] [2022-07-22 15:00:17,686 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 15:00:17,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:00:17,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:00:17,687 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 15:00:17,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-22 15:00:18,709 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-22 15:00:18,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 15:00:18,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 105 conjunts are in the unsatisfiable core [2022-07-22 15:00:18,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:00:18,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 15:00:18,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 15:00:18,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 15:00:18,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-22 15:00:18,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-22 15:00:18,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:18,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-22 15:00:18,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:18,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-22 15:00:18,807 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-22 15:00:18,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-07-22 15:00:18,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-22 15:00:18,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-22 15:00:18,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:18,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:18,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 34 [2022-07-22 15:00:18,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:18,904 INFO L356 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-07-22 15:00:18,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 52 [2022-07-22 15:00:18,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:18,912 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-22 15:00:18,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 22 [2022-07-22 15:00:19,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:19,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 57 [2022-07-22 15:00:19,029 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-22 15:00:19,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 67 [2022-07-22 15:00:19,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:19,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:19,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:19,105 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-22 15:00:19,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 127 [2022-07-22 15:00:19,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:19,121 INFO L356 Elim1Store]: treesize reduction 62, result has 27.1 percent of original size [2022-07-22 15:00:19,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 97 [2022-07-22 15:00:19,221 INFO L356 Elim1Store]: treesize reduction 85, result has 11.5 percent of original size [2022-07-22 15:00:19,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 new quantified variables, introduced 10 case distinctions, treesize of input 132 treesize of output 74 [2022-07-22 15:00:19,231 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-22 15:00:19,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 25 [2022-07-22 15:00:19,245 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:00:19,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:00:21,294 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1450 Int) (v_ArrVal_1442 Int) (v_ArrVal_1452 Int) (v_ArrVal_1444 Int) (v_ArrVal_1443 Int) (v_ArrVal_1445 Int)) (= (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse5 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse7 .cse5 v_ArrVal_1443) .cse6 v_ArrVal_1445))) (.cse1 (select .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse2 (select .cse0 .cse1)) (.cse3 (select .cse7 |c_ULTIMATE.start_main_~i~0#1.offset|))) (select (select (store .cse0 .cse1 (store (store .cse2 (+ 8 .cse3) v_ArrVal_1450) (+ 4 .cse3) v_ArrVal_1452)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse4 .cse5 v_ArrVal_1442) .cse6 v_ArrVal_1444)) .cse1) .cse3)) (select .cse2 .cse3))))) 0)) (forall ((v_ArrVal_1451 Int) (v_ArrVal_1442 Int) (v_ArrVal_1453 Int) (v_ArrVal_1444 Int) (v_ArrVal_1443 Int) (v_ArrVal_1445 Int)) (= (let ((.cse15 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse13 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse14 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4)) (.cse9 (select .cse12 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse11 (select .cse15 |c_ULTIMATE.start_main_~i~0#1.offset|))) (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse12 .cse13 v_ArrVal_1442) .cse14 v_ArrVal_1444)))) (let ((.cse10 (select .cse8 .cse9))) (select (store .cse8 .cse9 (store (store .cse10 (+ 8 .cse11) v_ArrVal_1451) (+ 4 .cse11) v_ArrVal_1453)) (select .cse10 .cse11)))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse15 .cse13 v_ArrVal_1443) .cse14 v_ArrVal_1445)) .cse9) .cse11)))) 0))) is different from false [2022-07-22 15:00:23,561 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:00:23,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 157 treesize of output 192 [2022-07-22 15:00:23,686 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:00:23,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 192 treesize of output 226 [2022-07-22 15:00:23,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 4 [2022-07-22 15:00:23,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 4 [2022-07-22 15:00:23,977 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:00:23,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 164 [2022-07-22 15:00:23,983 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:00:23,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 158 [2022-07-22 15:00:24,075 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_34 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~l~0#1.base| (select v_arrayElimArr_34 0))) (forall ((v_arrayElimArr_35 (Array Int Int))) (or (forall ((v_arrayElimArr_32 (Array Int Int)) (v_prenex_1553 Int) (v_ArrVal_1450 Int) (v_ArrVal_1452 Int) (v_arrayElimArr_30 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_30 0))) (or (= (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse1 v_arrayElimArr_35) v_prenex_1553 v_arrayElimArr_32))) (let ((.cse2 (select .cse0 .cse1))) (select (select (store .cse0 .cse1 (store (store .cse2 8 v_ArrVal_1450) 4 v_ArrVal_1452)) (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_34) v_prenex_1553 v_arrayElimArr_30) .cse1) 0)) (select .cse2 0)))) 0) (not (= (select |c_#valid| .cse1) 0)) (not (= (select v_arrayElimArr_32 0) 0)) (not (= (select (store |c_#valid| .cse1 1) v_prenex_1553) 0))))) (not (= (select v_arrayElimArr_35 0) |c_ULTIMATE.start_main_~l~0#1.offset|)))))) (forall ((v_arrayElimArr_34 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~l~0#1.base| (select v_arrayElimArr_34 0))) (forall ((v_arrayElimArr_35 (Array Int Int))) (or (forall ((v_arrayElimArr_33 (Array Int Int)) (v_ArrVal_1451 Int) (v_ArrVal_1453 Int) (|v_ULTIMATE.start_main_~l~0#1.base_37| Int) (v_arrayElimArr_31 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_31 0))) (or (not (= (select |c_#valid| .cse3) 0)) (not (= (select v_arrayElimArr_33 0) 0)) (= (select (let ((.cse4 (store (store |c_#memory_$Pointer$.base| .cse3 v_arrayElimArr_34) |v_ULTIMATE.start_main_~l~0#1.base_37| v_arrayElimArr_31))) (let ((.cse5 (select .cse4 .cse3))) (select (store .cse4 .cse3 (store (store .cse5 8 v_ArrVal_1451) 4 v_ArrVal_1453)) (select .cse5 0)))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_35) |v_ULTIMATE.start_main_~l~0#1.base_37| v_arrayElimArr_33) .cse3) 0)) 0) (not (= (select (store |c_#valid| .cse3 1) |v_ULTIMATE.start_main_~l~0#1.base_37|) 0))))) (not (= (select v_arrayElimArr_35 0) |c_ULTIMATE.start_main_~l~0#1.offset|))))))) is different from false [2022-07-22 15:00:24,194 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:00:24,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 89 [2022-07-22 15:00:24,197 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:00:24,202 INFO L356 Elim1Store]: treesize reduction 32, result has 11.1 percent of original size [2022-07-22 15:00:24,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 572 treesize of output 538 [2022-07-22 15:00:24,209 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:00:24,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 530 treesize of output 372 [2022-07-22 15:00:24,215 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:00:24,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 198 [2022-07-22 15:00:24,224 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 15:00:24,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 380 treesize of output 314 [2022-07-22 15:00:24,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 64 [2022-07-22 15:00:24,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2022-07-22 15:00:24,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:00:24,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:00:24,236 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 15:00:24,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 16 treesize of output 12 [2022-07-22 15:00:24,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-07-22 15:00:24,245 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:00:24,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 89 [2022-07-22 15:00:24,251 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:00:24,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 77 [2022-07-22 15:00:24,255 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:00:24,255 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:00:24,256 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:00:24,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:24,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 8 [2022-07-22 15:00:24,265 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 15:00:24,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 26 [2022-07-22 15:00:24,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-07-22 15:00:24,276 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2022-07-22 15:00:24,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172887091] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:00:24,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 15:00:24,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2022-07-22 15:00:24,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354151498] [2022-07-22 15:00:24,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 15:00:24,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-22 15:00:24,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:00:24,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-22 15:00:24,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=297, Unknown=2, NotChecked=70, Total=420 [2022-07-22 15:00:24,277 INFO L87 Difference]: Start difference. First operand 84 states and 112 transitions. Second operand has 21 states, 21 states have (on average 4.095238095238095) internal successors, (86), 21 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:00:24,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:00:24,601 INFO L93 Difference]: Finished difference Result 148 states and 201 transitions. [2022-07-22 15:00:24,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 15:00:24,602 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.095238095238095) internal successors, (86), 21 states have internal predecessors, (86), 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) Word has length 40 [2022-07-22 15:00:24,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:00:24,602 INFO L225 Difference]: With dead ends: 148 [2022-07-22 15:00:24,602 INFO L226 Difference]: Without dead ends: 129 [2022-07-22 15:00:24,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=66, Invalid=360, Unknown=2, NotChecked=78, Total=506 [2022-07-22 15:00:24,603 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 32 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 15:00:24,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 437 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 127 Invalid, 0 Unknown, 134 Unchecked, 0.2s Time] [2022-07-22 15:00:24,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-22 15:00:24,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2022-07-22 15:00:24,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.3622047244094488) internal successors, (173), 127 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:00:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 173 transitions. [2022-07-22 15:00:24,618 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 173 transitions. Word has length 40 [2022-07-22 15:00:24,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:00:24,618 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 173 transitions. [2022-07-22 15:00:24,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.095238095238095) internal successors, (86), 21 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:00:24,619 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 173 transitions. [2022-07-22 15:00:24,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-22 15:00:24,619 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:00:24,619 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:00:24,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-22 15:00:24,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-22 15:00:24,827 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:00:24,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:00:24,828 INFO L85 PathProgramCache]: Analyzing trace with hash -137651855, now seen corresponding path program 1 times [2022-07-22 15:00:24,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:00:24,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791510088] [2022-07-22 15:00:24,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:00:24,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:00:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:00:25,193 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 20 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 15:00:25,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:00:25,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791510088] [2022-07-22 15:00:25,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791510088] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:00:25,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134286661] [2022-07-22 15:00:25,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:00:25,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:00:25,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:00:25,195 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 15:00:25,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-22 15:00:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:00:25,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-22 15:00:25,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:00:25,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 15:00:25,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 15:00:25,366 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-22 15:00:25,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-07-22 15:00:25,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-22 15:00:25,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:25,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-07-22 15:00:25,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:25,413 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-22 15:00:25,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 22 [2022-07-22 15:00:25,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 15:00:25,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:25,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:25,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:25,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-22 15:00:25,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:25,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:25,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:25,525 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 15:00:25,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2022-07-22 15:00:25,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:25,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:25,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:25,654 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 15:00:25,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 156 treesize of output 121 [2022-07-22 15:00:25,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:25,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 41 [2022-07-22 15:00:25,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:25,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2022-07-22 15:00:25,739 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-22 15:00:25,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 95 [2022-07-22 15:00:25,747 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 15:00:25,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 72 [2022-07-22 15:00:25,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:25,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2022-07-22 15:00:25,853 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 15:00:25,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 42 [2022-07-22 15:00:25,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2022-07-22 15:00:25,877 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:00:25,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 26 treesize of output 10 [2022-07-22 15:00:25,878 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 16 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 15:00:25,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:00:25,954 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1669 (Array Int Int)) (v_ArrVal_1667 (Array Int Int)) (v_ArrVal_1670 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1667) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1669) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1670) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (<= (select .cse0 (+ .cse1 8)) (select .cse0 (+ .cse1 4))))) is different from false [2022-07-22 15:00:26,042 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-22 15:00:26,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 137 [2022-07-22 15:00:26,097 INFO L356 Elim1Store]: treesize reduction 64, result has 76.6 percent of original size [2022-07-22 15:00:26,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 219 treesize of output 323 [2022-07-22 15:00:26,103 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:00:26,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 73 treesize of output 37 [2022-07-22 15:00:26,204 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1660 (Array Int Int)) (v_ArrVal_1670 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1660) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1670) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) |c_ULTIMATE.start_main_~i~0#1.offset|)) (forall ((v_ArrVal_1660 (Array Int Int)) (v_ArrVal_1670 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1660) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1670) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (+ .cse0 4) |c_ULTIMATE.start_main_~i~0#1.offset|) (= .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|)))) (forall ((v_ArrVal_1660 (Array Int Int)) (v_ArrVal_1670 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1660) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1670) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4) .cse1) (= .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|)))) (forall ((v_ArrVal_1669 (Array Int Int)) (v_ArrVal_1661 Int) (v_ArrVal_1659 Int)) (= |c_ULTIMATE.start_main_~i~0#1.base| (select (select (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse2 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1661) (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4) v_ArrVal_1659)) (select .cse2 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1669)) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (forall ((v_ArrVal_1669 (Array Int Int)) (v_ArrVal_1661 Int) (v_ArrVal_1659 Int)) (not (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|))) (= .cse3 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse4 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1661) (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4) v_ArrVal_1659)) .cse3 v_ArrVal_1669) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))))))) is different from false [2022-07-22 15:00:26,316 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1669 (Array Int Int)) (v_ArrVal_1661 Int) (v_ArrVal_1655 Int) (v_ArrVal_1657 Int) (v_ArrVal_1659 Int)) (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse4 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1657) (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4) v_ArrVal_1655)))) (let ((.cse2 (select .cse1 .cse0)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (store .cse1 .cse0 (store (store .cse2 (+ 8 .cse3) v_ArrVal_1661) (+ 4 .cse3) v_ArrVal_1659)) (select .cse2 .cse3) v_ArrVal_1669))) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1653 Int) (v_ArrVal_1655 Int) (v_ArrVal_1660 (Array Int Int)) (v_ArrVal_1670 (Array Int Int)) (v_ArrVal_1657 Int)) (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse5 (select (select (let ((.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse8 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse9 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4)) (.cse10 (select .cse11 |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse7 .cse8 v_ArrVal_1653) .cse9 v_ArrVal_1651)) .cse10 v_ArrVal_1660) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse11 .cse8 v_ArrVal_1657) .cse9 v_ArrVal_1655)) .cse10) .cse6) v_ArrVal_1670))) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= .cse5 .cse6) (= (+ .cse5 4) .cse6)))))) (forall ((v_ArrVal_1669 (Array Int Int)) (v_ArrVal_1661 Int) (v_ArrVal_1655 Int) (v_ArrVal_1657 Int) (v_ArrVal_1659 Int)) (not (let ((.cse17 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse17 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1657) (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4) v_ArrVal_1655))) (.cse14 (select .cse17 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse15 (select .cse13 .cse14)) (.cse16 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse12 (select .cse15 .cse16))) (= .cse12 (select (select (store (store .cse13 .cse14 (store (store .cse15 (+ 8 .cse16) v_ArrVal_1661) (+ 4 .cse16) v_ArrVal_1659)) .cse12 v_ArrVal_1669) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1653 Int) (v_ArrVal_1655 Int) (v_ArrVal_1660 (Array Int Int)) (v_ArrVal_1670 (Array Int Int)) (v_ArrVal_1657 Int)) (let ((.cse18 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse23 (select .cse18 |c_ULTIMATE.start_main_~i~0#1.offset|))) (= (select (select (let ((.cse22 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse19 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse20 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4)) (.cse21 (select .cse22 |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse18 .cse19 v_ArrVal_1653) .cse20 v_ArrVal_1651)) .cse21 v_ArrVal_1660) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse22 .cse19 v_ArrVal_1657) .cse20 v_ArrVal_1655)) .cse21) .cse23) v_ArrVal_1670))) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse23)))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1653 Int) (v_ArrVal_1655 Int) (v_ArrVal_1660 (Array Int Int)) (v_ArrVal_1670 (Array Int Int)) (v_ArrVal_1657 Int)) (let ((.cse26 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse25 (select .cse26 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse24 (select (select (let ((.cse30 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse27 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse28 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4)) (.cse29 (select .cse30 |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse26 .cse27 v_ArrVal_1653) .cse28 v_ArrVal_1651)) .cse29 v_ArrVal_1660) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse30 .cse27 v_ArrVal_1657) .cse28 v_ArrVal_1655)) .cse29) .cse25) v_ArrVal_1670))) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= .cse24 .cse25) (= (+ 4 .cse25) .cse24))))))) is different from false [2022-07-22 15:00:26,445 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1669 (Array Int Int)) (v_ArrVal_1661 Int) (v_ArrVal_1655 Int) (v_ArrVal_1657 Int) (v_ArrVal_1659 Int)) (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~l~0#1.offset|))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse4 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8) v_ArrVal_1657) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4) v_ArrVal_1655)))) (let ((.cse2 (select .cse1 .cse0)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (store (store .cse1 .cse0 (store (store .cse2 (+ 8 .cse3) v_ArrVal_1661) (+ .cse3 4) v_ArrVal_1659)) (select .cse2 .cse3) v_ArrVal_1669))) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1653 Int) (v_ArrVal_1655 Int) (v_ArrVal_1660 (Array Int Int)) (v_ArrVal_1670 (Array Int Int)) (v_ArrVal_1657 Int)) (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse5 (select (select (let ((.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse9 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) (.cse10 (select .cse11 |c_ULTIMATE.start_main_~l~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse7 .cse8 v_ArrVal_1653) .cse9 v_ArrVal_1651)) .cse10 v_ArrVal_1660) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse11 .cse8 v_ArrVal_1657) .cse9 v_ArrVal_1655)) .cse10) .cse6) v_ArrVal_1670))) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= .cse5 .cse6) (= (+ .cse6 4) .cse5)))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1653 Int) (v_ArrVal_1655 Int) (v_ArrVal_1660 (Array Int Int)) (v_ArrVal_1670 (Array Int Int)) (v_ArrVal_1657 Int)) (let ((.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse17 (select .cse12 |c_ULTIMATE.start_main_~l~0#1.offset|))) (= (select (select (let ((.cse16 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse13 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse14 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) (.cse15 (select .cse16 |c_ULTIMATE.start_main_~l~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse12 .cse13 v_ArrVal_1653) .cse14 v_ArrVal_1651)) .cse15 v_ArrVal_1660) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse16 .cse13 v_ArrVal_1657) .cse14 v_ArrVal_1655)) .cse15) .cse17) v_ArrVal_1670))) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse17)))) (forall ((v_ArrVal_1669 (Array Int Int)) (v_ArrVal_1661 Int) (v_ArrVal_1655 Int) (v_ArrVal_1657 Int) (v_ArrVal_1659 Int)) (not (let ((.cse23 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse23 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8) v_ArrVal_1657) (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4) v_ArrVal_1655))) (.cse19 (select .cse23 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse20 (select .cse18 .cse19)) (.cse21 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse22 (select .cse20 .cse21))) (= (select (select (store (store .cse18 .cse19 (store (store .cse20 (+ 8 .cse21) v_ArrVal_1661) (+ .cse21 4) v_ArrVal_1659)) .cse22 v_ArrVal_1669) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse22))))))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1653 Int) (v_ArrVal_1655 Int) (v_ArrVal_1660 (Array Int Int)) (v_ArrVal_1670 (Array Int Int)) (v_ArrVal_1657 Int)) (let ((.cse26 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse25 (select .cse26 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse24 (select (select (let ((.cse30 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse27 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse28 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) (.cse29 (select .cse30 |c_ULTIMATE.start_main_~l~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse26 .cse27 v_ArrVal_1653) .cse28 v_ArrVal_1651)) .cse29 v_ArrVal_1660) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse30 .cse27 v_ArrVal_1657) .cse28 v_ArrVal_1655)) .cse29) .cse25) v_ArrVal_1670))) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= .cse24 .cse25) (= (+ .cse24 4) .cse25))))))) is different from false [2022-07-22 15:00:26,617 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:00:26,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 369 treesize of output 399 [2022-07-22 15:00:33,657 WARN L233 SmtUtils]: Spent 7.04s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-22 15:00:33,657 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:00:33,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 5 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 399 treesize of output 721 [2022-07-22 15:00:33,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 354 treesize of output 339 [2022-07-22 15:00:33,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 625 treesize of output 606 [2022-07-22 15:00:33,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 599 treesize of output 583 [2022-07-22 15:00:33,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 590 treesize of output 580 [2022-07-22 15:00:33,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 668 treesize of output 656 [2022-07-22 15:00:33,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 617 treesize of output 609 [2022-07-22 15:00:33,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 609 treesize of output 605 [2022-07-22 15:00:33,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 605 treesize of output 597 [2022-07-22 15:00:33,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 597 treesize of output 593 [2022-07-22 15:00:33,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 600 treesize of output 594 [2022-07-22 15:00:33,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 573 treesize of output 565 [2022-07-22 15:00:34,100 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:00:34,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 191 treesize of output 341 [2022-07-22 15:00:34,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-07-22 15:00:34,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-07-22 15:00:34,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 129 [2022-07-22 15:00:34,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 129 [2022-07-22 15:00:34,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-22 15:00:34,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 4 [2022-07-22 15:00:34,402 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:00:34,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 95 [2022-07-22 15:00:34,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 329 treesize of output 273 [2022-07-22 15:00:34,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 178 [2022-07-22 15:00:34,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-07-22 15:00:34,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 162 [2022-07-22 15:00:34,496 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 32 not checked. [2022-07-22 15:00:34,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134286661] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:00:34,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 15:00:34,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 35 [2022-07-22 15:00:34,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967864521] [2022-07-22 15:00:34,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 15:00:34,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-22 15:00:34,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:00:34,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-22 15:00:34,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=815, Unknown=12, NotChecked=244, Total=1190 [2022-07-22 15:00:34,497 INFO L87 Difference]: Start difference. First operand 128 states and 173 transitions. Second operand has 35 states, 35 states have (on average 3.142857142857143) internal successors, (110), 35 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:00:35,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:00:35,824 INFO L93 Difference]: Finished difference Result 166 states and 221 transitions. [2022-07-22 15:00:35,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-22 15:00:35,824 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.142857142857143) internal successors, (110), 35 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-22 15:00:35,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:00:35,825 INFO L225 Difference]: With dead ends: 166 [2022-07-22 15:00:35,825 INFO L226 Difference]: Without dead ends: 164 [2022-07-22 15:00:35,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 4 IntricatePredicates, 5 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=312, Invalid=1948, Unknown=12, NotChecked=380, Total=2652 [2022-07-22 15:00:35,826 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 104 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 262 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 15:00:35,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 538 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 239 Invalid, 0 Unknown, 262 Unchecked, 0.3s Time] [2022-07-22 15:00:35,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-22 15:00:35,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 83. [2022-07-22 15:00:35,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.329268292682927) internal successors, (109), 82 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:00:35,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 109 transitions. [2022-07-22 15:00:35,835 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 109 transitions. Word has length 42 [2022-07-22 15:00:35,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:00:35,836 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 109 transitions. [2022-07-22 15:00:35,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.142857142857143) internal successors, (110), 35 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:00:35,836 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2022-07-22 15:00:35,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-22 15:00:35,836 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:00:35,836 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:00:35,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-22 15:00:36,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-22 15:00:36,051 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:00:36,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:00:36,052 INFO L85 PathProgramCache]: Analyzing trace with hash 377654319, now seen corresponding path program 5 times [2022-07-22 15:00:36,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:00:36,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115160664] [2022-07-22 15:00:36,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:00:36,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:00:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:00:36,358 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:00:36,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:00:36,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115160664] [2022-07-22 15:00:36,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115160664] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:00:36,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291327746] [2022-07-22 15:00:36,359 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 15:00:36,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:00:36,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:00:36,360 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 15:00:36,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-22 15:00:41,668 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-22 15:00:41,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 15:00:41,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 100 conjunts are in the unsatisfiable core [2022-07-22 15:00:41,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:00:41,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 15:00:41,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 15:00:41,730 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-22 15:00:41,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-07-22 15:00:41,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-22 15:00:41,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:41,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-07-22 15:00:41,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:41,777 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-22 15:00:41,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 22 [2022-07-22 15:00:41,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 15:00:41,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:41,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:41,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:41,888 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 15:00:41,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2022-07-22 15:00:41,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:41,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:41,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:41,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-22 15:00:41,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:41,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:41,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:41,951 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 15:00:41,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 80 [2022-07-22 15:00:41,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:41,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2022-07-22 15:00:42,078 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-22 15:00:42,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 197 treesize of output 156 [2022-07-22 15:00:42,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:42,097 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-07-22 15:00:42,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 130 [2022-07-22 15:00:42,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:42,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 73 [2022-07-22 15:00:42,282 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-22 15:00:42,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 64 [2022-07-22 15:00:42,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 25 [2022-07-22 15:00:42,310 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 15:00:42,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2022-07-22 15:00:42,313 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:00:42,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:00:42,433 WARN L833 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_main_#t~short8#1| (forall ((v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1873 (Array Int Int)) (v_ArrVal_1872 Int) (v_ArrVal_1877 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (or (not (<= v_ArrVal_1877 |c_ULTIMATE.start_main_~order~0#1|)) (not (<= (select .cse0 .cse1) v_ArrVal_1872)) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1873)) (.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1875))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse6 (select (select .cse4 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse0 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1877) .cse1 v_ArrVal_1872)) (select (select .cse7 .cse5) .cse6))) (.cse3 (select (select .cse4 .cse5) .cse6))) (<= (select .cse2 (+ .cse3 8)) (select .cse2 (+ .cse3 4)))))))))) is different from false [2022-07-22 15:00:42,453 INFO L356 Elim1Store]: treesize reduction 114, result has 32.5 percent of original size [2022-07-22 15:00:42,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4259 treesize of output 3534 [2022-07-22 15:00:42,632 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1873 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1873))) (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1875) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse1 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))))) (or (= (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4) .cse0) (= .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|)))) (forall ((v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1873 (Array Int Int))) (= (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1873))) (select (select .cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1875) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) |c_ULTIMATE.start_main_~i~0#1.offset|)) (forall ((v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1873 (Array Int Int))) (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1873))) (select (select .cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1875) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse4 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))))) (or (= .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|) (= (+ .cse3 4) |c_ULTIMATE.start_main_~i~0#1.offset|)))) (forall ((v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1873 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1873)) (.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1875))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (select (select .cse5 .cse6) .cse7) |c_ULTIMATE.start_main_~i~0#1.base|) (= (select (select .cse8 .cse6) .cse7) |c_ULTIMATE.start_main_~i~0#1.offset|))))) (forall ((v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1873 (Array Int Int))) (= (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1875))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1873) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) |c_ULTIMATE.start_main_~i~0#1.base|)) (forall ((v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1873 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1873)) (.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1875))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (select (select .cse10 .cse11) .cse12) |c_ULTIMATE.start_main_~i~0#1.base|) (= (+ (select (select .cse13 .cse11) .cse12) 4) |c_ULTIMATE.start_main_~i~0#1.offset|)))))) is different from false [2022-07-22 15:00:42,725 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1873 (Array Int Int)) (v_ArrVal_1870 Int) (v_ArrVal_1866 Int)) (let ((.cse0 (select v_ArrVal_1868 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse1 (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1868) .cse4 v_ArrVal_1873))) (select (select .cse2 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse3 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1866) (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4) v_ArrVal_1870)) .cse4 v_ArrVal_1875) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))))))) (or (= (+ .cse0 4) .cse1) (= .cse0 .cse1)))) (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1873 (Array Int Int)) (v_ArrVal_1870 Int) (v_ArrVal_1866 Int)) (let ((.cse6 (select v_ArrVal_1868 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse5 (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1868) .cse9 v_ArrVal_1873))) (select (select .cse7 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse8 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1866) (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4) v_ArrVal_1870)) .cse9 v_ArrVal_1875) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse7 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))))))) (or (= (+ .cse5 4) .cse6) (= .cse6 .cse5)))) (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1873 (Array Int Int)) (v_ArrVal_1870 Int) (v_ArrVal_1866 Int)) (= (select v_ArrVal_1868 |c_ULTIMATE.start_main_~i~0#1.offset|) (let ((.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse10 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1868) .cse12 v_ArrVal_1873))) (select (select .cse10 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse11 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1866) (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4) v_ArrVal_1870)) .cse12 v_ArrVal_1875) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse10 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))))))) (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1873 (Array Int Int)) (v_ArrVal_1870 Int) (v_ArrVal_1866 Int)) (let ((.cse18 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse16 (select .cse18 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse17 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1868) .cse16 v_ArrVal_1873)) (.cse13 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse18 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1866) (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4) v_ArrVal_1870)) .cse16 v_ArrVal_1875))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse15 (select (select .cse17 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (select (select .cse13 .cse14) .cse15) .cse16) (= (+ (select (select .cse17 .cse14) .cse15) 4) (select v_ArrVal_1868 |c_ULTIMATE.start_main_~i~0#1.offset|)))))))) (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1873 (Array Int Int)) (v_ArrVal_1870 Int) (v_ArrVal_1866 Int)) (let ((.cse20 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~i~0#1.offset|))) (= (select (let ((.cse19 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse20 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1866) (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4) v_ArrVal_1870)) .cse21 v_ArrVal_1875))) (select .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1868) .cse21 v_ArrVal_1873) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) .cse21)))) (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1873 (Array Int Int)) (v_ArrVal_1870 Int) (v_ArrVal_1866 Int)) (let ((.cse27 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse25 (select .cse27 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse26 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1868) .cse25 v_ArrVal_1873)) (.cse22 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse27 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1866) (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4) v_ArrVal_1870)) .cse25 v_ArrVal_1875))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse24 (select (select .cse26 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (select (select .cse22 .cse23) .cse24) .cse25) (= (select v_ArrVal_1868 |c_ULTIMATE.start_main_~i~0#1.offset|) (select (select .cse26 .cse23) .cse24))))))))) is different from false [2022-07-22 15:00:43,513 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1859 Int) (v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1873 (Array Int Int)) (v_ArrVal_1870 Int) (v_ArrVal_1861 Int) (v_ArrVal_1863 Int) (v_ArrVal_1866 Int) (v_ArrVal_1865 Int)) (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse10 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse11 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (let ((.cse9 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse12 .cse10 v_ArrVal_1861) .cse11 v_ArrVal_1859))) (.cse7 (select .cse12 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse8 (select .cse6 .cse7)) (.cse0 (select .cse9 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse5 (select .cse8 .cse0))) (let ((.cse1 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse9 .cse10 v_ArrVal_1863) .cse11 v_ArrVal_1865)) .cse7 v_ArrVal_1868) .cse5 v_ArrVal_1873)) (.cse4 (store (store .cse6 .cse7 (store (store .cse8 (+ 8 .cse0) v_ArrVal_1866) (+ 4 .cse0) v_ArrVal_1870)) .cse5 v_ArrVal_1875))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse3 (select (select .cse1 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (select v_ArrVal_1868 .cse0) (select (select .cse1 .cse2) .cse3)) (= (select (select .cse4 .cse2) .cse3) .cse5))))))))) (forall ((v_ArrVal_1859 Int) (v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1873 (Array Int Int)) (v_ArrVal_1870 Int) (v_ArrVal_1861 Int) (v_ArrVal_1863 Int) (v_ArrVal_1866 Int) (v_ArrVal_1865 Int)) (let ((.cse19 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse13 (select .cse19 |c_ULTIMATE.start_main_~i~0#1.offset|))) (= (select v_ArrVal_1868 .cse13) (let ((.cse22 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse20 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse21 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse22 .cse20 v_ArrVal_1861) .cse21 v_ArrVal_1859))) (.cse16 (select .cse22 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse17 (select .cse15 .cse16))) (let ((.cse18 (select .cse17 .cse13))) (let ((.cse14 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse19 .cse20 v_ArrVal_1863) .cse21 v_ArrVal_1865)) .cse16 v_ArrVal_1868) .cse18 v_ArrVal_1873))) (select (select .cse14 (select (select (store (store .cse15 .cse16 (store (store .cse17 (+ 8 .cse13) v_ArrVal_1866) (+ 4 .cse13) v_ArrVal_1870)) .cse18 v_ArrVal_1875) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse14 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))))))))))) (forall ((v_ArrVal_1859 Int) (v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1873 (Array Int Int)) (v_ArrVal_1870 Int) (v_ArrVal_1861 Int) (v_ArrVal_1863 Int) (v_ArrVal_1866 Int) (v_ArrVal_1865 Int)) (let ((.cse32 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse30 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse31 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (let ((.cse29 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse24 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse32 .cse30 v_ArrVal_1861) .cse31 v_ArrVal_1859))) (.cse25 (select .cse32 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse26 (select .cse24 .cse25)) (.cse27 (select .cse29 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse28 (select .cse26 .cse27))) (= (select (let ((.cse23 (store (store .cse24 .cse25 (store (store .cse26 (+ 8 .cse27) v_ArrVal_1866) (+ 4 .cse27) v_ArrVal_1870)) .cse28 v_ArrVal_1875))) (select .cse23 (select (select .cse23 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse29 .cse30 v_ArrVal_1863) .cse31 v_ArrVal_1865)) .cse25 v_ArrVal_1868) .cse28 v_ArrVal_1873) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) .cse28)))))) (forall ((v_ArrVal_1859 Int) (v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1873 (Array Int Int)) (v_ArrVal_1870 Int) (v_ArrVal_1861 Int) (v_ArrVal_1863 Int) (v_ArrVal_1866 Int) (v_ArrVal_1865 Int)) (let ((.cse41 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse39 (select .cse41 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse33 (select v_ArrVal_1868 .cse39)) (.cse34 (let ((.cse44 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse42 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse43 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (let ((.cse36 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse44 .cse42 v_ArrVal_1861) .cse43 v_ArrVal_1859))) (.cse37 (select .cse44 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse38 (select .cse36 .cse37))) (let ((.cse40 (select .cse38 .cse39))) (let ((.cse35 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse41 .cse42 v_ArrVal_1863) .cse43 v_ArrVal_1865)) .cse37 v_ArrVal_1868) .cse40 v_ArrVal_1873))) (select (select .cse35 (select (select (store (store .cse36 .cse37 (store (store .cse38 (+ 8 .cse39) v_ArrVal_1866) (+ 4 .cse39) v_ArrVal_1870)) .cse40 v_ArrVal_1875) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse35 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))))))))) (or (= .cse33 .cse34) (= .cse33 (+ .cse34 4))))))) (forall ((v_ArrVal_1859 Int) (v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1873 (Array Int Int)) (v_ArrVal_1870 Int) (v_ArrVal_1861 Int) (v_ArrVal_1863 Int) (v_ArrVal_1866 Int) (v_ArrVal_1865 Int)) (let ((.cse57 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse55 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse56 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (let ((.cse54 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse51 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse57 .cse55 v_ArrVal_1861) .cse56 v_ArrVal_1859))) (.cse52 (select .cse57 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse53 (select .cse51 .cse52)) (.cse45 (select .cse54 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse50 (select .cse53 .cse45))) (let ((.cse46 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse54 .cse55 v_ArrVal_1863) .cse56 v_ArrVal_1865)) .cse52 v_ArrVal_1868) .cse50 v_ArrVal_1873)) (.cse49 (store (store .cse51 .cse52 (store (store .cse53 (+ 8 .cse45) v_ArrVal_1866) (+ 4 .cse45) v_ArrVal_1870)) .cse50 v_ArrVal_1875))) (let ((.cse47 (select (select .cse49 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse48 (select (select .cse46 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (select v_ArrVal_1868 .cse45) (+ (select (select .cse46 .cse47) .cse48) 4)) (= (select (select .cse49 .cse47) .cse48) .cse50))))))))) (forall ((v_ArrVal_1859 Int) (v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1873 (Array Int Int)) (v_ArrVal_1870 Int) (v_ArrVal_1861 Int) (v_ArrVal_1863 Int) (v_ArrVal_1866 Int) (v_ArrVal_1865 Int)) (let ((.cse66 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse60 (select .cse66 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse59 (let ((.cse69 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse67 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse68 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (let ((.cse62 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse69 .cse67 v_ArrVal_1861) .cse68 v_ArrVal_1859))) (.cse63 (select .cse69 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse64 (select .cse62 .cse63))) (let ((.cse65 (select .cse64 .cse60))) (let ((.cse61 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse66 .cse67 v_ArrVal_1863) .cse68 v_ArrVal_1865)) .cse63 v_ArrVal_1868) .cse65 v_ArrVal_1873))) (select (select .cse61 (select (select (store (store .cse62 .cse63 (store (store .cse64 (+ 8 .cse60) v_ArrVal_1866) (+ 4 .cse60) v_ArrVal_1870)) .cse65 v_ArrVal_1875) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse61 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))))))) (.cse58 (select v_ArrVal_1868 .cse60))) (or (= .cse58 .cse59) (= .cse59 (+ .cse58 4)))))))) is different from false [2022-07-22 15:00:44,144 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1859 Int) (v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1873 (Array Int Int)) (v_ArrVal_1870 Int) (v_ArrVal_1861 Int) (v_ArrVal_1863 Int) (v_ArrVal_1866 Int) (v_ArrVal_1865 Int)) (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse10 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse11 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))) (let ((.cse9 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse12 .cse10 v_ArrVal_1861) .cse11 v_ArrVal_1859))) (.cse7 (select .cse12 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse8 (select .cse6 .cse7)) (.cse3 (select .cse9 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse4 (select .cse8 .cse3))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse9 .cse10 v_ArrVal_1863) .cse11 v_ArrVal_1865)) .cse7 v_ArrVal_1868) .cse4 v_ArrVal_1873)) (.cse5 (store (store .cse6 .cse7 (store (store .cse8 (+ 8 .cse3) v_ArrVal_1866) (+ .cse3 4) v_ArrVal_1870)) .cse4 v_ArrVal_1875))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (+ (select (select .cse0 .cse1) .cse2) 4) (select v_ArrVal_1868 .cse3)) (= .cse4 (select (select .cse5 .cse1) .cse2)))))))))) (forall ((v_ArrVal_1859 Int) (v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1873 (Array Int Int)) (v_ArrVal_1870 Int) (v_ArrVal_1861 Int) (v_ArrVal_1863 Int) (v_ArrVal_1866 Int) (v_ArrVal_1865 Int)) (let ((.cse21 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse15 (select .cse21 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse13 (let ((.cse24 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse22 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse23 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))) (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse24 .cse22 v_ArrVal_1861) .cse23 v_ArrVal_1859))) (.cse18 (select .cse24 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse19 (select .cse17 .cse18))) (let ((.cse20 (select .cse19 .cse15))) (let ((.cse16 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse21 .cse22 v_ArrVal_1863) .cse23 v_ArrVal_1865)) .cse18 v_ArrVal_1868) .cse20 v_ArrVal_1873))) (select (select .cse16 (select (select (store (store .cse17 .cse18 (store (store .cse19 (+ 8 .cse15) v_ArrVal_1866) (+ .cse15 4) v_ArrVal_1870)) .cse20 v_ArrVal_1875) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse16 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))))))) (.cse14 (select v_ArrVal_1868 .cse15))) (or (= (+ .cse13 4) .cse14) (= .cse13 .cse14)))))) (forall ((v_ArrVal_1859 Int) (v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1873 (Array Int Int)) (v_ArrVal_1870 Int) (v_ArrVal_1861 Int) (v_ArrVal_1863 Int) (v_ArrVal_1866 Int) (v_ArrVal_1865 Int)) (let ((.cse34 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse32 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse33 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))) (let ((.cse31 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse27 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse34 .cse32 v_ArrVal_1861) .cse33 v_ArrVal_1859))) (.cse28 (select .cse34 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse29 (select .cse27 .cse28)) (.cse30 (select .cse31 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse25 (select .cse29 .cse30))) (= .cse25 (select (let ((.cse26 (store (store .cse27 .cse28 (store (store .cse29 (+ 8 .cse30) v_ArrVal_1866) (+ .cse30 4) v_ArrVal_1870)) .cse25 v_ArrVal_1875))) (select .cse26 (select (select .cse26 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse31 .cse32 v_ArrVal_1863) .cse33 v_ArrVal_1865)) .cse28 v_ArrVal_1868) .cse25 v_ArrVal_1873) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))))))) (forall ((v_ArrVal_1859 Int) (v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1873 (Array Int Int)) (v_ArrVal_1870 Int) (v_ArrVal_1861 Int) (v_ArrVal_1863 Int) (v_ArrVal_1866 Int) (v_ArrVal_1865 Int)) (let ((.cse47 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse45 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse46 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))) (let ((.cse44 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse41 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse47 .cse45 v_ArrVal_1861) .cse46 v_ArrVal_1859))) (.cse42 (select .cse47 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse43 (select .cse41 .cse42)) (.cse40 (select .cse44 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse35 (select .cse43 .cse40))) (let ((.cse39 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse44 .cse45 v_ArrVal_1863) .cse46 v_ArrVal_1865)) .cse42 v_ArrVal_1868) .cse35 v_ArrVal_1873)) (.cse36 (store (store .cse41 .cse42 (store (store .cse43 (+ 8 .cse40) v_ArrVal_1866) (+ .cse40 4) v_ArrVal_1870)) .cse35 v_ArrVal_1875))) (let ((.cse37 (select (select .cse36 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse38 (select (select .cse39 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= .cse35 (select (select .cse36 .cse37) .cse38)) (= (select (select .cse39 .cse37) .cse38) (select v_ArrVal_1868 .cse40)))))))))) (forall ((v_ArrVal_1859 Int) (v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1873 (Array Int Int)) (v_ArrVal_1870 Int) (v_ArrVal_1861 Int) (v_ArrVal_1863 Int) (v_ArrVal_1866 Int) (v_ArrVal_1865 Int)) (let ((.cse56 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse50 (select .cse56 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse48 (let ((.cse59 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse57 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse58 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))) (let ((.cse52 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse59 .cse57 v_ArrVal_1861) .cse58 v_ArrVal_1859))) (.cse53 (select .cse59 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse54 (select .cse52 .cse53))) (let ((.cse55 (select .cse54 .cse50))) (let ((.cse51 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse56 .cse57 v_ArrVal_1863) .cse58 v_ArrVal_1865)) .cse53 v_ArrVal_1868) .cse55 v_ArrVal_1873))) (select (select .cse51 (select (select (store (store .cse52 .cse53 (store (store .cse54 (+ 8 .cse50) v_ArrVal_1866) (+ .cse50 4) v_ArrVal_1870)) .cse55 v_ArrVal_1875) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse51 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))))))) (.cse49 (select v_ArrVal_1868 .cse50))) (or (= .cse48 (+ 4 .cse49)) (= .cse48 .cse49)))))) (forall ((v_ArrVal_1859 Int) (v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1873 (Array Int Int)) (v_ArrVal_1870 Int) (v_ArrVal_1861 Int) (v_ArrVal_1863 Int) (v_ArrVal_1866 Int) (v_ArrVal_1865 Int)) (let ((.cse66 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse64 (select .cse66 |c_ULTIMATE.start_main_~l~0#1.offset|))) (= (let ((.cse69 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse67 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse68 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))) (let ((.cse61 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse69 .cse67 v_ArrVal_1861) .cse68 v_ArrVal_1859))) (.cse62 (select .cse69 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse63 (select .cse61 .cse62))) (let ((.cse65 (select .cse63 .cse64))) (let ((.cse60 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse66 .cse67 v_ArrVal_1863) .cse68 v_ArrVal_1865)) .cse62 v_ArrVal_1868) .cse65 v_ArrVal_1873))) (select (select .cse60 (select (select (store (store .cse61 .cse62 (store (store .cse63 (+ 8 .cse64) v_ArrVal_1866) (+ .cse64 4) v_ArrVal_1870)) .cse65 v_ArrVal_1875) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse60 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))))))) (select v_ArrVal_1868 .cse64)))))) is different from false [2022-07-22 15:00:46,147 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:00:46,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 6 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 1589 treesize of output 1631 [2022-07-22 15:02:02,280 WARN L233 SmtUtils]: Spent 1.27m on a formula simplification that was a NOOP. DAG size: 77 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-22 15:02:02,281 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:02:02,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 6 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 1631 treesize of output 1718 [2022-07-22 15:03:24,505 WARN L233 SmtUtils]: Spent 1.37m on a formula simplification. DAG size of input: 75 DAG size of output: 35 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-22 15:03:24,505 INFO L356 Elim1Store]: treesize reduction 734, result has 14.6 percent of original size [2022-07-22 15:03:24,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 4391 treesize of output 4242