./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/splice-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e8d55036 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/list-properties/splice-2.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 098fc4cb5d15cb305e8d98bf2e1c69b111d102681b51dec68ae720515d6f30bc --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 19:31:27,798 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 19:31:27,800 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 19:31:27,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 19:31:27,829 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 19:31:27,830 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 19:31:27,832 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 19:31:27,835 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 19:31:27,836 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 19:31:27,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 19:31:27,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 19:31:27,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 19:31:27,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 19:31:27,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 19:31:27,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 19:31:27,845 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 19:31:27,847 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 19:31:27,848 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 19:31:27,849 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 19:31:27,853 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 19:31:27,854 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 19:31:27,858 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 19:31:27,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 19:31:27,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 19:31:27,861 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 19:31:27,862 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 19:31:27,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 19:31:27,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 19:31:27,864 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 19:31:27,865 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 19:31:27,866 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 19:31:27,867 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 19:31:27,867 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 19:31:27,868 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 19:31:27,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 19:31:27,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 19:31:27,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 19:31:27,870 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 19:31:27,870 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 19:31:27,871 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 19:31:27,872 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 19:31:27,874 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 19:31:27,894 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 19:31:27,895 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 19:31:27,897 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 19:31:27,897 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 19:31:27,898 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 19:31:27,898 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 19:31:27,899 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 19:31:27,899 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 19:31:27,899 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 19:31:27,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 19:31:27,900 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 19:31:27,900 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 19:31:27,900 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 19:31:27,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 19:31:27,901 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 19:31:27,901 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 19:31:27,901 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 19:31:27,901 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 19:31:27,901 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 19:31:27,901 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 19:31:27,901 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 19:31:27,902 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 19:31:27,902 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 19:31:27,902 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 19:31:27,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:31:27,902 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 19:31:27,902 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 19:31:27,902 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 19:31:27,903 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 19:31:27,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 19:31:27,903 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 19:31:27,903 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 19:31:27,903 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 19:31:27,904 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 19:31:27,904 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 19:31:27,904 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 098fc4cb5d15cb305e8d98bf2e1c69b111d102681b51dec68ae720515d6f30bc [2023-02-15 19:31:28,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 19:31:28,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 19:31:28,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 19:31:28,114 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 19:31:28,114 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 19:31:28,115 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/splice-2.i [2023-02-15 19:31:29,170 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 19:31:29,365 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 19:31:29,366 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/splice-2.i [2023-02-15 19:31:29,374 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/983ffbb08/0d75b9c2f8b843e785ac84c25f81037e/FLAG783884e35 [2023-02-15 19:31:29,385 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/983ffbb08/0d75b9c2f8b843e785ac84c25f81037e [2023-02-15 19:31:29,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 19:31:29,388 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 19:31:29,389 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 19:31:29,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 19:31:29,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 19:31:29,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:31:29" (1/1) ... [2023-02-15 19:31:29,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f315c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:31:29, skipping insertion in model container [2023-02-15 19:31:29,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:31:29" (1/1) ... [2023-02-15 19:31:29,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 19:31:29,432 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 19:31:29,628 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/splice-2.i[23721,23734] [2023-02-15 19:31:29,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:31:29,637 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 19:31:29,660 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/splice-2.i[23721,23734] [2023-02-15 19:31:29,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:31:29,677 INFO L208 MainTranslator]: Completed translation [2023-02-15 19:31:29,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:31:29 WrapperNode [2023-02-15 19:31:29,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 19:31:29,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 19:31:29,679 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 19:31:29,679 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 19:31:29,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:31:29" (1/1) ... [2023-02-15 19:31:29,690 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:31:29" (1/1) ... [2023-02-15 19:31:29,702 INFO L138 Inliner]: procedures = 124, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 104 [2023-02-15 19:31:29,703 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 19:31:29,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 19:31:29,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 19:31:29,703 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 19:31:29,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:31:29" (1/1) ... [2023-02-15 19:31:29,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:31:29" (1/1) ... [2023-02-15 19:31:29,712 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:31:29" (1/1) ... [2023-02-15 19:31:29,712 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:31:29" (1/1) ... [2023-02-15 19:31:29,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:31:29" (1/1) ... [2023-02-15 19:31:29,718 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:31:29" (1/1) ... [2023-02-15 19:31:29,719 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:31:29" (1/1) ... [2023-02-15 19:31:29,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:31:29" (1/1) ... [2023-02-15 19:31:29,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 19:31:29,722 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 19:31:29,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 19:31:29,722 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 19:31:29,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:31:29" (1/1) ... [2023-02-15 19:31:29,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:31:29,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:31:29,758 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 19:31:29,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 19:31:29,784 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-02-15 19:31:29,785 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-02-15 19:31:29,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 19:31:29,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 19:31:29,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 19:31:29,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 19:31:29,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 19:31:29,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 19:31:29,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 19:31:29,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 19:31:29,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 19:31:29,885 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 19:31:29,887 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 19:31:29,910 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-02-15 19:31:30,043 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 19:31:30,047 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 19:31:30,048 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 19:31:30,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:31:30 BoogieIcfgContainer [2023-02-15 19:31:30,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 19:31:30,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 19:31:30,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 19:31:30,053 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 19:31:30,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 07:31:29" (1/3) ... [2023-02-15 19:31:30,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c0c0c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:31:30, skipping insertion in model container [2023-02-15 19:31:30,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:31:29" (2/3) ... [2023-02-15 19:31:30,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c0c0c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:31:30, skipping insertion in model container [2023-02-15 19:31:30,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:31:30" (3/3) ... [2023-02-15 19:31:30,055 INFO L112 eAbstractionObserver]: Analyzing ICFG splice-2.i [2023-02-15 19:31:30,068 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 19:31:30,068 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 19:31:30,100 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 19:31:30,106 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4ec9daf0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 19:31:30,106 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 19:31:30,109 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 29 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:31:30,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 19:31:30,115 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:31:30,115 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:31:30,116 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:31:30,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:31:30,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1192551972, now seen corresponding path program 1 times [2023-02-15 19:31:30,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:31:30,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165699147] [2023-02-15 19:31:30,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:30,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:31:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:30,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:31:30,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:31:30,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165699147] [2023-02-15 19:31:30,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165699147] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:31:30,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:31:30,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 19:31:30,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130551311] [2023-02-15 19:31:30,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:31:30,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 19:31:30,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:31:30,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 19:31:30,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 19:31:30,346 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 29 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 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 6.0) internal successors, (12), 2 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) [2023-02-15 19:31:30,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:31:30,360 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2023-02-15 19:31:30,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 19:31:30,361 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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 [2023-02-15 19:31:30,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:31:30,365 INFO L225 Difference]: With dead ends: 48 [2023-02-15 19:31:30,365 INFO L226 Difference]: Without dead ends: 23 [2023-02-15 19:31:30,367 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 [2023-02-15 19:31:30,370 INFO L413 NwaCegarLoop]: 40 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, 40 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 [2023-02-15 19:31:30,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:31:30,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-15 19:31:30,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-15 19:31:30,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 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) [2023-02-15 19:31:30,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-02-15 19:31:30,391 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 12 [2023-02-15 19:31:30,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:31:30,392 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-02-15 19:31:30,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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) [2023-02-15 19:31:30,392 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-02-15 19:31:30,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 19:31:30,393 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:31:30,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:31:30,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 19:31:30,393 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:31:30,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:31:30,394 INFO L85 PathProgramCache]: Analyzing trace with hash 675462707, now seen corresponding path program 1 times [2023-02-15 19:31:30,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:31:30,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944142744] [2023-02-15 19:31:30,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:30,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:31:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:30,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:31:30,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:31:30,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944142744] [2023-02-15 19:31:30,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944142744] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:31:30,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:31:30,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 19:31:30,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398910594] [2023-02-15 19:31:30,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:31:30,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 19:31:30,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:31:30,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 19:31:30,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 19:31:30,561 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:31:30,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:31:30,617 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2023-02-15 19:31:30,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 19:31:30,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2023-02-15 19:31:30,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:31:30,618 INFO L225 Difference]: With dead ends: 40 [2023-02-15 19:31:30,618 INFO L226 Difference]: Without dead ends: 33 [2023-02-15 19:31:30,619 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 [2023-02-15 19:31:30,620 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:31:30,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 62 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:31:30,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-15 19:31:30,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2023-02-15 19:31:30,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:31:30,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2023-02-15 19:31:30,631 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 14 [2023-02-15 19:31:30,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:31:30,631 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2023-02-15 19:31:30,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:31:30,631 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2023-02-15 19:31:30,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 19:31:30,632 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:31:30,633 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:31:30,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 19:31:30,633 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:31:30,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:31:30,634 INFO L85 PathProgramCache]: Analyzing trace with hash 577924040, now seen corresponding path program 1 times [2023-02-15 19:31:30,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:31:30,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404449716] [2023-02-15 19:31:30,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:30,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:31:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:31:30,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:31:30,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404449716] [2023-02-15 19:31:30,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404449716] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:31:30,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:31:30,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 19:31:30,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059531887] [2023-02-15 19:31:30,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:31:30,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 19:31:30,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:31:30,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 19:31:30,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 19:31:30,701 INFO L87 Difference]: Start difference. First operand 28 states and 36 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) [2023-02-15 19:31:30,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:31:30,730 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2023-02-15 19:31:30,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 19:31:30,730 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 [2023-02-15 19:31:30,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:31:30,732 INFO L225 Difference]: With dead ends: 47 [2023-02-15 19:31:30,732 INFO L226 Difference]: Without dead ends: 39 [2023-02-15 19:31:30,732 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 [2023-02-15 19:31:30,733 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:31:30,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 63 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:31:30,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-15 19:31:30,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2023-02-15 19:31:30,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 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) [2023-02-15 19:31:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2023-02-15 19:31:30,737 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 16 [2023-02-15 19:31:30,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:31:30,738 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2023-02-15 19:31:30,738 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) [2023-02-15 19:31:30,738 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2023-02-15 19:31:30,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 19:31:30,738 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:31:30,739 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:31:30,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 19:31:30,739 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:31:30,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:31:30,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1645466066, now seen corresponding path program 1 times [2023-02-15 19:31:30,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:31:30,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608419883] [2023-02-15 19:31:30,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:30,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:31:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:30,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:31:30,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:31:30,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608419883] [2023-02-15 19:31:30,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608419883] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:31:30,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:31:30,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 19:31:30,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944240626] [2023-02-15 19:31:30,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:31:30,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 19:31:30,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:31:30,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 19:31:30,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:31:30,851 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:31:30,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:31:30,977 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2023-02-15 19:31:30,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 19:31:30,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2023-02-15 19:31:30,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:31:30,978 INFO L225 Difference]: With dead ends: 70 [2023-02-15 19:31:30,978 INFO L226 Difference]: Without dead ends: 43 [2023-02-15 19:31:30,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-15 19:31:30,982 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 11 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:31:30,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 78 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:31:30,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-15 19:31:30,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2023-02-15 19:31:30,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:31:30,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2023-02-15 19:31:30,990 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 17 [2023-02-15 19:31:30,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:31:30,990 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2023-02-15 19:31:30,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:31:30,990 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2023-02-15 19:31:30,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 19:31:30,991 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:31:30,991 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:31:30,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 19:31:30,991 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:31:30,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:31:30,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1334445095, now seen corresponding path program 1 times [2023-02-15 19:31:30,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:31:30,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912946662] [2023-02-15 19:31:30,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:30,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:31:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:31,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:31:31,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:31:31,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912946662] [2023-02-15 19:31:31,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912946662] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:31:31,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524656005] [2023-02-15 19:31:31,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:31,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:31:31,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:31:31,451 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) [2023-02-15 19:31:31,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 19:31:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:31,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-15 19:31:31,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:31:31,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 19:31:31,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:31:31,687 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 19:31:31,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 19:31:31,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:31:31,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 19:31:31,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 19:31:31,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:31:31,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 19:31:31,847 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:31:31,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:31:31,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:31:32,027 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:31:32,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2023-02-15 19:31:32,036 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:31:32,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2023-02-15 19:31:32,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-02-15 19:31:32,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:31:32,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524656005] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:31:32,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:31:32,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2023-02-15 19:31:32,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063291937] [2023-02-15 19:31:32,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:31:32,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-15 19:31:32,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:31:32,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-15 19:31:32,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=465, Unknown=5, NotChecked=0, Total=552 [2023-02-15 19:31:32,130 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:31:32,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:31:32,882 INFO L93 Difference]: Finished difference Result 136 states and 180 transitions. [2023-02-15 19:31:32,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 19:31:32,883 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 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 [2023-02-15 19:31:32,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:31:32,885 INFO L225 Difference]: With dead ends: 136 [2023-02-15 19:31:32,885 INFO L226 Difference]: Without dead ends: 103 [2023-02-15 19:31:32,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=226, Invalid=1028, Unknown=6, NotChecked=0, Total=1260 [2023-02-15 19:31:32,904 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 162 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 58 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 19:31:32,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 291 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 449 Invalid, 2 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 19:31:32,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-15 19:31:32,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 70. [2023-02-15 19:31:32,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.318840579710145) internal successors, (91), 69 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:31:32,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2023-02-15 19:31:32,912 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 23 [2023-02-15 19:31:32,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:31:32,912 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2023-02-15 19:31:32,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:31:32,912 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2023-02-15 19:31:32,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 19:31:32,913 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:31:32,913 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:31:32,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 19:31:33,118 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 [2023-02-15 19:31:33,119 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:31:33,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:31:33,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1793450878, now seen corresponding path program 1 times [2023-02-15 19:31:33,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:31:33,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002316579] [2023-02-15 19:31:33,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:33,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:31:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:33,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:31:33,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:31:33,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002316579] [2023-02-15 19:31:33,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002316579] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:31:33,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021441207] [2023-02-15 19:31:33,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:33,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:31:33,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:31:33,558 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:31:33,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 19:31:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:33,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 19:31:33,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:31:33,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 19:31:33,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 19:31:33,713 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 7 [2023-02-15 19:31:33,715 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 7 [2023-02-15 19:31:33,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 19:31:33,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:31:33,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 19:31:33,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021441207] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:31:33,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:31:33,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 12 [2023-02-15 19:31:33,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640303821] [2023-02-15 19:31:33,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:31:33,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 19:31:33,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:31:33,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 19:31:33,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-02-15 19:31:33,740 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:31:34,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:31:34,037 INFO L93 Difference]: Finished difference Result 122 states and 154 transitions. [2023-02-15 19:31:34,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 19:31:34,037 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 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 25 [2023-02-15 19:31:34,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:31:34,038 INFO L225 Difference]: With dead ends: 122 [2023-02-15 19:31:34,038 INFO L226 Difference]: Without dead ends: 109 [2023-02-15 19:31:34,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2023-02-15 19:31:34,039 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 84 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:31:34,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 170 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:31:34,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-15 19:31:34,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 77. [2023-02-15 19:31:34,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 76 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:31:34,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 101 transitions. [2023-02-15 19:31:34,057 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 101 transitions. Word has length 25 [2023-02-15 19:31:34,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:31:34,058 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 101 transitions. [2023-02-15 19:31:34,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:31:34,058 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 101 transitions. [2023-02-15 19:31:34,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 19:31:34,058 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:31:34,059 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:31:34,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 19:31:34,263 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 [2023-02-15 19:31:34,263 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:31:34,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:31:34,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1425682976, now seen corresponding path program 1 times [2023-02-15 19:31:34,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:31:34,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837811319] [2023-02-15 19:31:34,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:34,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:31:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:34,612 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:31:34,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:31:34,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837811319] [2023-02-15 19:31:34,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837811319] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:31:34,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951489026] [2023-02-15 19:31:34,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:34,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:31:34,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:31:34,629 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:31:34,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 19:31:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:34,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-15 19:31:34,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:31:34,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 19:31:34,772 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 19:31:34,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 19:31:34,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 19:31:34,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 19:31:34,872 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:31:34,872 INFO L350 Elim1Store]: Elim1 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 64 treesize of output 61 [2023-02-15 19:31:34,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2023-02-15 19:31:34,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2023-02-15 19:31:34,927 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:31:34,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2023-02-15 19:31:34,934 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:31:34,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-02-15 19:31:34,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 19:31:34,983 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:31:34,999 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:31:35,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:31:35,180 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:31:35,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2023-02-15 19:31:35,186 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:31:35,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 78 [2023-02-15 19:31:35,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2023-02-15 19:31:37,344 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:31:37,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-02-15 19:31:37,350 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:31:37,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2023-02-15 19:31:37,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-02-15 19:31:37,368 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 19:31:37,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-02-15 19:31:37,375 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 19:31:37,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-02-15 19:31:37,504 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:31:37,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951489026] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:31:37,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:31:37,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 33 [2023-02-15 19:31:37,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636101469] [2023-02-15 19:31:37,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:31:37,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-15 19:31:37,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:31:37,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-15 19:31:37,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=949, Unknown=19, NotChecked=0, Total=1056 [2023-02-15 19:31:37,506 INFO L87 Difference]: Start difference. First operand 77 states and 101 transitions. Second operand has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:31:38,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:31:38,397 INFO L93 Difference]: Finished difference Result 168 states and 219 transitions. [2023-02-15 19:31:38,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 19:31:38,398 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 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 26 [2023-02-15 19:31:38,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:31:38,398 INFO L225 Difference]: With dead ends: 168 [2023-02-15 19:31:38,398 INFO L226 Difference]: Without dead ends: 109 [2023-02-15 19:31:38,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=275, Invalid=2156, Unknown=19, NotChecked=0, Total=2450 [2023-02-15 19:31:38,400 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 178 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 19:31:38,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 461 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 19:31:38,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-15 19:31:38,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 73. [2023-02-15 19:31:38,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 72 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:31:38,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2023-02-15 19:31:38,406 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 26 [2023-02-15 19:31:38,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:31:38,407 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2023-02-15 19:31:38,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:31:38,407 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2023-02-15 19:31:38,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 19:31:38,407 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:31:38,408 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:31:38,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 19:31:38,614 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 [2023-02-15 19:31:38,614 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:31:38,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:31:38,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1417962172, now seen corresponding path program 2 times [2023-02-15 19:31:38,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:31:38,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241581362] [2023-02-15 19:31:38,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:38,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:31:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:38,638 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 19:31:38,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:31:38,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241581362] [2023-02-15 19:31:38,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241581362] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:31:38,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:31:38,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:31:38,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842603124] [2023-02-15 19:31:38,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:31:38,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:31:38,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:31:38,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:31:38,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:31:38,640 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:31:38,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:31:38,650 INFO L93 Difference]: Finished difference Result 98 states and 121 transitions. [2023-02-15 19:31:38,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:31:38,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 29 [2023-02-15 19:31:38,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:31:38,651 INFO L225 Difference]: With dead ends: 98 [2023-02-15 19:31:38,651 INFO L226 Difference]: Without dead ends: 56 [2023-02-15 19:31:38,652 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 [2023-02-15 19:31:38,652 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 15 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:31:38,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 68 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:31:38,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-02-15 19:31:38,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2023-02-15 19:31:38,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:31:38,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2023-02-15 19:31:38,656 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 29 [2023-02-15 19:31:38,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:31:38,656 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2023-02-15 19:31:38,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:31:38,657 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2023-02-15 19:31:38,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 19:31:38,657 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:31:38,657 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:31:38,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 19:31:38,658 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:31:38,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:31:38,658 INFO L85 PathProgramCache]: Analyzing trace with hash -972154903, now seen corresponding path program 1 times [2023-02-15 19:31:38,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:31:38,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867277361] [2023-02-15 19:31:38,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:38,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:31:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:39,247 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:31:39,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:31:39,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867277361] [2023-02-15 19:31:39,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867277361] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:31:39,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544514715] [2023-02-15 19:31:39,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:31:39,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:31:39,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:31:39,261 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:31:39,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 19:31:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:31:39,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 65 conjunts are in the unsatisfiable core [2023-02-15 19:31:39,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:31:39,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 19:31:39,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:31:39,437 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:31:39,438 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 21 [2023-02-15 19:31:39,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:31:39,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 19:31:39,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 19:31:39,562 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 19:31:39,562 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 19:31:39,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 19:31:39,574 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:31:39,577 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 37 treesize of output 35 [2023-02-15 19:31:39,612 INFO L321 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2023-02-15 19:31:39,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 19:31:39,667 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-15 19:31:39,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 45 [2023-02-15 19:31:39,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-15 19:31:39,772 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 19:31:39,772 INFO L350 Elim1Store]: Elim1 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 85 treesize of output 68 [2023-02-15 19:31:39,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-02-15 19:31:39,868 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 19:31:39,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 19 [2023-02-15 19:31:39,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:31:39,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 19:31:39,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 19:31:40,007 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:31:40,008 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:31:40,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:31:40,232 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_394 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_394) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (forall ((v_ArrVal_395 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_395) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) is different from false [2023-02-15 19:31:40,379 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:31:40,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2023-02-15 19:31:40,490 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:31:40,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2023-02-15 19:31:40,498 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:31:40,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 166 [2023-02-15 19:31:40,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 134 [2023-02-15 19:31:40,515 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:31:40,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 117 [2023-02-15 19:31:41,011 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:31:41,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2023-02-15 19:31:41,018 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:31:41,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 63 [2023-02-15 19:31:41,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2023-02-15 19:31:41,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-02-15 19:31:41,230 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 12 refuted. 1 times theorem prover too weak. 0 trivial. 4 not checked. [2023-02-15 19:31:41,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544514715] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:31:41,230 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:31:41,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 44 [2023-02-15 19:31:41,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420742476] [2023-02-15 19:31:41,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:31:41,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-02-15 19:31:41,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:31:41,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-02-15 19:31:41,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1598, Unknown=32, NotChecked=82, Total=1892 [2023-02-15 19:31:41,232 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 44 states, 44 states have (on average 1.9545454545454546) internal successors, (86), 44 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) [2023-02-15 19:31:43,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 19:31:45,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 19:31:47,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 19:31:58,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 19:32:00,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 19:32:03,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 19:32:05,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 19:32:07,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 19:32:09,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 19:32:18,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 19:32:20,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 19:32:22,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 19:32:22,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:32:22,963 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2023-02-15 19:32:22,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-15 19:32:22,964 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.9545454545454546) internal successors, (86), 44 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 32 [2023-02-15 19:32:22,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:32:22,964 INFO L225 Difference]: With dead ends: 94 [2023-02-15 19:32:22,964 INFO L226 Difference]: Without dead ends: 92 [2023-02-15 19:32:22,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=622, Invalid=4173, Unknown=39, NotChecked=136, Total=4970 [2023-02-15 19:32:22,966 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 276 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 95 mSolverCounterUnsat, 39 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 39 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 25.9s IncrementalHoareTripleChecker+Time [2023-02-15 19:32:22,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 345 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 765 Invalid, 39 Unknown, 66 Unchecked, 25.9s Time] [2023-02-15 19:32:22,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-15 19:32:22,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 51. [2023-02-15 19:32:22,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.18) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:32:22,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2023-02-15 19:32:22,971 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 32 [2023-02-15 19:32:22,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:32:22,971 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2023-02-15 19:32:22,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.9545454545454546) internal successors, (86), 44 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) [2023-02-15 19:32:22,971 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2023-02-15 19:32:22,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 19:32:22,971 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:32:22,972 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:32:22,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 19:32:23,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:32:23,177 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:32:23,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:32:23,178 INFO L85 PathProgramCache]: Analyzing trace with hash 2060333054, now seen corresponding path program 1 times [2023-02-15 19:32:23,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:32:23,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855981354] [2023-02-15 19:32:23,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:32:23,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:32:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:23,236 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 19:32:23,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:32:23,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855981354] [2023-02-15 19:32:23,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855981354] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:32:23,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299630240] [2023-02-15 19:32:23,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:32:23,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:32:23,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:32:23,263 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:32:23,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 19:32:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:23,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 19:32:23,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:32:23,382 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 19:32:23,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:32:23,420 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 19:32:23,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299630240] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:32:23,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:32:23,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2023-02-15 19:32:23,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575620083] [2023-02-15 19:32:23,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:32:23,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 19:32:23,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:32:23,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 19:32:23,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:32:23,423 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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) [2023-02-15 19:32:23,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:32:23,495 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2023-02-15 19:32:23,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 19:32:23,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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) Word has length 34 [2023-02-15 19:32:23,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:32:23,496 INFO L225 Difference]: With dead ends: 64 [2023-02-15 19:32:23,496 INFO L226 Difference]: Without dead ends: 59 [2023-02-15 19:32:23,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-02-15 19:32:23,497 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 71 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:32:23,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 58 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:32:23,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-15 19:32:23,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2023-02-15 19:32:23,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.16) internal successors, (58), 50 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) [2023-02-15 19:32:23,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2023-02-15 19:32:23,505 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 34 [2023-02-15 19:32:23,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:32:23,507 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2023-02-15 19:32:23,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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) [2023-02-15 19:32:23,507 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2023-02-15 19:32:23,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 19:32:23,509 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:32:23,509 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:32:23,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 19:32:23,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-15 19:32:23,715 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:32:23,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:32:23,716 INFO L85 PathProgramCache]: Analyzing trace with hash 2062043076, now seen corresponding path program 1 times [2023-02-15 19:32:23,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:32:23,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882807931] [2023-02-15 19:32:23,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:32:23,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:32:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:24,597 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:32:24,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:32:24,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882807931] [2023-02-15 19:32:24,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882807931] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:32:24,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916305177] [2023-02-15 19:32:24,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:32:24,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:32:24,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:32:24,613 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:32:24,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 19:32:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:24,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-15 19:32:24,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:32:24,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 19:32:24,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 19:32:24,830 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-15 19:32:24,830 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 19:32:24,842 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-15 19:32:24,842 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 19:32:24,914 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 7 [2023-02-15 19:32:24,919 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 7 [2023-02-15 19:32:24,920 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 19:32:24,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:32:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 19:32:25,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916305177] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:32:25,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:32:25,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 7] total 22 [2023-02-15 19:32:25,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592043951] [2023-02-15 19:32:25,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:32:25,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-15 19:32:25,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:32:25,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-15 19:32:25,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2023-02-15 19:32:25,068 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 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) [2023-02-15 19:32:25,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:32:25,653 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2023-02-15 19:32:25,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 19:32:25,654 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 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 34 [2023-02-15 19:32:25,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:32:25,654 INFO L225 Difference]: With dead ends: 95 [2023-02-15 19:32:25,654 INFO L226 Difference]: Without dead ends: 88 [2023-02-15 19:32:25,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=930, Unknown=0, NotChecked=0, Total=1056 [2023-02-15 19:32:25,655 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 37 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:32:25,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 215 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 19:32:25,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-15 19:32:25,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 52. [2023-02-15 19:32:25,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:32:25,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2023-02-15 19:32:25,664 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 34 [2023-02-15 19:32:25,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:32:25,664 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2023-02-15 19:32:25,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 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) [2023-02-15 19:32:25,664 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2023-02-15 19:32:25,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 19:32:25,666 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:32:25,666 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:32:25,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-15 19:32:25,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:32:25,872 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:32:25,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:32:25,872 INFO L85 PathProgramCache]: Analyzing trace with hash 355505244, now seen corresponding path program 2 times [2023-02-15 19:32:25,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:32:25,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442438651] [2023-02-15 19:32:25,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:32:25,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:32:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:32:26,684 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:32:26,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:32:26,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442438651] [2023-02-15 19:32:26,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442438651] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:32:26,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61613503] [2023-02-15 19:32:26,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:32:26,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:32:26,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:32:26,705 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:32:26,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 19:32:26,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:32:26,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:32:26,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 78 conjunts are in the unsatisfiable core [2023-02-15 19:32:26,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:32:26,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 19:32:26,871 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 19:32:26,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 19:32:26,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 19:32:26,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 19:32:26,960 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:32:26,961 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 26 treesize of output 26 [2023-02-15 19:32:26,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:32:26,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-15 19:32:27,027 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:32:27,033 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 19:32:27,033 INFO L350 Elim1Store]: Elim1 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 115 treesize of output 81 [2023-02-15 19:32:27,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 61 [2023-02-15 19:32:27,132 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2023-02-15 19:32:27,133 INFO L350 Elim1Store]: Elim1 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 97 treesize of output 86 [2023-02-15 19:32:27,161 INFO L321 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2023-02-15 19:32:27,161 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 67 [2023-02-15 19:32:27,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2023-02-15 19:32:27,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-02-15 19:32:27,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 19:32:27,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 53 [2023-02-15 19:32:27,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2023-02-15 19:32:27,508 INFO L321 Elim1Store]: treesize reduction 76, result has 43.7 percent of original size [2023-02-15 19:32:27,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 77 treesize of output 116 [2023-02-15 19:32:27,519 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:32:27,519 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 96 [2023-02-15 19:32:27,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 77 [2023-02-15 19:32:27,527 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2023-02-15 19:32:27,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2023-02-15 19:32:27,552 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:27,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 43 [2023-02-15 19:32:27,694 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 19:32:27,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 41 [2023-02-15 19:32:27,700 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 19:32:27,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 33 [2023-02-15 19:32:27,763 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:32:27,763 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 26 [2023-02-15 19:32:27,770 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:32:27,772 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:32:27,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:32:27,956 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_722))) (or (= 3 (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (select (select (store .cse0 |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_725) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_723) |c_ULTIMATE.start_main_~p~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_724) |c_ULTIMATE.start_main_~p~0#1.base|) .cse1)))) (= 3 (select (select .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) is different from false [2023-02-15 19:32:27,965 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_722)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse4)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse4))) (or (= 3 (select (select .cse0 .cse1) .cse2)) (= 3 (let ((.cse3 (+ .cse2 4))) (select (select (store .cse0 .cse1 v_ArrVal_725) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_723) .cse1) .cse3)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_724) .cse1) .cse3)))))))) is different from false [2023-02-15 19:32:28,056 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2023-02-15 19:32:28,056 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 151 treesize of output 147 [2023-02-15 19:32:28,125 INFO L321 Elim1Store]: treesize reduction 11, result has 96.3 percent of original size [2023-02-15 19:32:28,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 969 treesize of output 1100 [2023-02-15 19:32:28,154 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:28,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 408 treesize of output 380 [2023-02-15 19:32:28,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 696 treesize of output 568 [2023-02-15 19:32:37,225 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse4 |c_ULTIMATE.start_main_~t~0#1.offset|)))) (and (forall ((v_ArrVal_717 Int)) (or (= |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_717) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse0 (select (select (store .cse5 v_ArrVal_717 v_ArrVal_721) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~t~0#1.offset| .cse0) (= v_ArrVal_717 (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718))) (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ .cse0 4)))))))) (forall ((v_ArrVal_717 Int)) (or (forall ((v_ArrVal_718 (Array Int Int))) (let ((.cse6 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse6 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_721 (Array Int Int))) (let ((.cse7 (store .cse5 v_ArrVal_717 v_ArrVal_721))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_ArrVal_724 (Array Int Int))) (= |c_ULTIMATE.start_main_~t~0#1.offset| (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse6) (+ .cse8 4)))) (= |c_ULTIMATE.start_main_~t~0#1.offset| .cse8)))))))) (= |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_717))) (forall ((v_ArrVal_717 Int)) (or (forall ((v_ArrVal_721 (Array Int Int))) (let ((.cse13 (store .cse5 v_ArrVal_717 v_ArrVal_721))) (let ((.cse9 (select (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse12 (+ .cse9 4))) (or (not (= .cse10 |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_723 (Array Int Int))) (not (= (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) .cse10) .cse12) |c_ULTIMATE.start_main_~a~0#1.base|))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store .cse13 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse10) .cse12)))))))))) (= |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_717))) (forall ((v_ArrVal_717 Int)) (or (= |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_717) (forall ((v_ArrVal_721 (Array Int Int))) (let ((.cse17 (store .cse5 v_ArrVal_717 v_ArrVal_721))) (let ((.cse15 (select (select .cse17 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_ArrVal_718 (Array Int Int))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse14 |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_724 (Array Int Int))) (let ((.cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse14) (+ .cse15 4)))) (or (= .cse15 .cse16) (= |c_ULTIMATE.start_main_~t~0#1.offset| .cse16))))))) (= .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (forall ((v_ArrVal_717 Int)) (or (forall ((v_ArrVal_718 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse18 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_721 (Array Int Int))) (let ((.cse22 (store .cse5 v_ArrVal_717 v_ArrVal_721))) (let ((.cse21 (select (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (let ((.cse20 (+ .cse21 4))) (or (forall ((v_ArrVal_723 (Array Int Int))) (not (= (select (select (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) .cse18) .cse20) .cse18))) (forall ((v_ArrVal_724 (Array Int Int))) (= .cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse18) .cse20))) (= |c_ULTIMATE.start_main_~t~0#1.offset| .cse21)))))))))) (= |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_717))) (forall ((v_ArrVal_717 Int)) (or (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse25 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718))) (let ((.cse23 (select (select .cse25 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse24 (select (select (store .cse5 v_ArrVal_717 v_ArrVal_721) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse23 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|) (= v_ArrVal_717 (select (select (store .cse25 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) .cse23) (+ .cse24 4))))))) (= |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_717))) (forall ((v_ArrVal_717 Int)) (or (forall ((v_ArrVal_718 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= v_ArrVal_717 .cse26) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_724 (Array Int Int))) (= |c_ULTIMATE.start_main_~t~0#1.offset| (let ((.cse27 (store .cse5 v_ArrVal_717 v_ArrVal_721))) (select (select (store .cse27 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse26) (+ (select (select .cse27 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4)))))))) (= |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_717))) (forall ((v_ArrVal_717 Int)) (or (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse29 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718))) (let ((.cse28 (select (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= v_ArrVal_717 .cse28) (= v_ArrVal_717 (select (select (store .cse29 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) .cse28) (+ (select (select (store .cse5 v_ArrVal_717 v_ArrVal_721) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))))))) (= |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_717))) (or (and (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_717 Int)) (let ((.cse35 (store .cse5 v_ArrVal_717 v_ArrVal_721))) (let ((.cse33 (select (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718))) (let ((.cse31 (select (select .cse30 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse32 (+ .cse33 4))) (let ((.cse34 (select (select (store .cse35 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse31) .cse32))) (or (forall ((v_ArrVal_723 (Array Int Int))) (not (= (select (select (store .cse30 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) .cse31) .cse32) |c_ULTIMATE.start_main_~a~0#1.base|))) (= .cse33 .cse34) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse34)))))) (= |c_ULTIMATE.start_main_~t~0#1.offset| .cse33))))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_718 (Array Int Int))) (let ((.cse36 (select (select (store .cse5 v_ArrVal_717 v_ArrVal_721) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~t~0#1.offset| .cse36) (= v_ArrVal_717 (select (let ((.cse37 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718))) (select (store .cse37 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) (select (select .cse37 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ .cse36 4)))))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_717 Int)) (let ((.cse42 (store .cse5 v_ArrVal_717 v_ArrVal_721))) (let ((.cse38 (select (select .cse42 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse40 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718))) (let ((.cse39 (select (select .cse40 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse41 (+ .cse38 4))) (or (not (= .cse39 |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_723 (Array Int Int))) (not (= (select (select (store .cse40 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) .cse39) .cse41) |c_ULTIMATE.start_main_~a~0#1.base|))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store .cse42 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse39) .cse41)))))))))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_717 Int)) (let ((.cse46 (store .cse5 v_ArrVal_717 v_ArrVal_721))) (let ((.cse44 (select (select .cse46 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_ArrVal_718 (Array Int Int))) (let ((.cse43 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse43 |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_724 (Array Int Int))) (let ((.cse45 (select (select (store .cse46 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse43) (+ .cse44 4)))) (or (= .cse44 .cse45) (= |c_ULTIMATE.start_main_~t~0#1.offset| .cse45))))))) (= .cse44 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (forall ((v_ArrVal_717 Int) (v_ArrVal_718 (Array Int Int))) (let ((.cse48 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718))) (let ((.cse47 (select (select .cse48 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse47 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_721 (Array Int Int))) (let ((.cse51 (store .cse5 v_ArrVal_717 v_ArrVal_721))) (let ((.cse50 (select (select .cse51 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (let ((.cse49 (+ .cse50 4))) (or (forall ((v_ArrVal_723 (Array Int Int))) (not (= (select (select (store .cse48 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) .cse47) .cse49) .cse47))) (forall ((v_ArrVal_724 (Array Int Int))) (= .cse50 (select (select (store .cse51 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse47) .cse49))) (= |c_ULTIMATE.start_main_~t~0#1.offset| .cse50)))))))))) (forall ((v_ArrVal_717 Int) (v_ArrVal_718 (Array Int Int))) (let ((.cse52 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse52 |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_721 (Array Int Int))) (let ((.cse53 (store .cse5 v_ArrVal_717 v_ArrVal_721))) (let ((.cse54 (select (select .cse53 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_ArrVal_724 (Array Int Int))) (= |c_ULTIMATE.start_main_~t~0#1.offset| (select (select (store .cse53 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse52) (+ .cse54 4)))) (= |c_ULTIMATE.start_main_~t~0#1.offset| .cse54)))))))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_718 (Array Int Int))) (let ((.cse56 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718))) (let ((.cse55 (select (select .cse56 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= v_ArrVal_717 .cse55) (= v_ArrVal_717 (select (select (store .cse56 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) .cse55) (+ (select (select (store .cse5 v_ArrVal_717 v_ArrVal_721) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))))))) (forall ((v_ArrVal_717 Int) (v_ArrVal_718 (Array Int Int))) (let ((.cse57 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= v_ArrVal_717 .cse57) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_724 (Array Int Int))) (= |c_ULTIMATE.start_main_~t~0#1.offset| (let ((.cse58 (store .cse5 v_ArrVal_717 v_ArrVal_721))) (select (select (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse57) (+ (select (select .cse58 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4)))))))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_718 (Array Int Int))) (let ((.cse61 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718))) (let ((.cse59 (select (select .cse61 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse60 (select (select (store .cse5 v_ArrVal_717 v_ArrVal_721) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= .cse59 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse60 |c_ULTIMATE.start_main_~a~0#1.offset|) (= v_ArrVal_717 (select (select (store .cse61 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) .cse59) (+ .cse60 4)))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_main_~t~0#1.offset|)) (forall ((v_ArrVal_717 Int)) (or (forall ((v_ArrVal_721 (Array Int Int))) (let ((.cse67 (store .cse5 v_ArrVal_717 v_ArrVal_721))) (let ((.cse65 (select (select .cse67 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse62 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718))) (let ((.cse63 (select (select .cse62 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse64 (+ .cse65 4))) (let ((.cse66 (select (select (store .cse67 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse63) .cse64))) (or (forall ((v_ArrVal_723 (Array Int Int))) (not (= (select (select (store .cse62 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) .cse63) .cse64) |c_ULTIMATE.start_main_~a~0#1.base|))) (= .cse65 .cse66) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse66)))))) (= |c_ULTIMATE.start_main_~t~0#1.offset| .cse65))))) (= |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_717)))))) is different from false [2023-02-15 19:32:38,354 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse8 0))) (.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|))) (and (forall ((v_ArrVal_717 Int)) (or (forall ((v_ArrVal_718 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse7 .cse8 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (forall ((v_ArrVal_721 (Array Int Int))) (let ((.cse4 (store .cse6 v_ArrVal_717 v_ArrVal_721))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse3 (+ .cse0 4))) (or (= 0 .cse0) (forall ((v_ArrVal_723 (Array Int Int))) (not (= (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) .cse2) .cse3) .cse2))) (forall ((v_ArrVal_724 (Array Int Int))) (= .cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse2) .cse3)))))))) (= .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))))) (= |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_717))) (forall ((v_ArrVal_717 Int)) (or (forall ((v_ArrVal_721 (Array Int Int))) (let ((.cse13 (store .cse6 v_ArrVal_717 v_ArrVal_721))) (let ((.cse9 (select (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse7 .cse8 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (.cse12 (+ .cse9 4))) (or (not (= .cse10 |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_723 (Array Int Int))) (not (= (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) .cse10) .cse12) |c_ULTIMATE.start_main_~a~0#1.base|))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store .cse13 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse10) .cse12)))))))))) (= |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_717))) (forall ((v_ArrVal_717 Int)) (or (forall ((v_ArrVal_718 (Array Int Int))) (let ((.cse16 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse7 .cse8 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (forall ((v_ArrVal_721 (Array Int Int))) (let ((.cse15 (store .cse6 v_ArrVal_717 v_ArrVal_721))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= 0 .cse14) (forall ((v_ArrVal_724 (Array Int Int))) (= 0 (select (select (store .cse15 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse16) (+ .cse14 4)))))))) (= .cse16 |c_ULTIMATE.start_main_~a~0#1.base|)))) (= |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_717))) (forall ((v_ArrVal_717 Int)) (or (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse17 (select (select (store .cse6 v_ArrVal_717 v_ArrVal_721) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= 0 .cse17) (= v_ArrVal_717 (select (let ((.cse18 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse7 .cse8 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718))) (select (store .cse18 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) (select (select .cse18 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (+ .cse17 4)))))) (= |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_717))) (forall ((v_ArrVal_717 Int)) (or (forall ((v_ArrVal_721 (Array Int Int))) (let ((.cse24 (store .cse6 v_ArrVal_717 v_ArrVal_721))) (let ((.cse19 (select (select .cse24 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= 0 .cse19) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse7 .cse8 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718))) (let ((.cse22 (select (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (.cse23 (+ .cse19 4))) (let ((.cse20 (select (select (store .cse24 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse22) .cse23))) (or (= .cse19 .cse20) (forall ((v_ArrVal_723 (Array Int Int))) (not (= (select (select (store .cse21 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) .cse22) .cse23) |c_ULTIMATE.start_main_~a~0#1.base|))) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse20)))))))))) (= |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_717))) (forall ((v_ArrVal_717 Int)) (or (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse26 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse7 .cse8 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718))) (let ((.cse25 (select (select .cse26 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= v_ArrVal_717 .cse25) (= v_ArrVal_717 (select (select (store .cse26 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) .cse25) (+ (select (select (store .cse6 v_ArrVal_717 v_ArrVal_721) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 4))))))) (= |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_717))) (forall ((v_ArrVal_717 Int)) (or (forall ((v_ArrVal_718 (Array Int Int))) (let ((.cse27 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse7 .cse8 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= v_ArrVal_717 .cse27) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_724 (Array Int Int))) (= 0 (let ((.cse28 (store .cse6 v_ArrVal_717 v_ArrVal_721))) (select (select (store .cse28 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse27) (+ (select (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 4)))))))) (= |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_717))) (forall ((v_ArrVal_717 Int)) (or (forall ((v_ArrVal_721 (Array Int Int))) (let ((.cse32 (store .cse6 v_ArrVal_717 v_ArrVal_721))) (let ((.cse29 (select (select .cse32 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|) (forall ((v_ArrVal_718 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse7 .cse8 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= .cse30 |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_724 (Array Int Int))) (let ((.cse31 (select (select (store .cse32 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse30) (+ .cse29 4)))) (or (= 0 .cse31) (= .cse29 .cse31))))))))))) (= |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_717))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (and (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_717 Int)) (let ((.cse37 (store .cse6 v_ArrVal_717 v_ArrVal_721))) (let ((.cse33 (select (select .cse37 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse35 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse7 .cse8 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718))) (let ((.cse34 (select (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (.cse36 (+ .cse33 4))) (or (not (= .cse34 |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_723 (Array Int Int))) (not (= (select (select (store .cse35 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) .cse34) .cse36) |c_ULTIMATE.start_main_~a~0#1.base|))) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store .cse37 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse34) .cse36)))))))))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_718 (Array Int Int))) (let ((.cse40 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse7 .cse8 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718))) (let ((.cse38 (select (select .cse40 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (.cse39 (select (select (store .cse6 v_ArrVal_717 v_ArrVal_721) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= .cse38 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|) (= v_ArrVal_717 (select (select (store .cse40 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) .cse38) (+ .cse39 4))))))) (forall ((v_ArrVal_717 Int) (v_ArrVal_718 (Array Int Int))) (let ((.cse42 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse7 .cse8 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718))) (let ((.cse43 (select (select .cse42 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (forall ((v_ArrVal_721 (Array Int Int))) (let ((.cse45 (store .cse6 v_ArrVal_717 v_ArrVal_721))) (let ((.cse41 (select (select .cse45 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse44 (+ .cse41 4))) (or (= 0 .cse41) (forall ((v_ArrVal_723 (Array Int Int))) (not (= (select (select (store .cse42 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) .cse43) .cse44) .cse43))) (forall ((v_ArrVal_724 (Array Int Int))) (= .cse41 (select (select (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse43) .cse44)))))))) (= .cse43 |c_ULTIMATE.start_main_~a~0#1.base|))))) (forall ((v_ArrVal_717 Int) (v_ArrVal_718 (Array Int Int))) (let ((.cse46 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse7 .cse8 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= v_ArrVal_717 .cse46) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_724 (Array Int Int))) (= 0 (let ((.cse47 (store .cse6 v_ArrVal_717 v_ArrVal_721))) (select (select (store .cse47 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse46) (+ (select (select .cse47 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 4)))))))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_718 (Array Int Int))) (let ((.cse49 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse7 .cse8 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718))) (let ((.cse48 (select (select .cse49 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= v_ArrVal_717 .cse48) (= v_ArrVal_717 (select (select (store .cse49 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) .cse48) (+ (select (select (store .cse6 v_ArrVal_717 v_ArrVal_721) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 4))))))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_717 Int)) (let ((.cse53 (store .cse6 v_ArrVal_717 v_ArrVal_721))) (let ((.cse50 (select (select .cse53 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|) (forall ((v_ArrVal_718 (Array Int Int))) (let ((.cse51 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse7 .cse8 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= .cse51 |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_724 (Array Int Int))) (let ((.cse52 (select (select (store .cse53 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse51) (+ .cse50 4)))) (or (= 0 .cse52) (= .cse50 .cse52))))))))))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_717 Int)) (let ((.cse59 (store .cse6 v_ArrVal_717 v_ArrVal_721))) (let ((.cse54 (select (select .cse59 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= 0 .cse54) (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse56 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse7 .cse8 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718))) (let ((.cse57 (select (select .cse56 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (.cse58 (+ .cse54 4))) (let ((.cse55 (select (select (store .cse59 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse57) .cse58))) (or (= .cse54 .cse55) (forall ((v_ArrVal_723 (Array Int Int))) (not (= (select (select (store .cse56 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) .cse57) .cse58) |c_ULTIMATE.start_main_~a~0#1.base|))) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse55)))))))))) (forall ((v_ArrVal_717 Int) (v_ArrVal_718 (Array Int Int))) (let ((.cse62 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse7 .cse8 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (forall ((v_ArrVal_721 (Array Int Int))) (let ((.cse61 (store .cse6 v_ArrVal_717 v_ArrVal_721))) (let ((.cse60 (select (select .cse61 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= 0 .cse60) (forall ((v_ArrVal_724 (Array Int Int))) (= 0 (select (select (store .cse61 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse62) (+ .cse60 4)))))))) (= .cse62 |c_ULTIMATE.start_main_~a~0#1.base|)))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_717 Int) (v_ArrVal_718 (Array Int Int))) (let ((.cse63 (select (select (store .cse6 v_ArrVal_717 v_ArrVal_721) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= 0 .cse63) (= v_ArrVal_717 (select (let ((.cse64 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse7 .cse8 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718))) (select (store .cse64 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) (select (select .cse64 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (+ .cse63 4)))))))) (forall ((v_ArrVal_717 Int)) (or (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse67 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse7 .cse8 v_ArrVal_717)) v_ArrVal_717 v_ArrVal_718))) (let ((.cse65 (select (select .cse67 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (.cse66 (select (select (store .cse6 v_ArrVal_717 v_ArrVal_721) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= .cse65 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse66 |c_ULTIMATE.start_main_~a~0#1.offset|) (= v_ArrVal_717 (select (select (store .cse67 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) .cse65) (+ .cse66 4))))))) (= |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_717)))))) is different from false [2023-02-15 19:32:38,627 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:38,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 153 [2023-02-15 19:32:38,643 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:38,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 133 [2023-02-15 19:32:38,664 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:38,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 71 [2023-02-15 19:32:38,671 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:38,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 67 [2023-02-15 19:32:38,686 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:38,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 130 [2023-02-15 19:32:38,692 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:38,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 121 [2023-02-15 19:32:38,711 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:38,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 125 [2023-02-15 19:32:38,718 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:38,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 137 [2023-02-15 19:32:38,738 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:38,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 72 [2023-02-15 19:32:38,745 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:38,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 86 [2023-02-15 19:32:38,761 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:38,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 183 [2023-02-15 19:32:38,768 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:38,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 148 [2023-02-15 19:32:38,804 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:38,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 153 [2023-02-15 19:32:38,811 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:38,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 133 [2023-02-15 19:32:38,830 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:38,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 125 [2023-02-15 19:32:38,837 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:38,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 137 [2023-02-15 19:32:38,860 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:38,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2023-02-15 19:32:38,866 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:38,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 86 [2023-02-15 19:32:38,881 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:38,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 72 [2023-02-15 19:32:38,887 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:38,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 86 [2023-02-15 19:32:38,902 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:38,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 71 [2023-02-15 19:32:38,908 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:38,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 66 [2023-02-15 19:32:38,934 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:38,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2023-02-15 19:32:38,939 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:38,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 66 [2023-02-15 19:32:38,951 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:38,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 71 [2023-02-15 19:32:38,957 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:38,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 67 [2023-02-15 19:32:38,976 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:38,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 183 [2023-02-15 19:32:38,983 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:38,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 148 [2023-02-15 19:32:39,003 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:39,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 130 [2023-02-15 19:32:39,010 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:39,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 121 [2023-02-15 19:32:39,031 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:39,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 71 [2023-02-15 19:32:39,038 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:39,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 66 [2023-02-15 19:32:39,055 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:39,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2023-02-15 19:32:39,062 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:39,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 66 [2023-02-15 19:32:39,079 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:39,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2023-02-15 19:32:39,084 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:39,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 86 [2023-02-15 19:32:39,143 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (and (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_arrayElimArr_18 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_18 .cse0))) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_18) .cse1 v_ArrVal_718))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_19) .cse1 v_ArrVal_721) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= (select v_arrayElimArr_19 .cse0) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse1) (not (= .cse2 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse1 (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) .cse2) (+ .cse4 4))) (= .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_718 (Array Int Int)) (v_arrayElimArr_40 (Array Int Int)) (v_arrayElimArr_41 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_41 .cse0))) (let ((.cse8 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_40) .cse7 v_ArrVal_721))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (.cse9 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_41) .cse7 v_ArrVal_718) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= 0 .cse6) (not (= (select v_arrayElimArr_40 .cse0) 0)) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse7) (= 0 (select (select (store .cse8 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse9) (+ .cse6 4))) (= .cse9 |c_ULTIMATE.start_main_~a~0#1.base|)))))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_arrayElimArr_17 (Array Int Int)) (v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse13 (select v_arrayElimArr_16 .cse0))) (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_17) .cse13 v_ArrVal_721))) (let ((.cse14 (select (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (.cse15 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_16) .cse13 v_ArrVal_718))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (.cse12 (+ .cse14 4))) (or (not (= .cse10 |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse10) .cse12)) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse13) (= .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_17 .cse0) 0)) (not (= (select (select (store .cse15 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) .cse10) .cse12) |c_ULTIMATE.start_main_~a~0#1.base|)))))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_721 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_718 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse18 (select v_arrayElimArr_21 .cse0))) (let ((.cse22 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_20) .cse18 v_ArrVal_721))) (let ((.cse16 (select (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (.cse19 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_21) .cse18 v_ArrVal_718))) (let ((.cse20 (select (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (.cse21 (+ .cse16 4))) (let ((.cse17 (select (select (store .cse22 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse20) .cse21))) (or (= .cse16 .cse17) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse18) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse17) (= 0 .cse16) (not (= (select v_arrayElimArr_20 .cse0) 0)) (not (= (select (select (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) .cse20) .cse21) |c_ULTIMATE.start_main_~a~0#1.base|))))))))) (forall ((v_arrayElimArr_44 (Array Int Int)) (v_ArrVal_721 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_arrayElimArr_45 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse24 (select v_arrayElimArr_44 .cse0))) (let ((.cse23 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_45) .cse24 v_ArrVal_721) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= 0 .cse23) (not (= (select v_arrayElimArr_45 .cse0) 0)) (= .cse24 (select (let ((.cse25 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_44) .cse24 v_ArrVal_718))) (select (store .cse25 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) (select (select .cse25 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (+ .cse23 4))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse24))))) (forall ((v_ArrVal_721 (Array Int Int)) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse26 (select v_arrayElimArr_12 .cse0))) (let ((.cse28 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_12) .cse26 v_ArrVal_718))) (let ((.cse27 (select (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= |c_ULTIMATE.start_main_~a~0#1.base| .cse26) (= .cse26 .cse27) (= .cse26 (select (select (store .cse28 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) .cse27) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_13) .cse26 v_ArrVal_721) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 4))) (not (= (select v_arrayElimArr_13 .cse0) 0))))))) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_721 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse33 (select v_arrayElimArr_11 .cse0))) (let ((.cse34 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_10) .cse33 v_ArrVal_721))) (let ((.cse32 (select (select .cse34 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (.cse29 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_11) .cse33 v_ArrVal_718))) (let ((.cse30 (select (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (.cse31 (+ .cse32 4))) (or (not (= (select v_arrayElimArr_10 .cse0) 0)) (not (= (select (select (store .cse29 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) .cse30) .cse31) .cse30)) (= 0 .cse32) (= .cse30 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse33) (= .cse32 (select (select (store .cse34 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse30) .cse31)))))))) (or (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (and (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_718 (Array Int Int)) (v_arrayElimArr_31 (Array Int Int)) (v_arrayElimArr_30 (Array Int Int))) (let ((.cse38 (select v_arrayElimArr_31 .cse0))) (let ((.cse35 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_30) .cse38 v_ArrVal_721))) (let ((.cse37 (select (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (.cse36 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_31) .cse38 v_ArrVal_718) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= (select v_arrayElimArr_30 .cse0) 0)) (= 0 (select (select (store .cse35 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse36) (+ .cse37 4))) (= 0 .cse37) (= .cse36 |c_ULTIMATE.start_main_~a~0#1.base|)))))) (forall ((v_ArrVal_721 (Array Int Int)) (v_arrayElimArr_24 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse44 (select v_arrayElimArr_24 .cse0))) (let ((.cse43 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_25) .cse44 v_ArrVal_721))) (let ((.cse39 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_24) .cse44 v_ArrVal_718)) (.cse42 (select (select .cse43 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse41 (+ .cse42 4)) (.cse40 (select (select .cse39 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= (select (select (store .cse39 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) .cse40) .cse41) |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse42 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_arrayElimArr_25 .cse0) 0)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse40) .cse41)) (not (= .cse40 |c_ULTIMATE.start_main_~a~0#1.base|)))))))) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_721 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse50 (select v_arrayElimArr_23 .cse0))) (let ((.cse46 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_22) .cse50 v_ArrVal_721))) (let ((.cse49 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_23) .cse50 v_ArrVal_718)) (.cse45 (select (select .cse46 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse48 (+ .cse45 4)) (.cse47 (select (select .cse49 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse45 (select (select (store .cse46 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse47) .cse48)) (= 0 .cse45) (not (= (select (select (store .cse49 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) .cse47) .cse48) .cse47)) (not (= (select v_arrayElimArr_22 .cse0) 0)) (= .cse47 |c_ULTIMATE.start_main_~a~0#1.base|))))))) (forall ((v_ArrVal_721 (Array Int Int)) (v_arrayElimArr_35 (Array Int Int)) (v_arrayElimArr_34 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse51 (select v_arrayElimArr_34 .cse0))) (let ((.cse52 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_34) .cse51 v_ArrVal_718))) (let ((.cse53 (select (select .cse52 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= (select v_arrayElimArr_35 .cse0) 0)) (= .cse51 (select (select (store .cse52 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) .cse53) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_35) .cse51 v_ArrVal_721) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 4))) (= .cse51 .cse53)))))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse54 (select v_arrayElimArr_26 .cse0))) (let ((.cse56 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_27) .cse54 v_ArrVal_721) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= (select v_arrayElimArr_27 .cse0) 0)) (= .cse54 (select (let ((.cse55 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_26) .cse54 v_ArrVal_718))) (select (store .cse55 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) (select (select .cse55 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (+ .cse56 4))) (= 0 .cse56))))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_arrayElimArr_37 (Array Int Int)) (v_arrayElimArr_36 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse63 (select v_arrayElimArr_37 .cse0))) (let ((.cse62 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_36) .cse63 v_ArrVal_721))) (let ((.cse60 (select (select .cse62 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (.cse57 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_37) .cse63 v_ArrVal_718))) (let ((.cse58 (select (select .cse57 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (.cse59 (+ .cse60 4))) (let ((.cse61 (select (select (store .cse62 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse58) .cse59))) (or (not (= (select v_arrayElimArr_36 .cse0) 0)) (not (= (select (select (store .cse57 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) .cse58) .cse59) |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse60 .cse61) (= 0 .cse60) (= |c_ULTIMATE.start_main_~a~0#1.offset| .cse61)))))))) (forall ((v_arrayElimArr_33 (Array Int Int)) (v_arrayElimArr_32 (Array Int Int)) (v_ArrVal_721 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse66 (select v_arrayElimArr_33 .cse0))) (let ((.cse65 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_33) .cse66 v_ArrVal_718) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= 0 (let ((.cse64 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_32) .cse66 v_ArrVal_721))) (select (select (store .cse64 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse65) (+ (select (select .cse64 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 4)))) (= .cse66 .cse65) (not (= (select v_arrayElimArr_32 .cse0) 0)))))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (v_ArrVal_718 (Array Int Int)) (v_arrayElimArr_29 (Array Int Int))) (let ((.cse69 (select v_arrayElimArr_28 .cse0))) (let ((.cse70 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_28) .cse69 v_ArrVal_718))) (let ((.cse68 (select (select .cse70 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (.cse67 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_29) .cse69 v_ArrVal_721) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= (select v_arrayElimArr_29 .cse0) 0)) (= .cse67 |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= .cse68 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse69 (select (select (store .cse70 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_723) .cse68) (+ .cse67 4)))))))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_arrayElimArr_39 (Array Int Int)) (v_arrayElimArr_38 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse75 (select v_arrayElimArr_39 .cse0))) (let ((.cse74 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_38) .cse75 v_ArrVal_721))) (let ((.cse71 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_39) .cse75 v_ArrVal_718) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (.cse72 (select (select .cse74 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse73 (select (select (store .cse74 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse71) (+ .cse72 4)))) (or (not (= .cse71 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse72 .cse73) (not (= (select v_arrayElimArr_38 .cse0) 0)) (= 0 .cse73) (= .cse72 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_arrayElimArr_15 (Array Int Int)) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (let ((.cse79 (select v_arrayElimArr_15 .cse0))) (let ((.cse80 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_14) .cse79 v_ArrVal_721))) (let ((.cse78 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_15) .cse79 v_ArrVal_718) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (.cse76 (select (select .cse80 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse77 (select (select (store .cse80 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse78) (+ .cse76 4)))) (or (= .cse76 .cse77) (not (= .cse78 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse76 |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse79) (= 0 .cse77) (not (= (select v_arrayElimArr_14 .cse0) 0)))))))) (forall ((v_arrayElimArr_43 (Array Int Int)) (v_ArrVal_721 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_718 (Array Int Int)) (v_arrayElimArr_42 (Array Int Int))) (let ((.cse81 (select v_arrayElimArr_43 .cse0))) (let ((.cse82 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_43) .cse81 v_ArrVal_718) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= .cse81 .cse82) (not (= (select v_arrayElimArr_42 .cse0) 0)) (= 0 (let ((.cse83 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_42) .cse81 v_ArrVal_721))) (select (select (store .cse83 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_724) .cse82) (+ (select (select .cse83 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 4)))) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse81))))))) is different from false [2023-02-15 19:32:39,842 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:39,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 199 treesize of output 169 [2023-02-15 19:32:39,854 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:39,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 140 [2023-02-15 19:32:39,867 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:32:39,922 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:39,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 18308 treesize of output 15630 [2023-02-15 19:32:40,726 INFO L321 Elim1Store]: treesize reduction 465, result has 52.7 percent of original size [2023-02-15 19:32:40,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 66885 treesize of output 62627 [2023-02-15 19:32:41,344 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:41,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 61400 treesize of output 47256 [2023-02-15 19:32:41,708 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:41,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46989 treesize of output 41587 [2023-02-15 19:32:42,080 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:42,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 41716 treesize of output 37574 [2023-02-15 19:32:42,790 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:42,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 13598 treesize of output 12066 [2023-02-15 19:32:43,247 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:43,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 34735 treesize of output 33561 [2023-02-15 19:32:44,092 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:32:44,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 21014 treesize of output 19503 [2023-02-15 19:33:35,948 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:33:35,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 94 [2023-02-15 19:33:35,954 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:33:35,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 84 [2023-02-15 19:33:35,965 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:33:35,967 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:33:35,993 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:33:35,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 461 treesize of output 468 [2023-02-15 19:33:36,002 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:33:36,012 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:33:36,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 577 treesize of output 492 [2023-02-15 19:33:36,028 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:33:36,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 476 treesize of output 356 [2023-02-15 19:33:36,059 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:33:36,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 345 treesize of output 369 [2023-02-15 19:33:36,079 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:33:36,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 266 treesize of output 258 [2023-02-15 19:33:37,404 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 19:33:37,417 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 19:33:37,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 1 [2023-02-15 19:33:37,423 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 19:33:37,428 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 19:33:37,435 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 19:33:37,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 1 [2023-02-15 19:33:37,441 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 19:33:37,445 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 19:33:37,450 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 19:33:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2023-02-15 19:33:37,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61613503] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:33:37,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:33:37,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 44 [2023-02-15 19:33:37,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162780138] [2023-02-15 19:33:37,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:33:37,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-02-15 19:33:37,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:33:37,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-02-15 19:33:37,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1301, Unknown=27, NotChecked=390, Total=1892 [2023-02-15 19:33:37,683 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 44 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 44 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:33:44,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:33:44,455 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2023-02-15 19:33:44,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 19:33:44,469 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 44 states have internal predecessors, (87), 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 35 [2023-02-15 19:33:44,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:33:44,469 INFO L225 Difference]: With dead ends: 97 [2023-02-15 19:33:44,469 INFO L226 Difference]: Without dead ends: 83 [2023-02-15 19:33:44,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=390, Invalid=2795, Unknown=27, NotChecked=570, Total=3782 [2023-02-15 19:33:44,471 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 117 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 370 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:33:44,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 287 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 644 Invalid, 0 Unknown, 370 Unchecked, 2.1s Time] [2023-02-15 19:33:44,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-15 19:33:44,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 68. [2023-02-15 19:33:44,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 67 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) [2023-02-15 19:33:44,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2023-02-15 19:33:44,481 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 35 [2023-02-15 19:33:44,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:33:44,481 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2023-02-15 19:33:44,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 44 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:33:44,481 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2023-02-15 19:33:44,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 19:33:44,482 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:33:44,482 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:33:44,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-15 19:33:44,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:33:44,688 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:33:44,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:33:44,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1641796889, now seen corresponding path program 1 times [2023-02-15 19:33:44,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:33:44,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226883765] [2023-02-15 19:33:44,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:33:44,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:33:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:33:45,540 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:33:45,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:33:45,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226883765] [2023-02-15 19:33:45,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226883765] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:33:45,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479367569] [2023-02-15 19:33:45,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:33:45,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:33:45,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:33:45,542 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 19:33:45,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 19:33:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:33:45,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 86 conjunts are in the unsatisfiable core [2023-02-15 19:33:45,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:33:45,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 19:33:45,741 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:33:45,741 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 21 [2023-02-15 19:33:45,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 19:33:45,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 19:33:45,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:33:45,874 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:33:45,874 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 37 treesize of output 35 [2023-02-15 19:33:45,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:33:45,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-15 19:33:45,926 INFO L321 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2023-02-15 19:33:45,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 19:33:45,969 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:33:45,974 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 19:33:45,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 89 [2023-02-15 19:33:45,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:33:45,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2023-02-15 19:33:45,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 106 [2023-02-15 19:33:46,043 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 19:33:46,044 INFO L350 Elim1Store]: Elim1 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 142 treesize of output 117 [2023-02-15 19:33:46,050 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:33:46,050 INFO L350 Elim1Store]: Elim1 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 127 treesize of output 122 [2023-02-15 19:33:46,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 46 [2023-02-15 19:33:46,155 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:33:46,156 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:33:46,160 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 19:33:46,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 30 [2023-02-15 19:33:46,164 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:33:46,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 14 [2023-02-15 19:33:46,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 19:33:46,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:33:46,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 19:33:46,332 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 19:33:46,333 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:33:46,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:33:46,503 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_840) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 2)) is different from false [2023-02-15 19:33:46,509 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_838 (Array Int Int)) (v_ArrVal_837 (Array Int Int)) (v_ArrVal_839 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_837) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_840) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_839) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_838) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 2)) is different from false [2023-02-15 19:33:46,523 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_838 (Array Int Int)) (v_ArrVal_837 (Array Int Int)) (v_ArrVal_839 (Array Int Int)) (v_ArrVal_835 Int) (v_ArrVal_840 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 v_ArrVal_835)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_837) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_840) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_839) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_838) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 2)) is different from false [2023-02-15 19:33:46,581 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:33:46,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 61 [2023-02-15 19:33:46,593 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:33:46,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2023-02-15 19:33:46,603 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:33:46,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 538 treesize of output 505 [2023-02-15 19:33:46,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 193 [2023-02-15 19:33:46,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 422 treesize of output 350 [2023-02-15 19:33:46,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2023-02-15 19:33:47,258 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:33:47,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-02-15 19:33:47,265 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:33:47,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 69 [2023-02-15 19:33:47,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-02-15 19:33:47,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2023-02-15 19:33:47,333 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:33:47,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2023-02-15 19:33:47,336 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:33:47,342 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:33:47,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2023-02-15 19:33:47,350 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:33:47,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2023-02-15 19:33:47,391 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:33:47,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-02-15 19:33:47,394 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:33:47,401 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:33:47,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-02-15 19:33:47,414 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:33:47,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2023-02-15 19:33:47,430 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:33:47,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2023-02-15 19:33:47,433 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:33:47,440 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:33:47,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2023-02-15 19:33:47,448 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:33:47,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2023-02-15 19:33:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2023-02-15 19:33:49,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479367569] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:33:49,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:33:49,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 16] total 44 [2023-02-15 19:33:49,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328817818] [2023-02-15 19:33:49,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:33:49,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-02-15 19:33:49,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:33:49,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-02-15 19:33:49,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1469, Unknown=16, NotChecked=240, Total=1892 [2023-02-15 19:33:49,759 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 44 states, 44 states have (on average 2.2045454545454546) internal successors, (97), 44 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:33:52,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:33:52,993 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2023-02-15 19:33:52,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 19:33:52,994 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.2045454545454546) internal successors, (97), 44 states have internal predecessors, (97), 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 [2023-02-15 19:33:52,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:33:52,994 INFO L225 Difference]: With dead ends: 99 [2023-02-15 19:33:52,994 INFO L226 Difference]: Without dead ends: 97 [2023-02-15 19:33:52,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=345, Invalid=2621, Unknown=16, NotChecked=324, Total=3306 [2023-02-15 19:33:52,996 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 173 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 36 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 202 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 19:33:52,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 299 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 629 Invalid, 6 Unknown, 202 Unchecked, 0.5s Time] [2023-02-15 19:33:52,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-02-15 19:33:53,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 75. [2023-02-15 19:33:53,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.1216216216216217) internal successors, (83), 74 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) [2023-02-15 19:33:53,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2023-02-15 19:33:53,010 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 36 [2023-02-15 19:33:53,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:33:53,010 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2023-02-15 19:33:53,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.2045454545454546) internal successors, (97), 44 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:33:53,011 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2023-02-15 19:33:53,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 19:33:53,011 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:33:53,011 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:33:53,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-02-15 19:33:53,215 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,SelfDestructingSolverStorable12 [2023-02-15 19:33:53,216 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:33:53,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:33:53,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1513864884, now seen corresponding path program 1 times [2023-02-15 19:33:53,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:33:53,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497316845] [2023-02-15 19:33:53,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:33:53,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:33:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:33:53,822 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 19:33:53,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:33:53,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497316845] [2023-02-15 19:33:53,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497316845] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:33:53,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192600344] [2023-02-15 19:33:53,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:33:53,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:33:53,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:33:53,824 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) [2023-02-15 19:33:53,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 19:33:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:33:53,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-15 19:33:53,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:33:53,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 19:33:53,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 19:33:54,051 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 7 [2023-02-15 19:33:54,054 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 7 [2023-02-15 19:33:54,057 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-15 19:33:54,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:33:54,098 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-15 19:33:54,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192600344] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:33:54,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:33:54,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 6] total 20 [2023-02-15 19:33:54,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823209901] [2023-02-15 19:33:54,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:33:54,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 19:33:54,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:33:54,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 19:33:54,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2023-02-15 19:33:54,100 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 20 states, 20 states have (on average 3.2) internal successors, (64), 20 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) [2023-02-15 19:33:54,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:33:54,411 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2023-02-15 19:33:54,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 19:33:54,412 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.2) internal successors, (64), 20 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) Word has length 38 [2023-02-15 19:33:54,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:33:54,412 INFO L225 Difference]: With dead ends: 91 [2023-02-15 19:33:54,412 INFO L226 Difference]: Without dead ends: 68 [2023-02-15 19:33:54,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2023-02-15 19:33:54,415 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 30 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:33:54,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 153 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:33:54,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-02-15 19:33:54,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2023-02-15 19:33:54,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 60 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 19:33:54,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2023-02-15 19:33:54,425 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 38 [2023-02-15 19:33:54,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:33:54,426 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2023-02-15 19:33:54,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.2) internal successors, (64), 20 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) [2023-02-15 19:33:54,426 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2023-02-15 19:33:54,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 19:33:54,427 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:33:54,427 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:33:54,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 19:33:54,630 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,SelfDestructingSolverStorable13 [2023-02-15 19:33:54,630 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:33:54,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:33:54,631 INFO L85 PathProgramCache]: Analyzing trace with hash 537743857, now seen corresponding path program 3 times [2023-02-15 19:33:54,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:33:54,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712995961] [2023-02-15 19:33:54,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:33:54,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:33:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:33:55,802 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:33:55,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:33:55,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712995961] [2023-02-15 19:33:55,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712995961] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:33:55,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564271294] [2023-02-15 19:33:55,803 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 19:33:55,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:33:55,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:33:55,811 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) [2023-02-15 19:33:55,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 19:33:56,130 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-15 19:33:56,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:33:56,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 117 conjunts are in the unsatisfiable core [2023-02-15 19:33:56,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:33:56,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 19:33:56,234 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:33:56,234 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 21 [2023-02-15 19:33:56,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 19:33:56,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 19:33:56,359 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 19:33:56,359 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 25 treesize of output 29 [2023-02-15 19:33:56,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 19:33:56,378 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:33:56,378 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 37 treesize of output 35 [2023-02-15 19:33:56,425 INFO L321 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2023-02-15 19:33:56,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 19:33:56,487 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:33:56,493 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 19:33:56,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 85 [2023-02-15 19:33:56,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 99 [2023-02-15 19:33:56,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:33:56,589 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 19:33:56,590 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 106 [2023-02-15 19:33:56,605 INFO L321 Elim1Store]: treesize reduction 60, result has 22.1 percent of original size [2023-02-15 19:33:56,605 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 129 treesize of output 116 [2023-02-15 19:33:56,748 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 19:33:56,748 INFO L350 Elim1Store]: Elim1 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 318 treesize of output 253 [2023-02-15 19:33:56,766 INFO L321 Elim1Store]: treesize reduction 92, result has 20.0 percent of original size [2023-02-15 19:33:56,766 INFO L350 Elim1Store]: Elim1 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 303 treesize of output 176 [2023-02-15 19:33:56,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:33:56,776 INFO L350 Elim1Store]: Elim1 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 71 treesize of output 60 [2023-02-15 19:33:56,877 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-15 19:33:56,878 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 125 [2023-02-15 19:33:56,910 INFO L321 Elim1Store]: treesize reduction 42, result has 48.8 percent of original size [2023-02-15 19:33:56,910 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 94 [2023-02-15 19:33:56,927 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 19:33:56,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 34 [2023-02-15 19:33:56,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-02-15 19:33:56,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 19:33:56,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 60 [2023-02-15 19:33:57,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 129 [2023-02-15 19:33:57,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 327 treesize of output 239 [2023-02-15 19:33:58,162 INFO L321 Elim1Store]: treesize reduction 148, result has 41.5 percent of original size [2023-02-15 19:33:58,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 184 treesize of output 255 [2023-02-15 19:33:58,180 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:33:58,181 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 226 treesize of output 173 [2023-02-15 19:33:58,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 156 [2023-02-15 19:33:58,227 INFO L321 Elim1Store]: treesize reduction 60, result has 43.9 percent of original size [2023-02-15 19:33:58,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 126 treesize of output 148 [2023-02-15 19:33:58,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:33:58,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:33:58,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:33:58,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 19:33:58,548 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:33:58,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 325 treesize of output 329 [2023-02-15 19:33:58,988 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:33:58,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 333 treesize of output 337 [2023-02-15 19:34:00,745 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 19:34:00,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 117 [2023-02-15 19:34:00,772 INFO L321 Elim1Store]: treesize reduction 47, result has 29.9 percent of original size [2023-02-15 19:34:00,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 120 treesize of output 94 [2023-02-15 19:34:00,916 INFO L321 Elim1Store]: treesize reduction 18, result has 50.0 percent of original size [2023-02-15 19:34:00,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 64 [2023-02-15 19:34:01,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:34:01,151 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 19:34:01,151 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 19:34:01,269 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 19:34:01,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2023-02-15 19:34:01,272 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:34:01,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:34:01,376 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1107 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))) (or (= 3 .cse0) (= .cse0 1)))) is different from false [2023-02-15 19:34:01,522 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1105 (Array Int Int)) (v_ArrVal_1104 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1106))) (let ((.cse1 (let ((.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (select (select (store .cse0 |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1107) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1105) |c_ULTIMATE.start_main_~p~0#1.base|) .cse2)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1104) |c_ULTIMATE.start_main_~p~0#1.base|) .cse2))))) (or (= 3 (select (select .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= 3 .cse1) (= .cse1 1))))) is different from false [2023-02-15 19:34:01,534 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1105 (Array Int Int)) (v_ArrVal_1104 (Array Int Int))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1106)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5))) (let ((.cse3 (let ((.cse4 (+ .cse2 4))) (select (select (store .cse0 .cse1 v_ArrVal_1107) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1105) .cse1) .cse4)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1104) .cse1) .cse4))))) (or (= 3 (select (select .cse0 .cse1) .cse2)) (= .cse3 1) (= 3 .cse3)))))) is different from false [2023-02-15 19:34:22,900 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1095 Int) (v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1105 (Array Int Int)) (v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1100 (Array Int Int)) (v_ArrVal_1099 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_113| Int)) (let ((.cse10 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse10 |c_ULTIMATE.start_main_~t~0#1.offset|)) |v_ULTIMATE.start_main_~p~0#1.base_113| v_ArrVal_1102)) (.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1099) |v_ULTIMATE.start_main_~p~0#1.base_113| v_ArrVal_1100)) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse1 (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse10 v_ArrVal_1095)))) (store .cse9 |v_ULTIMATE.start_main_~p~0#1.base_113| (store (select .cse9 |v_ULTIMATE.start_main_~p~0#1.base_113|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse2 (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1106)) (.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse0 (let ((.cse6 (+ .cse4 4))) (select (select (store .cse2 .cse3 v_ArrVal_1107) (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1105) .cse3) .cse6)) (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1104) .cse3) .cse6))))) (or (= 3 .cse0) (= 3 (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= 3 (select (select .cse2 .cse3) .cse4)) (= .cse0 1))))))) is different from false [2023-02-15 19:34:22,964 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1095 Int) (v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1105 (Array Int Int)) (v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1100 (Array Int Int)) (v_ArrVal_1099 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_113| Int)) (let ((.cse10 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse10 0)) |v_ULTIMATE.start_main_~p~0#1.base_113| v_ArrVal_1102)) (.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1099) |v_ULTIMATE.start_main_~p~0#1.base_113| v_ArrVal_1100)) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse10 v_ArrVal_1095)))) (store .cse9 |v_ULTIMATE.start_main_~p~0#1.base_113| (store (select .cse9 |v_ULTIMATE.start_main_~p~0#1.base_113|) 0 3))))) (let ((.cse2 (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1106)) (.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse1 (let ((.cse6 (+ .cse4 4))) (select (select (store .cse2 .cse3 v_ArrVal_1107) (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1105) .cse3) .cse6)) (select (select (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1104) .cse3) .cse6))))) (or (= 3 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= 3 .cse1) (= .cse1 1) (= 3 (select (select .cse2 .cse3) .cse4)))))))) is different from false [2023-02-15 19:34:23,044 INFO L321 Elim1Store]: treesize reduction 119, result has 39.6 percent of original size [2023-02-15 19:34:23,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 629 treesize of output 596 [2023-02-15 19:34:23,060 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:34:23,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 276 treesize of output 249 [2023-02-15 19:34:23,251 INFO L321 Elim1Store]: treesize reduction 11, result has 98.4 percent of original size [2023-02-15 19:34:23,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 1215 treesize of output 1666 [2023-02-15 19:34:23,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 893 treesize of output 729 [2023-02-15 19:34:23,310 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:34:23,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 438 treesize of output 401