./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s32if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5317dae 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/array-fpi/s32if.c -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 371b46898ac196d32c6a3ef4c51b315e7fba4a376d0f69ff343a10a3b7c63d98 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 00:32:19,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 00:32:19,016 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 00:32:19,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 00:32:19,050 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 00:32:19,053 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 00:32:19,054 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 00:32:19,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 00:32:19,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 00:32:19,062 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 00:32:19,063 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 00:32:19,064 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 00:32:19,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 00:32:19,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 00:32:19,068 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 00:32:19,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 00:32:19,069 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 00:32:19,071 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 00:32:19,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 00:32:19,076 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 00:32:19,077 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 00:32:19,083 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 00:32:19,084 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 00:32:19,085 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 00:32:19,091 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 00:32:19,092 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 00:32:19,092 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 00:32:19,093 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 00:32:19,094 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 00:32:19,094 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 00:32:19,094 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 00:32:19,095 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 00:32:19,096 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 00:32:19,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 00:32:19,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 00:32:19,099 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 00:32:19,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 00:32:19,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 00:32:19,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 00:32:19,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 00:32:19,109 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 00:32:19,111 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 00:32:19,148 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 00:32:19,148 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 00:32:19,149 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 00:32:19,149 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 00:32:19,150 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 00:32:19,150 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 00:32:19,150 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 00:32:19,150 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 00:32:19,151 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 00:32:19,151 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 00:32:19,151 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 00:32:19,152 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 00:32:19,152 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 00:32:19,152 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 00:32:19,152 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 00:32:19,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 00:32:19,152 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 00:32:19,152 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 00:32:19,153 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 00:32:19,153 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 00:32:19,153 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 00:32:19,153 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 00:32:19,153 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 00:32:19,153 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 00:32:19,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:32:19,154 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 00:32:19,154 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 00:32:19,154 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 00:32:19,154 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 00:32:19,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 00:32:19,154 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 00:32:19,155 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 00:32:19,155 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 00:32:19,164 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 00:32:19,165 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 00:32:19,165 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 -> 371b46898ac196d32c6a3ef4c51b315e7fba4a376d0f69ff343a10a3b7c63d98 [2023-02-16 00:32:19,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 00:32:19,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 00:32:19,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 00:32:19,397 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 00:32:19,397 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 00:32:19,398 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s32if.c [2023-02-16 00:32:20,528 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 00:32:20,684 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 00:32:20,684 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s32if.c [2023-02-16 00:32:20,689 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25b0b8e1c/0dc5087088e74f9786c7a928e16792ba/FLAGfaef86e60 [2023-02-16 00:32:20,699 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25b0b8e1c/0dc5087088e74f9786c7a928e16792ba [2023-02-16 00:32:20,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 00:32:20,702 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 00:32:20,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 00:32:20,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 00:32:20,705 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 00:32:20,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:32:20" (1/1) ... [2023-02-16 00:32:20,707 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35a933da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:32:20, skipping insertion in model container [2023-02-16 00:32:20,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:32:20" (1/1) ... [2023-02-16 00:32:20,712 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 00:32:20,722 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 00:32:20,810 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/array-fpi/s32if.c[588,601] [2023-02-16 00:32:20,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:32:20,830 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 00:32:20,839 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/array-fpi/s32if.c[588,601] [2023-02-16 00:32:20,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:32:20,854 INFO L208 MainTranslator]: Completed translation [2023-02-16 00:32:20,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:32:20 WrapperNode [2023-02-16 00:32:20,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 00:32:20,856 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 00:32:20,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 00:32:20,856 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 00:32:20,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:32:20" (1/1) ... [2023-02-16 00:32:20,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:32:20" (1/1) ... [2023-02-16 00:32:20,887 INFO L138 Inliner]: procedures = 17, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2023-02-16 00:32:20,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 00:32:20,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 00:32:20,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 00:32:20,888 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 00:32:20,895 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:32:20" (1/1) ... [2023-02-16 00:32:20,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:32:20" (1/1) ... [2023-02-16 00:32:20,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:32:20" (1/1) ... [2023-02-16 00:32:20,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:32:20" (1/1) ... [2023-02-16 00:32:20,902 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:32:20" (1/1) ... [2023-02-16 00:32:20,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:32:20" (1/1) ... [2023-02-16 00:32:20,906 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:32:20" (1/1) ... [2023-02-16 00:32:20,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:32:20" (1/1) ... [2023-02-16 00:32:20,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 00:32:20,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 00:32:20,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 00:32:20,911 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 00:32:20,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:32:20" (1/1) ... [2023-02-16 00:32:20,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:32:20,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:32:20,942 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-16 00:32:20,947 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-16 00:32:20,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 00:32:20,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 00:32:20,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 00:32:20,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 00:32:20,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 00:32:20,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 00:32:20,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 00:32:20,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 00:32:20,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 00:32:21,043 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 00:32:21,045 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 00:32:21,162 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 00:32:21,166 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 00:32:21,167 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-16 00:32:21,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:32:21 BoogieIcfgContainer [2023-02-16 00:32:21,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 00:32:21,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 00:32:21,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 00:32:21,172 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 00:32:21,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 12:32:20" (1/3) ... [2023-02-16 00:32:21,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c1af7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:32:21, skipping insertion in model container [2023-02-16 00:32:21,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:32:20" (2/3) ... [2023-02-16 00:32:21,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c1af7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:32:21, skipping insertion in model container [2023-02-16 00:32:21,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:32:21" (3/3) ... [2023-02-16 00:32:21,174 INFO L112 eAbstractionObserver]: Analyzing ICFG s32if.c [2023-02-16 00:32:21,191 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 00:32:21,196 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 00:32:21,238 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 00:32:21,244 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;@7a86f07, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 00:32:21,244 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 00:32:21,248 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:32:21,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-16 00:32:21,254 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:32:21,255 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:32:21,255 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:32:21,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:32:21,259 INFO L85 PathProgramCache]: Analyzing trace with hash -845308063, now seen corresponding path program 1 times [2023-02-16 00:32:21,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:32:21,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035719967] [2023-02-16 00:32:21,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:32:21,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:32:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:32:21,515 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-16 00:32:21,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:32:21,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035719967] [2023-02-16 00:32:21,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035719967] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:32:21,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:32:21,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 00:32:21,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661366688] [2023-02-16 00:32:21,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:32:21,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 00:32:21,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:32:21,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 00:32:21,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 00:32:21,564 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-16 00:32:21,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:32:21,579 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2023-02-16 00:32:21,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 00:32:21,581 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2023-02-16 00:32:21,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:32:21,587 INFO L225 Difference]: With dead ends: 42 [2023-02-16 00:32:21,587 INFO L226 Difference]: Without dead ends: 19 [2023-02-16 00:32:21,590 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-16 00:32:21,595 INFO L413 NwaCegarLoop]: 28 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, 28 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-16 00:32:21,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:32:21,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-02-16 00:32:21,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-02-16 00:32:21,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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-16 00:32:21,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-02-16 00:32:21,623 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 13 [2023-02-16 00:32:21,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:32:21,624 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-02-16 00:32:21,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-16 00:32:21,624 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-02-16 00:32:21,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-16 00:32:21,625 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:32:21,625 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:32:21,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 00:32:21,626 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:32:21,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:32:21,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1238662774, now seen corresponding path program 1 times [2023-02-16 00:32:21,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:32:21,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462413948] [2023-02-16 00:32:21,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:32:21,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:32:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:32:21,785 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-16 00:32:21,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:32:21,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462413948] [2023-02-16 00:32:21,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462413948] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:32:21,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:32:21,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 00:32:21,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969507366] [2023-02-16 00:32:21,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:32:21,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 00:32:21,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:32:21,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 00:32:21,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 00:32:21,790 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-16 00:32:21,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:32:21,836 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2023-02-16 00:32:21,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 00:32:21,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2023-02-16 00:32:21,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:32:21,837 INFO L225 Difference]: With dead ends: 39 [2023-02-16 00:32:21,837 INFO L226 Difference]: Without dead ends: 27 [2023-02-16 00:32:21,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 00:32:21,838 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 35 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:32:21,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 11 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:32:21,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-16 00:32:21,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2023-02-16 00:32:21,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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-16 00:32:21,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-02-16 00:32:21,843 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2023-02-16 00:32:21,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:32:21,843 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-02-16 00:32:21,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-16 00:32:21,844 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-02-16 00:32:21,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-16 00:32:21,844 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:32:21,844 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:32:21,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 00:32:21,845 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:32:21,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:32:21,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1944018757, now seen corresponding path program 1 times [2023-02-16 00:32:21,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:32:21,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264699713] [2023-02-16 00:32:21,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:32:21,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:32:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:32:22,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:32:22,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:32:22,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264699713] [2023-02-16 00:32:22,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264699713] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:32:22,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211911221] [2023-02-16 00:32:22,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:32:22,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:32:22,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:32:22,562 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-16 00:32:22,585 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-16 00:32:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:32:22,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-16 00:32:22,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:32:22,691 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 10 treesize of output 8 [2023-02-16 00:32:22,699 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 11 treesize of output 7 [2023-02-16 00:32:22,726 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-16 00:32:22,785 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-16 00:32:22,831 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 44 treesize of output 27 [2023-02-16 00:32:22,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2023-02-16 00:32:22,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:32:22,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:32:23,155 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:32:23,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-16 00:32:23,159 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:32:23,161 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 26 treesize of output 18 [2023-02-16 00:32:23,164 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 10 [2023-02-16 00:32:23,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:32:23,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211911221] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:32:23,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:32:23,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 22 [2023-02-16 00:32:23,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120430109] [2023-02-16 00:32:23,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:32:23,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-16 00:32:23,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:32:23,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-16 00:32:23,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=370, Unknown=3, NotChecked=0, Total=462 [2023-02-16 00:32:23,175 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 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-16 00:32:23,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:32:23,632 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2023-02-16 00:32:23,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-16 00:32:23,633 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 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 21 [2023-02-16 00:32:23,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:32:23,633 INFO L225 Difference]: With dead ends: 47 [2023-02-16 00:32:23,633 INFO L226 Difference]: Without dead ends: 43 [2023-02-16 00:32:23,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=216, Invalid=772, Unknown=4, NotChecked=0, Total=992 [2023-02-16 00:32:23,635 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 67 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 38 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 00:32:23,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 55 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 249 Invalid, 5 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 00:32:23,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-16 00:32:23,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2023-02-16 00:32:23,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 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-16 00:32:23,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2023-02-16 00:32:23,641 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 21 [2023-02-16 00:32:23,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:32:23,641 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2023-02-16 00:32:23,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 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-16 00:32:23,641 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2023-02-16 00:32:23,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-16 00:32:23,643 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:32:23,643 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:32:23,660 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-16 00:32:23,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:32:23,848 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:32:23,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:32:23,849 INFO L85 PathProgramCache]: Analyzing trace with hash 2001277059, now seen corresponding path program 1 times [2023-02-16 00:32:23,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:32:23,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260381578] [2023-02-16 00:32:23,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:32:23,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:32:23,861 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 00:32:23,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1816941412] [2023-02-16 00:32:23,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:32:23,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:32:23,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:32:23,863 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-16 00:32:23,911 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-16 00:32:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:32:23,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-16 00:32:23,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:32:23,984 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 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-16 00:32:24,024 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-16 00:32:24,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:32:24,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:32:24,091 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 37 treesize of output 31 [2023-02-16 00:32:24,104 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 00:32:24,104 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 38 treesize of output 24 [2023-02-16 00:32:24,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:32:24,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:32:24,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260381578] [2023-02-16 00:32:24,114 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 00:32:24,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816941412] [2023-02-16 00:32:24,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816941412] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:32:24,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:32:24,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-16 00:32:24,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392689873] [2023-02-16 00:32:24,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:32:24,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 00:32:24,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:32:24,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 00:32:24,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-02-16 00:32:24,122 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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-16 00:32:24,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:32:24,233 INFO L93 Difference]: Finished difference Result 75 states and 99 transitions. [2023-02-16 00:32:24,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 00:32:24,233 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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 21 [2023-02-16 00:32:24,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:32:24,234 INFO L225 Difference]: With dead ends: 75 [2023-02-16 00:32:24,234 INFO L226 Difference]: Without dead ends: 63 [2023-02-16 00:32:24,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2023-02-16 00:32:24,235 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 44 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:32:24,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 56 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:32:24,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-16 00:32:24,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 47. [2023-02-16 00:32:24,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 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-16 00:32:24,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2023-02-16 00:32:24,243 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 21 [2023-02-16 00:32:24,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:32:24,244 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2023-02-16 00:32:24,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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-16 00:32:24,244 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2023-02-16 00:32:24,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-16 00:32:24,244 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:32:24,245 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:32:24,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-16 00:32:24,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-16 00:32:24,450 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:32:24,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:32:24,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1592625659, now seen corresponding path program 1 times [2023-02-16 00:32:24,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:32:24,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415716989] [2023-02-16 00:32:24,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:32:24,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:32:24,460 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 00:32:24,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [716818784] [2023-02-16 00:32:24,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:32:24,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:32:24,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:32:24,462 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-16 00:32:24,464 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-16 00:32:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:32:24,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 00:32:24,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:32:24,517 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-16 00:32:24,539 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-16 00:32:24,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:32:24,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:32:24,565 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 14 treesize of output 12 [2023-02-16 00:32:24,567 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 18 treesize of output 16 [2023-02-16 00:32:24,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:32:24,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:32:24,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415716989] [2023-02-16 00:32:24,577 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 00:32:24,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716818784] [2023-02-16 00:32:24,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716818784] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:32:24,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:32:24,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2023-02-16 00:32:24,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630792184] [2023-02-16 00:32:24,578 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:32:24,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 00:32:24,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:32:24,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 00:32:24,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-16 00:32:24,579 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 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-16 00:32:24,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:32:24,643 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2023-02-16 00:32:24,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 00:32:24,644 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 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 21 [2023-02-16 00:32:24,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:32:24,644 INFO L225 Difference]: With dead ends: 78 [2023-02-16 00:32:24,644 INFO L226 Difference]: Without dead ends: 57 [2023-02-16 00:32:24,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-02-16 00:32:24,645 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:32:24,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 51 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:32:24,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-16 00:32:24,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2023-02-16 00:32:24,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 48 states have internal predecessors, (62), 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-16 00:32:24,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2023-02-16 00:32:24,653 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 21 [2023-02-16 00:32:24,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:32:24,653 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2023-02-16 00:32:24,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 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-16 00:32:24,653 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2023-02-16 00:32:24,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-16 00:32:24,654 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:32:24,654 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-16 00:32:24,661 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-16 00:32:24,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:32:24,859 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:32:24,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:32:24,860 INFO L85 PathProgramCache]: Analyzing trace with hash -823792505, now seen corresponding path program 2 times [2023-02-16 00:32:24,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:32:24,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050514272] [2023-02-16 00:32:24,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:32:24,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:32:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:32:24,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:32:24,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:32:24,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050514272] [2023-02-16 00:32:24,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050514272] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:32:24,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959828050] [2023-02-16 00:32:24,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 00:32:24,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:32:24,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:32:24,920 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-16 00:32:24,956 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-16 00:32:24,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 00:32:24,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:32:24,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 00:32:24,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:32:25,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:32:25,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:32:25,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:32:25,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959828050] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:32:25,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:32:25,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-16 00:32:25,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120679587] [2023-02-16 00:32:25,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:32:25,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 00:32:25,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:32:25,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 00:32:25,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-16 00:32:25,058 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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-16 00:32:25,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:32:25,186 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2023-02-16 00:32:25,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 00:32:25,187 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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-16 00:32:25,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:32:25,187 INFO L225 Difference]: With dead ends: 85 [2023-02-16 00:32:25,188 INFO L226 Difference]: Without dead ends: 75 [2023-02-16 00:32:25,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-02-16 00:32:25,188 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 56 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:32:25,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 28 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:32:25,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-16 00:32:25,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2023-02-16 00:32:25,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 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-16 00:32:25,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2023-02-16 00:32:25,204 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 23 [2023-02-16 00:32:25,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:32:25,204 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2023-02-16 00:32:25,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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-16 00:32:25,205 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2023-02-16 00:32:25,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-16 00:32:25,205 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:32:25,205 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] [2023-02-16 00:32:25,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-16 00:32:25,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:32:25,411 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:32:25,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:32:25,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1832157868, now seen corresponding path program 3 times [2023-02-16 00:32:25,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:32:25,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912773301] [2023-02-16 00:32:25,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:32:25,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:32:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:32:25,471 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:32:25,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:32:25,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912773301] [2023-02-16 00:32:25,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912773301] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:32:25,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185356933] [2023-02-16 00:32:25,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 00:32:25,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:32:25,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:32:25,473 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-16 00:32:25,509 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-16 00:32:25,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-16 00:32:25,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:32:25,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 00:32:25,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:32:25,568 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:32:25,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:32:25,603 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:32:25,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185356933] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:32:25,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:32:25,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-16 00:32:25,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418947629] [2023-02-16 00:32:25,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:32:25,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 00:32:25,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:32:25,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 00:32:25,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-16 00:32:25,605 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 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-16 00:32:25,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:32:25,686 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2023-02-16 00:32:25,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 00:32:25,687 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 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) Word has length 24 [2023-02-16 00:32:25,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:32:25,687 INFO L225 Difference]: With dead ends: 78 [2023-02-16 00:32:25,687 INFO L226 Difference]: Without dead ends: 42 [2023-02-16 00:32:25,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-02-16 00:32:25,688 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 27 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:32:25,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 26 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:32:25,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-02-16 00:32:25,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2023-02-16 00:32:25,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 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-16 00:32:25,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2023-02-16 00:32:25,693 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 24 [2023-02-16 00:32:25,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:32:25,694 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2023-02-16 00:32:25,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 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-16 00:32:25,694 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2023-02-16 00:32:25,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 00:32:25,694 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:32:25,695 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:32:25,711 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-16 00:32:25,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:32:25,900 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:32:25,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:32:25,900 INFO L85 PathProgramCache]: Analyzing trace with hash -14433298, now seen corresponding path program 4 times [2023-02-16 00:32:25,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:32:25,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678521067] [2023-02-16 00:32:25,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:32:25,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:32:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:32:26,399 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 00:32:26,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:32:26,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678521067] [2023-02-16 00:32:26,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678521067] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:32:26,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170473296] [2023-02-16 00:32:26,400 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 00:32:26,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:32:26,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:32:26,401 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-16 00:32:26,404 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-16 00:32:26,453 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 00:32:26,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:32:26,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 43 conjunts are in the unsatisfiable core [2023-02-16 00:32:26,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:32:26,461 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-16 00:32:26,465 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 10 treesize of output 8 [2023-02-16 00:32:26,482 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-16 00:32:26,506 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-16 00:32:26,577 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-16 00:32:26,616 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-16 00:32:26,666 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 44 treesize of output 27 [2023-02-16 00:32:26,729 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 00:32:26,729 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 1 case distinctions, treesize of input 59 treesize of output 41 [2023-02-16 00:32:26,814 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 00:32:26,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 28 [2023-02-16 00:32:26,838 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:32:26,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:32:27,119 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_209 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_64| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_209))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_209 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_64| 4))))) (or (not (= 4 .cse0)) (not (= 4 .cse1)) (= (+ .cse2 .cse0 .cse1) (* 4 c_~N~0)))))))) is different from false [2023-02-16 00:32:27,767 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-02-16 00:32:27,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170473296] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:32:27,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:32:27,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 38 [2023-02-16 00:32:27,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462399422] [2023-02-16 00:32:27,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:32:27,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-16 00:32:27,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:32:27,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-16 00:32:27,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1170, Unknown=22, NotChecked=70, Total=1406 [2023-02-16 00:32:27,769 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 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-16 00:32:29,518 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (< |c_ULTIMATE.start_main_~i~0#1| 2)) (.cse0 (* 4 c_~N~0))) (and (= 8 .cse0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (exists ((|ULTIMATE.start_main_~i~0#1| Int)) (= (select .cse1 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse2)) (= 4 .cse2) (= |c_ULTIMATE.start_main_#t~mem12#1| (select .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (or .cse3 (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_209 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (|v_ULTIMATE.start_main_~i~0#1_64| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_209))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select v_ArrVal_209 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 4))))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_64| 4))))) (or (< (* 4 |c_ULTIMATE.start_main_~i~0#1|) (+ .cse4 .cse5 .cse6 1)) (not (= 4 .cse5)) (not (= 4 .cse6))))))))) (or .cse3 (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_209 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (|v_ULTIMATE.start_main_~i~0#1_64| Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_209))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse11 (select v_ArrVal_209 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 4))))) (let ((.cse9 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_64| 4))))) (or (not (= 4 .cse9)) (< (+ .cse10 .cse9 .cse11) 9) (not (= 4 .cse11))))))))) (or (< c_~N~0 2) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_209 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (|v_ULTIMATE.start_main_~i~0#1_64| Int)) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_209))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse14 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse16 (select v_ArrVal_209 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 4))))) (let ((.cse15 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_64| 4))))) (or (= (+ .cse14 .cse15 .cse16) .cse0) (not (= 4 .cse15)) (not (= 4 .cse16))))))))) (or (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_209 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_64| Int)) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_209))) (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse21 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse19 (select v_ArrVal_209 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse20 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_64| 4))))) (or (not (= 4 .cse19)) (not (= 4 .cse20)) (= (+ .cse21 .cse19 .cse20) .cse0)))))))))) is different from false [2023-02-16 00:32:29,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:32:29,749 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2023-02-16 00:32:29,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-16 00:32:29,750 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 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-16 00:32:29,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:32:29,751 INFO L225 Difference]: With dead ends: 83 [2023-02-16 00:32:29,751 INFO L226 Difference]: Without dead ends: 79 [2023-02-16 00:32:29,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=442, Invalid=2844, Unknown=28, NotChecked=226, Total=3540 [2023-02-16 00:32:29,753 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 58 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 87 mSolverCounterUnsat, 38 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 38 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-16 00:32:29,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 145 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 835 Invalid, 38 Unknown, 111 Unchecked, 0.8s Time] [2023-02-16 00:32:29,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-16 00:32:29,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 65. [2023-02-16 00:32:29,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 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-16 00:32:29,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2023-02-16 00:32:29,766 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 29 [2023-02-16 00:32:29,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:32:29,767 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2023-02-16 00:32:29,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 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-16 00:32:29,768 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2023-02-16 00:32:29,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 00:32:29,768 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:32:29,768 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:32:29,774 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-16 00:32:29,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:32:29,974 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:32:29,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:32:29,975 INFO L85 PathProgramCache]: Analyzing trace with hash 42825004, now seen corresponding path program 1 times [2023-02-16 00:32:29,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:32:29,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231008190] [2023-02-16 00:32:29,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:32:29,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:32:29,984 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 00:32:29,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [22598583] [2023-02-16 00:32:29,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:32:29,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:32:29,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:32:30,003 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-16 00:32:30,029 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-16 00:32:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:32:30,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-16 00:32:30,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:32:30,123 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 0 case distinctions, treesize of input 31 treesize of output 15 [2023-02-16 00:32:30,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:32:30,170 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 16 treesize of output 18 [2023-02-16 00:32:30,199 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-16 00:32:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 00:32:30,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:32:30,237 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_254 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4)))) is different from false [2023-02-16 00:32:30,243 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_254 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2023-02-16 00:32:30,273 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:32:30,273 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 47 treesize of output 31 [2023-02-16 00:32:30,278 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:32:30,279 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 38 treesize of output 34 [2023-02-16 00:32:30,281 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-16 00:32:30,320 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2023-02-16 00:32:30,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:32:30,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231008190] [2023-02-16 00:32:30,321 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 00:32:30,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22598583] [2023-02-16 00:32:30,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22598583] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:32:30,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:32:30,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2023-02-16 00:32:30,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973229995] [2023-02-16 00:32:30,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:32:30,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-16 00:32:30,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:32:30,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-16 00:32:30,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=217, Unknown=2, NotChecked=62, Total=342 [2023-02-16 00:32:30,325 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 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-16 00:32:30,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:32:30,634 INFO L93 Difference]: Finished difference Result 114 states and 143 transitions. [2023-02-16 00:32:30,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 00:32:30,635 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 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-16 00:32:30,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:32:30,635 INFO L225 Difference]: With dead ends: 114 [2023-02-16 00:32:30,635 INFO L226 Difference]: Without dead ends: 107 [2023-02-16 00:32:30,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=330, Unknown=2, NotChecked=78, Total=506 [2023-02-16 00:32:30,636 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 63 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 00:32:30,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 89 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 334 Invalid, 0 Unknown, 119 Unchecked, 0.2s Time] [2023-02-16 00:32:30,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-16 00:32:30,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 71. [2023-02-16 00:32:30,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 70 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-16 00:32:30,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2023-02-16 00:32:30,652 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 29 [2023-02-16 00:32:30,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:32:30,652 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2023-02-16 00:32:30,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 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-16 00:32:30,653 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2023-02-16 00:32:30,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 00:32:30,657 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:32:30,657 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:32:30,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-16 00:32:30,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:32:30,862 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:32:30,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:32:30,863 INFO L85 PathProgramCache]: Analyzing trace with hash -968292246, now seen corresponding path program 1 times [2023-02-16 00:32:30,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:32:30,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112141277] [2023-02-16 00:32:30,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:32:30,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:32:30,874 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 00:32:30,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1557450887] [2023-02-16 00:32:30,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:32:30,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:32:30,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:32:30,878 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-16 00:32:30,909 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-16 00:32:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:32:30,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-16 00:32:30,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:32:30,990 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-16 00:32:31,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:32:31,017 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 24 [2023-02-16 00:32:31,045 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-16 00:32:31,052 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 00:32:31,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:32:31,090 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 16 treesize of output 14 [2023-02-16 00:32:31,092 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 20 treesize of output 16 [2023-02-16 00:32:31,111 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 00:32:31,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:32:31,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112141277] [2023-02-16 00:32:31,112 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 00:32:31,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557450887] [2023-02-16 00:32:31,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557450887] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:32:31,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:32:31,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-02-16 00:32:31,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867863123] [2023-02-16 00:32:31,112 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:32:31,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-16 00:32:31,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:32:31,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-16 00:32:31,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-02-16 00:32:31,113 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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-16 00:32:31,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:32:31,232 INFO L93 Difference]: Finished difference Result 115 states and 148 transitions. [2023-02-16 00:32:31,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 00:32:31,232 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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-16 00:32:31,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:32:31,233 INFO L225 Difference]: With dead ends: 115 [2023-02-16 00:32:31,233 INFO L226 Difference]: Without dead ends: 84 [2023-02-16 00:32:31,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2023-02-16 00:32:31,234 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:32:31,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 70 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:32:31,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-16 00:32:31,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 73. [2023-02-16 00:32:31,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.25) internal successors, (90), 72 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:32:31,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2023-02-16 00:32:31,243 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 29 [2023-02-16 00:32:31,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:32:31,243 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2023-02-16 00:32:31,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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-16 00:32:31,244 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2023-02-16 00:32:31,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 00:32:31,244 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:32:31,244 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] [2023-02-16 00:32:31,249 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-16 00:32:31,444 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,SelfDestructingSolverStorable9 [2023-02-16 00:32:31,447 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:32:31,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:32:31,448 INFO L85 PathProgramCache]: Analyzing trace with hash -554569936, now seen corresponding path program 5 times [2023-02-16 00:32:31,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:32:31,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940712989] [2023-02-16 00:32:31,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:32:31,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:32:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:32:31,531 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 00:32:31,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:32:31,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940712989] [2023-02-16 00:32:31,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940712989] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:32:31,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961172533] [2023-02-16 00:32:31,532 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-16 00:32:31,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:32:31,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:32:31,533 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-16 00:32:31,536 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-16 00:32:31,592 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-02-16 00:32:31,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:32:31,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 00:32:31,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:32:31,644 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 00:32:31,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:32:31,685 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 00:32:31,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961172533] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:32:31,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:32:31,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-02-16 00:32:31,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149799088] [2023-02-16 00:32:31,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:32:31,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 00:32:31,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:32:31,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 00:32:31,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-02-16 00:32:31,687 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 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-16 00:32:31,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:32:31,883 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2023-02-16 00:32:31,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 00:32:31,883 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-16 00:32:31,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:32:31,884 INFO L225 Difference]: With dead ends: 121 [2023-02-16 00:32:31,884 INFO L226 Difference]: Without dead ends: 108 [2023-02-16 00:32:31,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2023-02-16 00:32:31,885 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 71 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:32:31,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 36 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:32:31,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-16 00:32:31,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 75. [2023-02-16 00:32:31,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 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-16 00:32:31,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2023-02-16 00:32:31,894 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 31 [2023-02-16 00:32:31,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:32:31,895 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2023-02-16 00:32:31,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 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-16 00:32:31,895 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2023-02-16 00:32:31,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-16 00:32:31,895 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:32:31,895 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:32:31,901 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-16 00:32:32,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:32:32,101 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:32:32,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:32:32,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1053387787, now seen corresponding path program 6 times [2023-02-16 00:32:32,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:32:32,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763082566] [2023-02-16 00:32:32,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:32:32,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:32:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:32:32,174 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 00:32:32,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:32:32,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763082566] [2023-02-16 00:32:32,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763082566] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:32:32,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315030510] [2023-02-16 00:32:32,174 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-16 00:32:32,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:32:32,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:32:32,176 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-16 00:32:32,178 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-16 00:32:32,235 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-02-16 00:32:32,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:32:32,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 00:32:32,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:32:32,293 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 00:32:32,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:32:32,338 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 00:32:32,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315030510] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:32:32,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:32:32,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-02-16 00:32:32,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165104650] [2023-02-16 00:32:32,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:32:32,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 00:32:32,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:32:32,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 00:32:32,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-02-16 00:32:32,339 INFO L87 Difference]: Start difference. First operand 75 states and 94 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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-16 00:32:32,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:32:32,445 INFO L93 Difference]: Finished difference Result 109 states and 133 transitions. [2023-02-16 00:32:32,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 00:32:32,446 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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-16 00:32:32,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:32:32,446 INFO L225 Difference]: With dead ends: 109 [2023-02-16 00:32:32,446 INFO L226 Difference]: Without dead ends: 53 [2023-02-16 00:32:32,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-02-16 00:32:32,447 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 35 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:32:32,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 35 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:32:32,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-16 00:32:32,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2023-02-16 00:32:32,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 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-16 00:32:32,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2023-02-16 00:32:32,453 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 32 [2023-02-16 00:32:32,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:32:32,453 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2023-02-16 00:32:32,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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-16 00:32:32,453 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2023-02-16 00:32:32,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 00:32:32,453 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:32:32,453 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:32:32,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-02-16 00:32:32,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-16 00:32:32,676 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:32:32,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:32:32,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1383779305, now seen corresponding path program 7 times [2023-02-16 00:32:32,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:32:32,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63628416] [2023-02-16 00:32:32,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:32:32,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:32:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:32:33,417 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 00:32:33,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:32:33,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63628416] [2023-02-16 00:32:33,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63628416] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:32:33,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975019038] [2023-02-16 00:32:33,418 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-16 00:32:33,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:32:33,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:32:33,420 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:32:33,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-16 00:32:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:32:33,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 55 conjunts are in the unsatisfiable core [2023-02-16 00:32:33,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:32:33,487 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-16 00:32:33,491 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 10 treesize of output 8 [2023-02-16 00:32:33,502 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-16 00:32:33,529 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-16 00:32:33,560 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-16 00:32:33,629 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-16 00:32:33,651 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-16 00:32:33,669 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-16 00:32:33,713 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 44 treesize of output 27 [2023-02-16 00:32:33,813 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 00:32:33,813 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 1 case distinctions, treesize of input 63 treesize of output 41 [2023-02-16 00:32:33,915 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 00:32:33,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 1 case distinctions, treesize of input 55 treesize of output 41 [2023-02-16 00:32:34,006 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 00:32:34,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 26 [2023-02-16 00:32:34,036 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 00:32:34,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:32:34,501 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_132| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_130| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_439))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_439 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_132| 4))))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_130| 4))))) (or (not (= 4 .cse0)) (= (+ .cse1 .cse2 .cse0 .cse3) (* 4 c_~N~0)) (not (= 4 .cse2)) (not (= 4 .cse3))))))))) is different from false [2023-02-16 00:32:34,919 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int)) (let ((.cse0 (select v_ArrVal_439 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_139| 4))))) (or (not (= 4 .cse0)) (forall ((|v_ULTIMATE.start_main_~i~0#1_132| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_439))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_132| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_130| Int)) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_130| 4))))) (or (< (+ .cse1 3) (+ .cse2 .cse3 .cse4 .cse0)) (not (= 4 .cse4))))) (not (= 4 .cse2))))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int)) (let ((.cse7 (select v_ArrVal_439 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_139| 4))))) (or (not (= 4 .cse7)) (forall ((|v_ULTIMATE.start_main_~i~0#1_132| Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_439))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_132| 4))))) (or (not (= 4 .cse8)) (forall ((|v_ULTIMATE.start_main_~i~0#1_130| Int)) (let ((.cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_130| 4))))) (or (< (+ .cse8 .cse9 .cse10 .cse7) (+ .cse1 5)) (not (= 4 .cse10)))))))))))))))) is different from false [2023-02-16 00:32:34,954 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int)) (let ((.cse0 (select v_ArrVal_439 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_139| 4))))) (or (not (= 4 .cse0)) (forall ((|v_ULTIMATE.start_main_~i~0#1_132| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_439))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_132| 4))))) (or (not (= 4 .cse1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_130| Int)) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_130| 4))))) (or (< (+ .cse2 7) (+ .cse1 .cse3 .cse4 .cse0)) (not (= 4 .cse4)))))))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int)) (let ((.cse7 (select v_ArrVal_439 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_139| 4))))) (or (not (= 4 .cse7)) (forall ((|v_ULTIMATE.start_main_~i~0#1_132| Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_439))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_132| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_130| Int)) (let ((.cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_130| 4))))) (or (< (+ .cse8 .cse9 .cse10 .cse7) (+ .cse2 9)) (not (= 4 .cse10))))) (not (= 4 .cse8))))))))))))) is different from false [2023-02-16 00:32:35,022 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* 4 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int)) (let ((.cse0 (select v_ArrVal_439 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_139| 4))))) (or (not (= 4 .cse0)) (forall ((|v_ULTIMATE.start_main_~i~0#1_132| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_439))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_132| 4))))) (or (not (= 4 .cse1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_130| Int)) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_130| 4))))) (or (< (+ .cse1 .cse2 .cse3 .cse0) (+ .cse4 13)) (not (= 4 .cse3)))))))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int)) (let ((.cse7 (select v_ArrVal_439 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_139| 4))))) (or (not (= 4 .cse7)) (forall ((|v_ULTIMATE.start_main_~i~0#1_132| Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_439))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_132| 4))))) (or (not (= 4 .cse8)) (forall ((|v_ULTIMATE.start_main_~i~0#1_130| Int)) (let ((.cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_130| 4))))) (or (< (+ .cse4 11) (+ .cse8 .cse9 .cse10 .cse7)) (not (= 4 .cse10)))))))))))))))) is different from false [2023-02-16 00:32:35,066 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 14 not checked. [2023-02-16 00:32:35,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975019038] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:32:35,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:32:35,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 16] total 43 [2023-02-16 00:32:35,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074425766] [2023-02-16 00:32:35,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:32:35,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-02-16 00:32:35,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:32:35,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-02-16 00:32:35,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1341, Unknown=5, NotChecked=308, Total=1806 [2023-02-16 00:32:35,069 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 43 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 43 states have internal predecessors, (80), 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-16 00:32:42,437 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-16 00:32:44,615 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-16 00:32:46,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2023-02-16 00:32:48,917 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-16 00:32:50,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=true, quantifiers [0, 1] [2023-02-16 00:32:53,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:32:53,551 INFO L93 Difference]: Finished difference Result 130 states and 154 transitions. [2023-02-16 00:32:53,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-02-16 00:32:53,551 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 43 states have internal predecessors, (80), 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 37 [2023-02-16 00:32:53,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:32:53,552 INFO L225 Difference]: With dead ends: 130 [2023-02-16 00:32:53,552 INFO L226 Difference]: Without dead ends: 126 [2023-02-16 00:32:53,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 53 SyntacticMatches, 10 SemanticMatches, 67 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1110 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=510, Invalid=3652, Unknown=14, NotChecked=516, Total=4692 [2023-02-16 00:32:53,554 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 110 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 142 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 1758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 322 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:32:53,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 272 Invalid, 1758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1281 Invalid, 13 Unknown, 322 Unchecked, 11.0s Time] [2023-02-16 00:32:53,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-16 00:32:53,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 93. [2023-02-16 00:32:53,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.25) internal successors, (115), 92 states have internal predecessors, (115), 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-16 00:32:53,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2023-02-16 00:32:53,579 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 115 transitions. Word has length 37 [2023-02-16 00:32:53,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:32:53,580 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 115 transitions. [2023-02-16 00:32:53,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 43 states have internal predecessors, (80), 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-16 00:32:53,580 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2023-02-16 00:32:53,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 00:32:53,580 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:32:53,580 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:32:53,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-16 00:32:53,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-16 00:32:53,787 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:32:53,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:32:53,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1441037607, now seen corresponding path program 2 times [2023-02-16 00:32:53,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:32:53,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273303298] [2023-02-16 00:32:53,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:32:53,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:32:53,798 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 00:32:53,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1975610047] [2023-02-16 00:32:53,799 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 00:32:53,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:32:53,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:32:53,815 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:32:53,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-16 00:32:53,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 00:32:53,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:32:53,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-16 00:32:53,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:32:53,994 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 0 case distinctions, treesize of input 31 treesize of output 15 [2023-02-16 00:32:54,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:32:54,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-16 00:32:54,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:32:54,071 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 16 treesize of output 18 [2023-02-16 00:32:54,106 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:32:54,106 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 21 treesize of output 17 [2023-02-16 00:32:54,155 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:32:54,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:32:58,938 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:32:58,939 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 49 treesize of output 33 [2023-02-16 00:32:58,945 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:32:58,946 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 42 treesize of output 38 [2023-02-16 00:32:58,949 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 13 treesize of output 7 [2023-02-16 00:32:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:32:59,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:32:59,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273303298] [2023-02-16 00:32:59,179 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 00:32:59,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975610047] [2023-02-16 00:32:59,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975610047] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:32:59,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:32:59,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2023-02-16 00:32:59,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770161518] [2023-02-16 00:32:59,179 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:32:59,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-16 00:32:59,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:32:59,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-16 00:32:59,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=911, Unknown=10, NotChecked=0, Total=1122 [2023-02-16 00:32:59,180 INFO L87 Difference]: Start difference. First operand 93 states and 115 transitions. Second operand has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:33:02,753 WARN L837 $PredicateComparison]: unable to prove that (and (<= (+ |c_ULTIMATE.start_main_~a~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_499 (Array Int Int))) (or (< 2 |v_ULTIMATE.start_main_~i~0#1_151|) (< (+ |v_ULTIMATE.start_main_~i~0#1_151| 1) c_~N~0) (= 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 3)))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_151| 4)))))) (not (= 1 |c_ULTIMATE.start_main_#t~mem8#1|))) (<= 3 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_499 (Array Int Int))) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) |v_ULTIMATE.start_main_~i~0#1_151|) (< (+ |v_ULTIMATE.start_main_~i~0#1_151| 1) c_~N~0) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_151| 4)))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_499 (Array Int Int))) (or (< 2 |v_ULTIMATE.start_main_~i~0#1_151|) (< (+ |v_ULTIMATE.start_main_~i~0#1_151| 1) c_~N~0) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_151| 4)))))) (= |c_ULTIMATE.start_main_~i~0#1| 0)) is different from false [2023-02-16 00:33:26,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:33:26,351 INFO L93 Difference]: Finished difference Result 266 states and 346 transitions. [2023-02-16 00:33:26,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-02-16 00:33:26,351 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-16 00:33:26,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:33:26,352 INFO L225 Difference]: With dead ends: 266 [2023-02-16 00:33:26,352 INFO L226 Difference]: Without dead ends: 259 [2023-02-16 00:33:26,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 31.5s TimeCoverageRelationStatistics Valid=680, Invalid=2724, Unknown=22, NotChecked=114, Total=3540 [2023-02-16 00:33:26,353 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 292 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 110 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 00:33:26,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 94 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 779 Invalid, 15 Unknown, 1 Unchecked, 0.6s Time] [2023-02-16 00:33:26,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2023-02-16 00:33:26,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 148. [2023-02-16 00:33:26,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.2993197278911566) internal successors, (191), 147 states have internal predecessors, (191), 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-16 00:33:26,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 191 transitions. [2023-02-16 00:33:26,379 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 191 transitions. Word has length 37 [2023-02-16 00:33:26,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:33:26,379 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 191 transitions. [2023-02-16 00:33:26,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:33:26,380 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 191 transitions. [2023-02-16 00:33:26,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 00:33:26,382 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:33:26,382 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:33:26,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-16 00:33:26,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-16 00:33:26,588 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:33:26,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:33:26,588 INFO L85 PathProgramCache]: Analyzing trace with hash -147310295, now seen corresponding path program 2 times [2023-02-16 00:33:26,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:33:26,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675447956] [2023-02-16 00:33:26,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:33:26,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:33:26,596 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 00:33:26,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1850630368] [2023-02-16 00:33:26,597 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 00:33:26,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:33:26,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:33:26,619 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:33:26,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-16 00:33:26,686 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 00:33:26,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:33:26,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-16 00:33:26,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:33:26,718 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-16 00:33:26,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:33:26,755 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 24 [2023-02-16 00:33:26,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:33:26,779 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 24 [2023-02-16 00:33:26,796 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-16 00:33:26,804 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 00:33:26,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:33:26,854 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 16 treesize of output 14 [2023-02-16 00:33:26,858 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 20 treesize of output 16 [2023-02-16 00:33:26,908 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 00:33:26,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:33:26,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675447956] [2023-02-16 00:33:26,909 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 00:33:26,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850630368] [2023-02-16 00:33:26,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850630368] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:33:26,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:33:26,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2023-02-16 00:33:26,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281021833] [2023-02-16 00:33:26,910 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:33:26,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-16 00:33:26,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:33:26,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-16 00:33:26,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-02-16 00:33:26,912 INFO L87 Difference]: Start difference. First operand 148 states and 191 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 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-16 00:33:27,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:33:27,150 INFO L93 Difference]: Finished difference Result 258 states and 341 transitions. [2023-02-16 00:33:27,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-16 00:33:27,156 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 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 37 [2023-02-16 00:33:27,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:33:27,157 INFO L225 Difference]: With dead ends: 258 [2023-02-16 00:33:27,157 INFO L226 Difference]: Without dead ends: 178 [2023-02-16 00:33:27,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2023-02-16 00:33:27,162 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 00:33:27,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 73 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 00:33:27,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-02-16 00:33:27,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 148. [2023-02-16 00:33:27,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.2857142857142858) internal successors, (189), 147 states have internal predecessors, (189), 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-16 00:33:27,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 189 transitions. [2023-02-16 00:33:27,191 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 189 transitions. Word has length 37 [2023-02-16 00:33:27,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:33:27,192 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 189 transitions. [2023-02-16 00:33:27,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 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-16 00:33:27,192 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 189 transitions. [2023-02-16 00:33:27,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-16 00:33:27,193 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:33:27,193 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:33:27,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-02-16 00:33:27,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-16 00:33:27,398 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:33:27,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:33:27,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1016239403, now seen corresponding path program 8 times [2023-02-16 00:33:27,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:33:27,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591597722] [2023-02-16 00:33:27,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:33:27,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:33:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:33:27,511 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 00:33:27,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:33:27,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591597722] [2023-02-16 00:33:27,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591597722] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:33:27,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159454855] [2023-02-16 00:33:27,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 00:33:27,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:33:27,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:33:27,535 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:33:27,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-16 00:33:27,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 00:33:27,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:33:27,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-16 00:33:27,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:33:27,690 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 00:33:27,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:33:27,777 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 00:33:27,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159454855] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:33:27,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:33:27,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-02-16 00:33:27,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106172448] [2023-02-16 00:33:27,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:33:27,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-16 00:33:27,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:33:27,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-16 00:33:27,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-02-16 00:33:27,779 INFO L87 Difference]: Start difference. First operand 148 states and 189 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 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-16 00:33:28,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:33:28,104 INFO L93 Difference]: Finished difference Result 203 states and 262 transitions. [2023-02-16 00:33:28,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-16 00:33:28,105 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 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 39 [2023-02-16 00:33:28,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:33:28,106 INFO L225 Difference]: With dead ends: 203 [2023-02-16 00:33:28,106 INFO L226 Difference]: Without dead ends: 187 [2023-02-16 00:33:28,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 64 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2023-02-16 00:33:28,107 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 105 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 00:33:28,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 25 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 00:33:28,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-02-16 00:33:28,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 108. [2023-02-16 00:33:28,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.2429906542056075) internal successors, (133), 107 states have internal predecessors, (133), 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-16 00:33:28,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 133 transitions. [2023-02-16 00:33:28,130 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 133 transitions. Word has length 39 [2023-02-16 00:33:28,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:33:28,130 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 133 transitions. [2023-02-16 00:33:28,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 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-16 00:33:28,131 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 133 transitions. [2023-02-16 00:33:28,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-16 00:33:28,131 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:33:28,131 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:33:28,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-16 00:33:28,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:33:28,337 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:33:28,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:33:28,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1682760144, now seen corresponding path program 9 times [2023-02-16 00:33:28,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:33:28,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755115674] [2023-02-16 00:33:28,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:33:28,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:33:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:33:28,444 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 00:33:28,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:33:28,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755115674] [2023-02-16 00:33:28,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755115674] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:33:28,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875861096] [2023-02-16 00:33:28,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 00:33:28,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:33:28,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:33:28,446 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:33:28,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-16 00:33:28,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-16 00:33:28,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:33:28,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-16 00:33:28,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:33:28,626 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 00:33:28,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:33:28,694 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 00:33:28,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875861096] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:33:28,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:33:28,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-02-16 00:33:28,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591012041] [2023-02-16 00:33:28,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:33:28,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-16 00:33:28,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:33:28,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-16 00:33:28,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-02-16 00:33:28,695 INFO L87 Difference]: Start difference. First operand 108 states and 133 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:33:28,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:33:28,841 INFO L93 Difference]: Finished difference Result 137 states and 167 transitions. [2023-02-16 00:33:28,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 00:33:28,842 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-02-16 00:33:28,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:33:28,842 INFO L225 Difference]: With dead ends: 137 [2023-02-16 00:33:28,842 INFO L226 Difference]: Without dead ends: 61 [2023-02-16 00:33:28,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 66 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2023-02-16 00:33:28,843 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 84 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:33:28,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 29 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:33:28,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-02-16 00:33:28,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2023-02-16 00:33:28,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 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-16 00:33:28,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2023-02-16 00:33:28,853 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 40 [2023-02-16 00:33:28,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:33:28,853 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2023-02-16 00:33:28,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:33:28,854 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2023-02-16 00:33:28,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-16 00:33:28,854 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:33:28,854 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:33:28,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-16 00:33:29,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-16 00:33:29,060 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:33:29,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:33:29,060 INFO L85 PathProgramCache]: Analyzing trace with hash -2111860654, now seen corresponding path program 10 times [2023-02-16 00:33:29,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:33:29,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722548796] [2023-02-16 00:33:29,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:33:29,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:33:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:33:30,759 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-16 00:33:30,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:33:30,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722548796] [2023-02-16 00:33:30,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722548796] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:33:30,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105638295] [2023-02-16 00:33:30,760 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 00:33:30,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:33:30,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:33:30,761 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:33:30,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-16 00:33:30,845 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 00:33:30,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:33:30,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 67 conjunts are in the unsatisfiable core [2023-02-16 00:33:30,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:33:30,853 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 10 treesize of output 8 [2023-02-16 00:33:30,856 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 11 treesize of output 7 [2023-02-16 00:33:30,910 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-16 00:33:30,943 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-16 00:33:30,979 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-16 00:33:31,018 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-16 00:33:31,109 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-16 00:33:31,128 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-16 00:33:31,145 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-16 00:33:31,162 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-16 00:33:31,224 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 44 treesize of output 27 [2023-02-16 00:33:31,333 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 00:33:31,334 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 1 case distinctions, treesize of input 59 treesize of output 41 [2023-02-16 00:33:31,461 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 00:33:31,462 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 1 case distinctions, treesize of input 65 treesize of output 43 [2023-02-16 00:33:31,605 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-02-16 00:33:31,605 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 3 case distinctions, treesize of input 85 treesize of output 58 [2023-02-16 00:33:31,746 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-02-16 00:33:31,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 37 [2023-02-16 00:33:31,778 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-16 00:33:31,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:33:33,317 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_736 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_227| Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_736 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse2 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4))))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_227| 4))))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_225| 4))))) (or (= (+ .cse0 .cse1 .cse2 .cse3 .cse4) (* 4 c_~N~0)) (not (= 4 .cse4)) (not (= 4 .cse0)) (not (= 4 .cse3)) (not (= 4 .cse1)))))))))) is different from false [2023-02-16 00:33:33,415 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_736 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_227| Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_736 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse2 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4))))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_227| 4))))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_225| 4))))) (or (= (+ .cse0 .cse1 .cse2 .cse3 .cse4) (* 4 c_~N~0)) (not (= 4 .cse4)) (not (= 4 .cse0)) (not (= 4 .cse3)) (not (= 4 .cse1)))))))))) is different from false [2023-02-16 00:33:34,250 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* 4 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_237| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse4 (select v_ArrVal_736 (+ (* |v_ULTIMATE.start_main_~i~0#1_237| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_229| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_227| Int)) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_227| 4))))) (or (not (= 4 .cse0)) (forall ((|v_ULTIMATE.start_main_~i~0#1_225| Int)) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse0 .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_225| 4))))) (or (< (+ .cse1 .cse0 .cse2 .cse3 .cse4) (+ .cse5 5)) (not (= 4 .cse3)))))))) (not (= 4 .cse2)))))))) (not (= 4 .cse4))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_237| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse12 (select v_ArrVal_736 (+ (* |v_ULTIMATE.start_main_~i~0#1_237| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_229| Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_227| Int)) (let ((.cse8 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_227| 4))))) (or (not (= 4 .cse8)) (forall ((|v_ULTIMATE.start_main_~i~0#1_225| Int)) (let ((.cse9 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse8 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_225| 4))))) (or (not (= 4 .cse9)) (< (+ .cse5 3) (+ .cse10 .cse8 .cse11 .cse9 .cse12)))))))) (not (= 4 .cse11)))))))) (not (= 4 .cse12))))))) is different from false [2023-02-16 00:33:34,318 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_237| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse0 (select v_ArrVal_736 (+ (* |v_ULTIMATE.start_main_~i~0#1_237| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (forall ((|v_ULTIMATE.start_main_~i~0#1_229| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_227| Int)) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_227| 4))))) (or (not (= 4 .cse1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_225| Int)) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse1 .cse4 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_225| 4))))) (or (< (+ .cse2 7) (+ .cse3 .cse1 .cse4 .cse5 .cse0)) (not (= 4 .cse5)))))))) (not (= 4 .cse4))))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_237| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse8 (select v_ArrVal_736 (+ (* |v_ULTIMATE.start_main_~i~0#1_237| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse8)) (forall ((|v_ULTIMATE.start_main_~i~0#1_229| Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_227| Int)) (let ((.cse9 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_227| 4))))) (or (not (= 4 .cse9)) (forall ((|v_ULTIMATE.start_main_~i~0#1_225| Int)) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse9 .cse11 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_225| 4))))) (or (< (+ .cse10 .cse9 .cse11 .cse12 .cse8) (+ .cse2 9)) (not (= 4 .cse12)))))))) (not (= 4 .cse11))))))))))))) is different from false [2023-02-16 00:33:34,442 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_237| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse0 (select v_ArrVal_736 (+ (* |v_ULTIMATE.start_main_~i~0#1_237| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (forall ((|v_ULTIMATE.start_main_~i~0#1_229| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4))))) (or (not (= 4 .cse1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_227| Int)) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse1 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_227| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_225| Int)) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse1 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_225| 4))))) (or (< (+ .cse2 11) (+ .cse3 .cse4 .cse1 .cse5 .cse0)) (not (= 4 .cse5))))) (not (= 4 .cse4)))))))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_237| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse8 (select v_ArrVal_736 (+ (* |v_ULTIMATE.start_main_~i~0#1_237| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse8)) (forall ((|v_ULTIMATE.start_main_~i~0#1_229| Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_227| Int)) (let ((.cse10 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse11 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_227| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_225| Int)) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse11 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_225| 4))))) (or (< (+ .cse9 .cse10 .cse11 .cse12 .cse8) (+ .cse2 13)) (not (= 4 .cse12))))) (not (= 4 .cse10))))) (not (= 4 .cse11))))))))))))) is different from false [2023-02-16 00:33:34,568 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_237| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse0 (select v_ArrVal_736 (+ (* |v_ULTIMATE.start_main_~i~0#1_237| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (forall ((|v_ULTIMATE.start_main_~i~0#1_229| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_227| Int)) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse5 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_227| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_225| Int)) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse5 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_225| 4))))) (or (not (= 4 .cse1)) (< (+ .cse2 15) (+ .cse3 .cse4 .cse5 .cse1 .cse0))))) (not (= 4 .cse4))))) (not (= 4 .cse5))))))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_237| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse12 (select v_ArrVal_736 (+ (* |v_ULTIMATE.start_main_~i~0#1_237| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_229| Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_227| Int)) (let ((.cse9 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse10 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_227| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_225| Int)) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse10 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_225| 4))))) (or (< (+ .cse8 .cse9 .cse10 .cse11 .cse12) (+ .cse2 17)) (not (= 4 .cse11))))) (not (= 4 .cse9))))) (not (= 4 .cse10)))))))) (not (= 4 .cse12))))))) is different from false [2023-02-16 00:33:34,656 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 31 not checked. [2023-02-16 00:33:34,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105638295] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:33:34,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:33:34,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 20] total 54 [2023-02-16 00:33:34,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17010833] [2023-02-16 00:33:34,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:33:34,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-02-16 00:33:34,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:33:34,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-02-16 00:33:34,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2098, Unknown=7, NotChecked=582, Total=2862 [2023-02-16 00:33:34,658 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 54 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 54 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-16 00:33:45,684 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification. DAG size of input: 95 DAG size of output: 24 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:33:56,274 WARN L233 SmtUtils]: Spent 10.37s on a formula simplification. DAG size of input: 95 DAG size of output: 63 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:33:58,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:34:07,181 WARN L233 SmtUtils]: Spent 8.22s on a formula simplification. DAG size of input: 75 DAG size of output: 62 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:34:09,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:34:11,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:34:13,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:34:34,480 WARN L233 SmtUtils]: Spent 12.21s on a formula simplification. DAG size of input: 93 DAG size of output: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:34:35,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:34:37,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:34:39,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:34:42,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:34:43,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:34:45,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:34:55,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:35:03,062 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-16 00:35:05,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:35:07,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=true, quantifiers [1] [2023-02-16 00:35:09,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2023-02-16 00:35:11,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-16 00:35:16,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:35:16,995 INFO L93 Difference]: Finished difference Result 180 states and 216 transitions. [2023-02-16 00:35:16,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-02-16 00:35:16,996 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 54 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 45 [2023-02-16 00:35:16,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:35:16,996 INFO L225 Difference]: With dead ends: 180 [2023-02-16 00:35:16,996 INFO L226 Difference]: Without dead ends: 174 [2023-02-16 00:35:16,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 65 SyntacticMatches, 11 SemanticMatches, 95 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 2233 ImplicationChecksByTransitivity, 69.1s TimeCoverageRelationStatistics Valid=753, Invalid=7444, Unknown=17, NotChecked=1098, Total=9312 [2023-02-16 00:35:16,999 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 115 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 1858 mSolverCounterSat, 181 mSolverCounterUnsat, 135 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 2720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1858 IncrementalHoareTripleChecker+Invalid, 135 IncrementalHoareTripleChecker+Unknown, 546 IncrementalHoareTripleChecker+Unchecked, 35.9s IncrementalHoareTripleChecker+Time [2023-02-16 00:35:16,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 357 Invalid, 2720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1858 Invalid, 135 Unknown, 546 Unchecked, 35.9s Time] [2023-02-16 00:35:16,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-02-16 00:35:17,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 123. [2023-02-16 00:35:17,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.2540983606557377) internal successors, (153), 122 states have internal predecessors, (153), 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-16 00:35:17,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 153 transitions. [2023-02-16 00:35:17,033 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 153 transitions. Word has length 45 [2023-02-16 00:35:17,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:35:17,033 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 153 transitions. [2023-02-16 00:35:17,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 54 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-16 00:35:17,034 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 153 transitions. [2023-02-16 00:35:17,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-16 00:35:17,034 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:35:17,034 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:35:17,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-16 00:35:17,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-16 00:35:17,240 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:35:17,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:35:17,240 INFO L85 PathProgramCache]: Analyzing trace with hash -2054602352, now seen corresponding path program 3 times [2023-02-16 00:35:17,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:35:17,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404998492] [2023-02-16 00:35:17,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:35:17,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:35:17,250 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 00:35:17,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1353278941] [2023-02-16 00:35:17,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 00:35:17,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:35:17,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:35:17,253 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:35:17,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-16 00:35:17,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-16 00:35:17,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:35:17,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-16 00:35:17,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:35:17,429 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 0 case distinctions, treesize of input 37 treesize of output 17 [2023-02-16 00:35:17,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:35:17,505 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 18 treesize of output 20 [2023-02-16 00:35:17,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:35:17,532 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 18 treesize of output 20 [2023-02-16 00:35:17,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:35:17,570 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 18 treesize of output 20 [2023-02-16 00:35:17,599 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:35:17,599 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 23 treesize of output 19 [2023-02-16 00:35:17,643 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-02-16 00:35:17,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:35:18,113 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:35:18,113 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 49 treesize of output 33 [2023-02-16 00:35:18,121 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-02-16 00:35:18,121 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 42 treesize of output 30 [2023-02-16 00:35:20,162 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-02-16 00:35:20,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:35:20,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404998492] [2023-02-16 00:35:20,162 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 00:35:20,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353278941] [2023-02-16 00:35:20,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353278941] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:35:20,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:35:20,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-02-16 00:35:20,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788544677] [2023-02-16 00:35:20,163 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:35:20,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-16 00:35:20,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:35:20,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-16 00:35:20,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=232, Unknown=2, NotChecked=0, Total=306 [2023-02-16 00:35:20,164 INFO L87 Difference]: Start difference. First operand 123 states and 153 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 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-16 00:35:20,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:35:20,549 INFO L93 Difference]: Finished difference Result 162 states and 200 transitions. [2023-02-16 00:35:20,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-16 00:35:20,550 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2023-02-16 00:35:20,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:35:20,550 INFO L225 Difference]: With dead ends: 162 [2023-02-16 00:35:20,550 INFO L226 Difference]: Without dead ends: 158 [2023-02-16 00:35:20,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=177, Invalid=471, Unknown=2, NotChecked=0, Total=650 [2023-02-16 00:35:20,552 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 34 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 00:35:20,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 39 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 00:35:20,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-02-16 00:35:20,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 142. [2023-02-16 00:35:20,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.2695035460992907) internal successors, (179), 141 states have internal predecessors, (179), 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-16 00:35:20,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 179 transitions. [2023-02-16 00:35:20,584 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 179 transitions. Word has length 45 [2023-02-16 00:35:20,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:35:20,584 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 179 transitions. [2023-02-16 00:35:20,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 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-16 00:35:20,584 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 179 transitions. [2023-02-16 00:35:20,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-16 00:35:20,585 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:35:20,585 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:35:20,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-02-16 00:35:20,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:35:20,791 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:35:20,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:35:20,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1431802284, now seen corresponding path program 4 times [2023-02-16 00:35:20,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:35:20,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912144350] [2023-02-16 00:35:20,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:35:20,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:35:20,802 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 00:35:20,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1021855102] [2023-02-16 00:35:20,803 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 00:35:20,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:35:20,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:35:20,804 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:35:20,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-16 00:35:20,897 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 00:35:20,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:35:20,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-16 00:35:20,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:35:20,903 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 10 treesize of output 8 [2023-02-16 00:35:20,968 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 37 treesize of output 17 [2023-02-16 00:35:21,009 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-02-16 00:35:21,009 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 1 case distinctions, treesize of input 25 treesize of output 24 [2023-02-16 00:35:21,048 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 16 treesize of output 18 [2023-02-16 00:35:21,076 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 16 treesize of output 18 [2023-02-16 00:35:21,101 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-16 00:35:21,110 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 00:35:21,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:35:21,142 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4)) 4)) is different from false [2023-02-16 00:35:23,192 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 4)) is different from false [2023-02-16 00:35:25,796 INFO L321 Elim1Store]: treesize reduction 29, result has 48.2 percent of original size [2023-02-16 00:35:25,796 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 3 case distinctions, treesize of input 54 treesize of output 43 [2023-02-16 00:35:25,803 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:35:25,803 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 38 treesize of output 34 [2023-02-16 00:35:25,840 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 16 refuted. 2 times theorem prover too weak. 18 trivial. 11 not checked. [2023-02-16 00:35:25,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:35:25,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912144350] [2023-02-16 00:35:25,840 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 00:35:25,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021855102] [2023-02-16 00:35:25,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021855102] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:35:25,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:35:25,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2023-02-16 00:35:25,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335010961] [2023-02-16 00:35:25,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:35:25,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-16 00:35:25,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:35:25,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-16 00:35:25,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=341, Unknown=9, NotChecked=78, Total=506 [2023-02-16 00:35:25,842 INFO L87 Difference]: Start difference. First operand 142 states and 179 transitions. Second operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 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-16 00:35:26,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:35:26,173 INFO L93 Difference]: Finished difference Result 168 states and 214 transitions. [2023-02-16 00:35:26,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 00:35:26,174 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 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 45 [2023-02-16 00:35:26,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:35:26,174 INFO L225 Difference]: With dead ends: 168 [2023-02-16 00:35:26,174 INFO L226 Difference]: Without dead ends: 140 [2023-02-16 00:35:26,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=94, Invalid=411, Unknown=9, NotChecked=86, Total=600 [2023-02-16 00:35:26,179 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 31 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 00:35:26,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 63 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 398 Invalid, 0 Unknown, 89 Unchecked, 0.2s Time] [2023-02-16 00:35:26,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-02-16 00:35:26,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2023-02-16 00:35:26,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.218978102189781) internal successors, (167), 137 states have internal predecessors, (167), 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-16 00:35:26,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 167 transitions. [2023-02-16 00:35:26,213 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 167 transitions. Word has length 45 [2023-02-16 00:35:26,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:35:26,214 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 167 transitions. [2023-02-16 00:35:26,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 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-16 00:35:26,214 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 167 transitions. [2023-02-16 00:35:26,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-16 00:35:26,214 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:35:26,214 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:35:26,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-02-16 00:35:26,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:35:26,420 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:35:26,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:35:26,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1422716494, now seen corresponding path program 3 times [2023-02-16 00:35:26,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:35:26,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833132954] [2023-02-16 00:35:26,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:35:26,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:35:26,429 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 00:35:26,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2118576676] [2023-02-16 00:35:26,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 00:35:26,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:35:26,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:35:26,445 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:35:26,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-02-16 00:35:26,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-16 00:35:26,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:35:26,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-16 00:35:26,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:35:26,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-02-16 00:35:26,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:35:26,706 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 27 treesize of output 26 [2023-02-16 00:35:26,758 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-16 00:35:26,758 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 30 [2023-02-16 00:35:26,812 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-02-16 00:35:26,813 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 40 treesize of output 47 [2023-02-16 00:35:26,886 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:35:26,886 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 35 treesize of output 35 [2023-02-16 00:35:27,052 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 00:35:27,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:35:36,775 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 25 treesize of output 23 [2023-02-16 00:35:36,779 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 154 treesize of output 142 [2023-02-16 00:35:36,797 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-16 00:35:36,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:35:36,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833132954] [2023-02-16 00:35:36,797 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 00:35:36,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118576676] [2023-02-16 00:35:36,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118576676] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:35:36,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:35:36,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 37 [2023-02-16 00:35:36,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771887897] [2023-02-16 00:35:36,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:35:36,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-02-16 00:35:36,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:35:36,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-16 00:35:36,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=1024, Unknown=5, NotChecked=0, Total=1332 [2023-02-16 00:35:36,799 INFO L87 Difference]: Start difference. First operand 138 states and 167 transitions. Second operand has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 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-16 00:35:37,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:35:37,938 INFO L93 Difference]: Finished difference Result 144 states and 172 transitions. [2023-02-16 00:35:37,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-02-16 00:35:37,938 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 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 45 [2023-02-16 00:35:37,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:35:37,939 INFO L225 Difference]: With dead ends: 144 [2023-02-16 00:35:37,939 INFO L226 Difference]: Without dead ends: 92 [2023-02-16 00:35:37,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=784, Invalid=2751, Unknown=5, NotChecked=0, Total=3540 [2023-02-16 00:35:37,940 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 103 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 00:35:37,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 48 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 00:35:37,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-16 00:35:37,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2023-02-16 00:35:37,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.1547619047619047) internal successors, (97), 84 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-16 00:35:37,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2023-02-16 00:35:37,957 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 45 [2023-02-16 00:35:37,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:35:37,957 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2023-02-16 00:35:37,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 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-16 00:35:37,957 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2023-02-16 00:35:37,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-16 00:35:37,957 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:35:37,958 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:35:37,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-02-16 00:35:38,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:35:38,163 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:35:38,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:35:38,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1510143892, now seen corresponding path program 11 times [2023-02-16 00:35:38,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:35:38,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129773927] [2023-02-16 00:35:38,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:35:38,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:35:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:35:38,301 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-16 00:35:38,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:35:38,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129773927] [2023-02-16 00:35:38,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129773927] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:35:38,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574680121] [2023-02-16 00:35:38,302 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-16 00:35:38,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:35:38,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:35:38,303 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:35:38,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-02-16 00:35:38,462 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-02-16 00:35:38,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:35:38,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 00:35:38,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:35:38,571 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-16 00:35:38,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:35:38,668 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-16 00:35:38,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574680121] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:35:38,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:35:38,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2023-02-16 00:35:38,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464624537] [2023-02-16 00:35:38,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:35:38,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-16 00:35:38,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:35:38,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-16 00:35:38,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2023-02-16 00:35:38,670 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:39,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:35:39,008 INFO L93 Difference]: Finished difference Result 142 states and 165 transitions. [2023-02-16 00:35:39,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-16 00:35:39,009 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2023-02-16 00:35:39,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:35:39,009 INFO L225 Difference]: With dead ends: 142 [2023-02-16 00:35:39,009 INFO L226 Difference]: Without dead ends: 124 [2023-02-16 00:35:39,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 77 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2023-02-16 00:35:39,010 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 101 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 00:35:39,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 30 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 00:35:39,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-16 00:35:39,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 74. [2023-02-16 00:35:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 73 states have internal predecessors, (85), 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-16 00:35:39,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2023-02-16 00:35:39,027 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 47 [2023-02-16 00:35:39,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:35:39,027 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2023-02-16 00:35:39,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.7) internal successors, (74), 20 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:39,027 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2023-02-16 00:35:39,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-16 00:35:39,028 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:35:39,028 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:35:39,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-02-16 00:35:39,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-02-16 00:35:39,233 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:35:39,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:35:39,234 INFO L85 PathProgramCache]: Analyzing trace with hash -220752601, now seen corresponding path program 12 times [2023-02-16 00:35:39,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:35:39,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476594630] [2023-02-16 00:35:39,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:35:39,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:35:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:35:39,391 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-16 00:35:39,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:35:39,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476594630] [2023-02-16 00:35:39,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476594630] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:35:39,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802582305] [2023-02-16 00:35:39,392 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-16 00:35:39,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:35:39,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:35:39,413 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:35:39,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-02-16 00:35:39,554 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2023-02-16 00:35:39,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:35:39,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 00:35:39,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:35:39,707 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-16 00:35:39,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:35:39,796 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-16 00:35:39,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802582305] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:35:39,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:35:39,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2023-02-16 00:35:39,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252437180] [2023-02-16 00:35:39,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:35:39,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-16 00:35:39,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:35:39,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-16 00:35:39,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2023-02-16 00:35:39,797 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 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-16 00:35:39,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:35:39,950 INFO L93 Difference]: Finished difference Result 143 states and 168 transitions. [2023-02-16 00:35:39,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-16 00:35:39,950 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 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 48 [2023-02-16 00:35:39,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:35:39,954 INFO L225 Difference]: With dead ends: 143 [2023-02-16 00:35:39,954 INFO L226 Difference]: Without dead ends: 78 [2023-02-16 00:35:39,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 79 SyntacticMatches, 10 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2023-02-16 00:35:39,955 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 71 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:35:39,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 38 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:35:39,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-16 00:35:39,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2023-02-16 00:35:39,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.171875) internal successors, (75), 64 states have internal predecessors, (75), 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-16 00:35:39,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2023-02-16 00:35:39,973 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 48 [2023-02-16 00:35:39,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:35:39,973 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2023-02-16 00:35:39,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 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-16 00:35:39,973 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2023-02-16 00:35:39,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-16 00:35:39,974 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:35:39,974 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:35:39,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-02-16 00:35:40,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-02-16 00:35:40,179 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:35:40,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:35:40,180 INFO L85 PathProgramCache]: Analyzing trace with hash 663114381, now seen corresponding path program 13 times [2023-02-16 00:35:40,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:35:40,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368147889] [2023-02-16 00:35:40,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:35:40,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:35:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:35:41,987 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-02-16 00:35:41,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:35:41,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368147889] [2023-02-16 00:35:41,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368147889] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:35:41,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107217611] [2023-02-16 00:35:41,988 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-16 00:35:41,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:35:41,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:35:41,989 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:35:42,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-02-16 00:35:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:35:42,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 81 conjunts are in the unsatisfiable core [2023-02-16 00:35:42,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:35:42,105 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 10 treesize of output 8 [2023-02-16 00:35:42,108 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 11 treesize of output 7 [2023-02-16 00:35:42,153 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-16 00:35:42,206 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-16 00:35:42,250 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-16 00:35:42,290 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-16 00:35:42,335 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-16 00:35:42,445 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-16 00:35:42,461 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-16 00:35:42,478 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-16 00:35:42,496 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-16 00:35:42,514 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-16 00:35:42,583 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 44 treesize of output 27 [2023-02-16 00:35:42,706 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 00:35:42,706 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 1 case distinctions, treesize of input 63 treesize of output 41 [2023-02-16 00:35:42,874 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 00:35:42,875 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 1 case distinctions, treesize of input 65 treesize of output 43 [2023-02-16 00:35:43,043 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-02-16 00:35:43,043 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 3 case distinctions, treesize of input 91 treesize of output 60 [2023-02-16 00:35:43,217 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-02-16 00:35:43,217 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 3 case distinctions, treesize of input 91 treesize of output 60 [2023-02-16 00:35:43,353 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-02-16 00:35:43,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 44 [2023-02-16 00:35:43,394 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-02-16 00:35:43,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:35:57,653 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1170 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_356| Int) (|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_358| Int) (|v_ULTIMATE.start_main_~i~0#1_354| Int) (|v_ULTIMATE.start_main_~i~0#1_360| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1170))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select v_ArrVal_1170 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_360| 4))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_358| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_356| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_354| 4))))) (or (not (= 4 .cse0)) (= (+ .cse1 .cse2 .cse3 .cse4 .cse0 .cse5) (* 4 c_~N~0)) (not (= 4 .cse4)) (not (= 4 .cse5)) (not (= 4 .cse2)) (not (= 4 .cse3))))))))))) is different from false [2023-02-16 00:35:57,828 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1170 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_356| Int) (|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_358| Int) (|v_ULTIMATE.start_main_~i~0#1_354| Int) (|v_ULTIMATE.start_main_~i~0#1_360| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1170))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select v_ArrVal_1170 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_360| 4))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_358| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_356| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_354| 4))))) (or (not (= 4 .cse0)) (= (+ .cse1 .cse2 .cse3 .cse4 .cse0 .cse5) (* 4 c_~N~0)) (not (= 4 .cse4)) (not (= 4 .cse5)) (not (= 4 .cse2)) (not (= 4 .cse3))))))))))) is different from false [2023-02-16 00:35:59,269 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* 4 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((v_ArrVal_1170 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_369| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int)) (let ((.cse0 (select v_ArrVal_1170 (+ (* |v_ULTIMATE.start_main_~i~0#1_369| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (forall ((|v_ULTIMATE.start_main_~i~0#1_360| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1170))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_360| 4))))) (or (not (= 4 .cse1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_358| Int)) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_358| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_356| Int)) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4 .cse5 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_356| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse2)) (forall ((|v_ULTIMATE.start_main_~i~0#1_354| Int)) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4 .cse5 .cse2 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_354| 4))))) (or (not (= 4 .cse3)) (< (+ .cse3 .cse0 .cse4 .cse5 .cse2 .cse1) (+ .cse6 5)))))))) (not (= 4 .cse4)))))))))))))) (forall ((v_ArrVal_1170 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_369| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int)) (let ((.cse11 (select v_ArrVal_1170 (+ (* |v_ULTIMATE.start_main_~i~0#1_369| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_360| Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1170))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_360| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_358| Int)) (let ((.cse9 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_358| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse9)) (forall ((|v_ULTIMATE.start_main_~i~0#1_356| Int)) (let ((.cse13 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse9 .cse12 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_356| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_354| Int)) (let ((.cse10 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse9 .cse12 .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_354| 4))))) (or (< (+ .cse6 3) (+ .cse10 .cse11 .cse9 .cse12 .cse13 .cse14)) (not (= 4 .cse10))))) (not (= 4 .cse13)))))))) (not (= 4 .cse14)))))))) (not (= 4 .cse11))))))) is different from false [2023-02-16 00:35:59,365 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* 4 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((v_ArrVal_1170 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_369| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int)) (let ((.cse1 (select v_ArrVal_1170 (+ (* |v_ULTIMATE.start_main_~i~0#1_369| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_360| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1170))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_360| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_358| Int)) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_358| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_356| Int)) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_356| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_354| Int)) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_354| 4))))) (or (not (= 4 .cse0)) (< (+ .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (+ .cse6 9))))) (not (= 4 .cse4))))) (not (= 4 .cse2))))) (not (= 4 .cse5)))))))) (not (= 4 .cse1))))) (forall ((v_ArrVal_1170 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_369| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int)) (let ((.cse9 (select v_ArrVal_1170 (+ (* |v_ULTIMATE.start_main_~i~0#1_369| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse9)) (forall ((|v_ULTIMATE.start_main_~i~0#1_360| Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1170))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse14 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_360| 4))))) (or (not (= 4 .cse10)) (forall ((|v_ULTIMATE.start_main_~i~0#1_358| Int)) (let ((.cse11 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse14 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_358| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse11)) (forall ((|v_ULTIMATE.start_main_~i~0#1_356| Int)) (let ((.cse12 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse11 .cse14 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_356| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse12)) (forall ((|v_ULTIMATE.start_main_~i~0#1_354| Int)) (let ((.cse13 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse11 .cse14 .cse12 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_354| 4))))) (or (not (= 4 .cse13)) (< (+ .cse6 7) (+ .cse13 .cse9 .cse11 .cse14 .cse12 .cse10)))))))))))))))))))))) is different from false [2023-02-16 00:35:59,480 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* 4 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((v_ArrVal_1170 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_369| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int)) (let ((.cse0 (select v_ArrVal_1170 (+ (* |v_ULTIMATE.start_main_~i~0#1_369| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (forall ((|v_ULTIMATE.start_main_~i~0#1_360| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1170))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_360| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_358| Int)) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_358| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_356| Int)) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_356| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_354| Int)) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_354| 4))))) (or (not (= 4 .cse1)) (< (+ .cse1 .cse0 .cse2 .cse3 .cse4 .cse5) (+ .cse6 9))))) (not (= 4 .cse4))))) (not (= 4 .cse2))))) (not (= 4 .cse5))))))))))) (forall ((v_ArrVal_1170 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_369| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int)) (let ((.cse9 (select v_ArrVal_1170 (+ (* |v_ULTIMATE.start_main_~i~0#1_369| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse9)) (forall ((|v_ULTIMATE.start_main_~i~0#1_360| Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1170))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse14 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_360| 4))))) (or (not (= 4 .cse10)) (forall ((|v_ULTIMATE.start_main_~i~0#1_358| Int)) (let ((.cse11 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse14 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_358| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse11)) (forall ((|v_ULTIMATE.start_main_~i~0#1_356| Int)) (let ((.cse12 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse11 .cse14 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_356| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse12)) (forall ((|v_ULTIMATE.start_main_~i~0#1_354| Int)) (let ((.cse13 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse11 .cse14 .cse12 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_354| 4))))) (or (not (= 4 .cse13)) (< (+ .cse6 7) (+ .cse13 .cse9 .cse11 .cse14 .cse12 .cse10)))))))))))))))))))))) is different from false [2023-02-16 00:35:59,579 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((v_ArrVal_1170 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_369| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int)) (let ((.cse3 (select v_ArrVal_1170 (+ (* |v_ULTIMATE.start_main_~i~0#1_369| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_360| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1170))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_360| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_358| Int)) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_358| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (forall ((|v_ULTIMATE.start_main_~i~0#1_356| Int)) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_356| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_354| Int)) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_354| 4))))) (or (not (= 4 .cse1)) (< (+ .cse2 11) (+ .cse1 .cse3 .cse0 .cse4 .cse5 .cse6))))) (not (= 4 .cse5)))))))) (not (= 4 .cse6)))))))) (not (= 4 .cse3))))) (forall ((v_ArrVal_1170 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_369| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int)) (let ((.cse13 (select v_ArrVal_1170 (+ (* |v_ULTIMATE.start_main_~i~0#1_369| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_360| Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1170))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse14 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_360| 4))))) (or (not (= 4 .cse9)) (forall ((|v_ULTIMATE.start_main_~i~0#1_358| Int)) (let ((.cse10 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse14 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_358| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse10)) (forall ((|v_ULTIMATE.start_main_~i~0#1_356| Int)) (let ((.cse11 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse10 .cse14 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_356| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse11)) (forall ((|v_ULTIMATE.start_main_~i~0#1_354| Int)) (let ((.cse12 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse10 .cse14 .cse11 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_354| 4))))) (or (not (= 4 .cse12)) (< (+ .cse12 .cse13 .cse10 .cse14 .cse11 .cse9) (+ .cse2 13))))))))))))))))) (not (= 4 .cse13))))))) is different from false [2023-02-16 00:35:59,736 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((v_ArrVal_1170 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_369| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int)) (let ((.cse3 (select v_ArrVal_1170 (+ (* |v_ULTIMATE.start_main_~i~0#1_369| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_360| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1170))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_360| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_358| Int)) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_358| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (forall ((|v_ULTIMATE.start_main_~i~0#1_356| Int)) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_356| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_354| Int)) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_354| 4))))) (or (not (= 4 .cse1)) (< (+ .cse2 15) (+ .cse1 .cse3 .cse0 .cse4 .cse5 .cse6))))) (not (= 4 .cse5)))))))) (not (= 4 .cse6)))))))) (not (= 4 .cse3))))) (forall ((v_ArrVal_1170 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_369| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int)) (let ((.cse9 (select v_ArrVal_1170 (+ (* |v_ULTIMATE.start_main_~i~0#1_369| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse9)) (forall ((|v_ULTIMATE.start_main_~i~0#1_360| Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1170))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_360| 4))))) (or (not (= 4 .cse10)) (forall ((|v_ULTIMATE.start_main_~i~0#1_358| Int)) (let ((.cse11 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse13 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_358| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse11)) (forall ((|v_ULTIMATE.start_main_~i~0#1_356| Int)) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse11 .cse13 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_356| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_354| Int)) (let ((.cse12 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse11 .cse13 .cse14 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_354| 4))))) (or (not (= 4 .cse12)) (< (+ .cse12 .cse9 .cse11 .cse13 .cse14 .cse10) (+ .cse2 17))))) (not (= 4 .cse14))))))))))))))))))) is different from false [2023-02-16 00:35:59,845 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((v_ArrVal_1170 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_369| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int)) (let ((.cse3 (select v_ArrVal_1170 (+ (* |v_ULTIMATE.start_main_~i~0#1_369| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_360| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1170))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_360| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_358| Int)) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_358| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (forall ((|v_ULTIMATE.start_main_~i~0#1_356| Int)) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_356| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_354| Int)) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_354| 4))))) (or (not (= 4 .cse1)) (< (+ .cse2 15) (+ .cse1 .cse3 .cse0 .cse4 .cse5 .cse6))))) (not (= 4 .cse5)))))))) (not (= 4 .cse6)))))))) (not (= 4 .cse3))))) (forall ((v_ArrVal_1170 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_369| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int)) (let ((.cse9 (select v_ArrVal_1170 (+ (* |v_ULTIMATE.start_main_~i~0#1_369| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse9)) (forall ((|v_ULTIMATE.start_main_~i~0#1_360| Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1170))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_360| 4))))) (or (not (= 4 .cse10)) (forall ((|v_ULTIMATE.start_main_~i~0#1_358| Int)) (let ((.cse11 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse13 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_358| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse11)) (forall ((|v_ULTIMATE.start_main_~i~0#1_356| Int)) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse11 .cse13 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_356| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_354| Int)) (let ((.cse12 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse11 .cse13 .cse14 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_354| 4))))) (or (not (= 4 .cse12)) (< (+ .cse12 .cse9 .cse11 .cse13 .cse14 .cse10) (+ .cse2 17))))) (not (= 4 .cse14))))))))))))))))))) is different from false [2023-02-16 00:35:59,931 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((v_ArrVal_1170 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_369| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int)) (let ((.cse0 (select v_ArrVal_1170 (+ (* |v_ULTIMATE.start_main_~i~0#1_369| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (forall ((|v_ULTIMATE.start_main_~i~0#1_360| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1170))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_360| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_358| Int)) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_358| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_356| Int)) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_356| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_354| Int)) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_354| 4))))) (or (< (+ .cse2 19) (+ .cse3 .cse0 .cse1 .cse4 .cse5 .cse6)) (not (= 4 .cse3))))) (not (= 4 .cse5)))))))) (not (= 4 .cse6))))))))))) (forall ((v_ArrVal_1170 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_369| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int)) (let ((.cse11 (select v_ArrVal_1170 (+ (* |v_ULTIMATE.start_main_~i~0#1_369| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_360| Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1170))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_360| 4))))) (or (not (= 4 .cse9)) (forall ((|v_ULTIMATE.start_main_~i~0#1_358| Int)) (let ((.cse12 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse13 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_358| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_356| Int)) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_356| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_354| Int)) (let ((.cse10 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13 .cse14 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_354| 4))))) (or (not (= 4 .cse10)) (< (+ .cse10 .cse11 .cse12 .cse13 .cse14 .cse9) (+ .cse2 21))))) (not (= 4 .cse14))))) (not (= 4 .cse12))))))))))) (not (= 4 .cse11))))))) is different from false [2023-02-16 00:36:00,016 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((v_ArrVal_1170 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_369| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int)) (let ((.cse0 (select v_ArrVal_1170 (+ (* |v_ULTIMATE.start_main_~i~0#1_369| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (forall ((|v_ULTIMATE.start_main_~i~0#1_360| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1170))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_360| 4))))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_358| Int)) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_358| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_356| Int)) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse4 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_356| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_354| Int)) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_354| 4))))) (or (< (+ .cse2 19) (+ .cse3 .cse0 .cse1 .cse4 .cse5 .cse6)) (not (= 4 .cse3))))) (not (= 4 .cse5)))))))) (not (= 4 .cse6))))))))))) (forall ((v_ArrVal_1170 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_369| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int)) (let ((.cse11 (select v_ArrVal_1170 (+ (* |v_ULTIMATE.start_main_~i~0#1_369| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_360| Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1170))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_360| 4))))) (or (not (= 4 .cse9)) (forall ((|v_ULTIMATE.start_main_~i~0#1_358| Int)) (let ((.cse12 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse13 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_358| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_356| Int)) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_356| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_354| Int)) (let ((.cse10 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13 .cse14 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_354| 4))))) (or (not (= 4 .cse10)) (< (+ .cse10 .cse11 .cse12 .cse13 .cse14 .cse9) (+ .cse2 21))))) (not (= 4 .cse14))))) (not (= 4 .cse12))))))))))) (not (= 4 .cse11))))))) is different from false [2023-02-16 00:36:00,082 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 10 trivial. 50 not checked. [2023-02-16 00:36:00,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107217611] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:36:00,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:36:00,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21, 26] total 68 [2023-02-16 00:36:00,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608917720] [2023-02-16 00:36:00,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:36:00,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-02-16 00:36:00,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:36:00,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-02-16 00:36:00,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=3110, Unknown=16, NotChecked=1210, Total=4556 [2023-02-16 00:36:00,085 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 68 states, 68 states have (on average 1.7058823529411764) internal successors, (116), 68 states have internal predecessors, (116), 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-16 00:36:31,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:36:52,642 WARN L233 SmtUtils]: Spent 12.28s on a formula simplification. DAG size of input: 135 DAG size of output: 131 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:36:54,837 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]