./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s5if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c 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/s5if.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 b618695aa08df106816e7defd71220f009a5c8c09539ff7c8c29235c85f2ce8d --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 00:12:53,004 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 00:12:53,007 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 00:12:53,044 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 00:12:53,045 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 00:12:53,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 00:12:53,051 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 00:12:53,053 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 00:12:53,056 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 00:12:53,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 00:12:53,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 00:12:53,069 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 00:12:53,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 00:12:53,072 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 00:12:53,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 00:12:53,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 00:12:53,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 00:12:53,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 00:12:53,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 00:12:53,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 00:12:53,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 00:12:53,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 00:12:53,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 00:12:53,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 00:12:53,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 00:12:53,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 00:12:53,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 00:12:53,102 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 00:12:53,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 00:12:53,104 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 00:12:53,106 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 00:12:53,107 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 00:12:53,109 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 00:12:53,110 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 00:12:53,111 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 00:12:53,111 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 00:12:53,112 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 00:12:53,112 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 00:12:53,113 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 00:12:53,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 00:12:53,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 00:12:53,116 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 00:12:53,154 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 00:12:53,155 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 00:12:53,156 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 00:12:53,156 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 00:12:53,157 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 00:12:53,158 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 00:12:53,159 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 00:12:53,159 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 00:12:53,159 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 00:12:53,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 00:12:53,161 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 00:12:53,161 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 00:12:53,162 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 00:12:53,162 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 00:12:53,162 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 00:12:53,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 00:12:53,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 00:12:53,163 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 00:12:53,163 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 00:12:53,163 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 00:12:53,163 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 00:12:53,164 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 00:12:53,164 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 00:12:53,164 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 00:12:53,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 00:12:53,165 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 00:12:53,165 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 00:12:53,165 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 00:12:53,166 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 00:12:53,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 00:12:53,166 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 00:12:53,166 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 00:12:53,167 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 00:12:53,167 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 00:12:53,167 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 00:12:53,167 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 -> b618695aa08df106816e7defd71220f009a5c8c09539ff7c8c29235c85f2ce8d [2023-02-17 00:12:53,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 00:12:53,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 00:12:53,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 00:12:53,543 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 00:12:53,544 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 00:12:53,545 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s5if.c [2023-02-17 00:12:54,811 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 00:12:55,016 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 00:12:55,016 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s5if.c [2023-02-17 00:12:55,024 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf22f0c39/25c01659279e4f16b9dc1703b1820ac2/FLAGd4cd07b0f [2023-02-17 00:12:55,038 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf22f0c39/25c01659279e4f16b9dc1703b1820ac2 [2023-02-17 00:12:55,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 00:12:55,042 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 00:12:55,043 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 00:12:55,043 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 00:12:55,046 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 00:12:55,047 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 12:12:55" (1/1) ... [2023-02-17 00:12:55,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a55bdde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:12:55, skipping insertion in model container [2023-02-17 00:12:55,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 12:12:55" (1/1) ... [2023-02-17 00:12:55,054 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 00:12:55,067 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 00:12:55,178 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/s5if.c[587,600] [2023-02-17 00:12:55,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 00:12:55,214 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 00:12:55,229 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/s5if.c[587,600] [2023-02-17 00:12:55,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 00:12:55,260 INFO L208 MainTranslator]: Completed translation [2023-02-17 00:12:55,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:12:55 WrapperNode [2023-02-17 00:12:55,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 00:12:55,262 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 00:12:55,262 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 00:12:55,262 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 00:12:55,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:12:55" (1/1) ... [2023-02-17 00:12:55,283 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:12:55" (1/1) ... [2023-02-17 00:12:55,306 INFO L138 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2023-02-17 00:12:55,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 00:12:55,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 00:12:55,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 00:12:55,308 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 00:12:55,316 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:12:55" (1/1) ... [2023-02-17 00:12:55,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:12:55" (1/1) ... [2023-02-17 00:12:55,321 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:12:55" (1/1) ... [2023-02-17 00:12:55,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:12:55" (1/1) ... [2023-02-17 00:12:55,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:12:55" (1/1) ... [2023-02-17 00:12:55,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:12:55" (1/1) ... [2023-02-17 00:12:55,348 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:12:55" (1/1) ... [2023-02-17 00:12:55,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:12:55" (1/1) ... [2023-02-17 00:12:55,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 00:12:55,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 00:12:55,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 00:12:55,353 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 00:12:55,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:12:55" (1/1) ... [2023-02-17 00:12:55,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 00:12:55,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:12:55,383 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-17 00:12:55,407 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-17 00:12:55,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 00:12:55,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 00:12:55,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 00:12:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-17 00:12:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 00:12:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 00:12:55,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 00:12:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-17 00:12:55,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 00:12:55,487 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 00:12:55,491 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 00:12:55,606 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 00:12:55,611 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 00:12:55,612 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-17 00:12:55,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 12:12:55 BoogieIcfgContainer [2023-02-17 00:12:55,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 00:12:55,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 00:12:55,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 00:12:55,621 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 00:12:55,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 12:12:55" (1/3) ... [2023-02-17 00:12:55,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce5c0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 12:12:55, skipping insertion in model container [2023-02-17 00:12:55,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:12:55" (2/3) ... [2023-02-17 00:12:55,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce5c0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 12:12:55, skipping insertion in model container [2023-02-17 00:12:55,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 12:12:55" (3/3) ... [2023-02-17 00:12:55,625 INFO L112 eAbstractionObserver]: Analyzing ICFG s5if.c [2023-02-17 00:12:55,642 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 00:12:55,643 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 00:12:55,685 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 00:12:55,691 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;@5e80fcc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 00:12:55,691 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 00:12:55,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 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-17 00:12:55,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-17 00:12:55,699 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:12:55,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:12:55,700 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:12:55,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:12:55,704 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2023-02-17 00:12:55,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:12:55,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702866155] [2023-02-17 00:12:55,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:12:55,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:12:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:12:55,889 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-17 00:12:55,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:12:55,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702866155] [2023-02-17 00:12:55,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702866155] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:12:55,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:12:55,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 00:12:55,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848268517] [2023-02-17 00:12:55,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:12:55,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 00:12:55,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:12:55,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 00:12:55,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 00:12:55,934 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 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) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-17 00:12:55,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:12:55,949 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2023-02-17 00:12:55,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 00:12:55,951 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2023-02-17 00:12:55,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:12:55,956 INFO L225 Difference]: With dead ends: 34 [2023-02-17 00:12:55,956 INFO L226 Difference]: Without dead ends: 15 [2023-02-17 00:12:55,958 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-17 00:12:55,961 INFO L413 NwaCegarLoop]: 22 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, 22 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-17 00:12:55,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:12:55,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-02-17 00:12:55,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-02-17 00:12:55,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:12:55,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2023-02-17 00:12:55,985 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2023-02-17 00:12:55,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:12:55,985 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-02-17 00:12:55,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-17 00:12:55,986 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2023-02-17 00:12:55,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-17 00:12:55,986 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:12:55,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:12:55,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 00:12:55,987 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:12:55,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:12:55,988 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2023-02-17 00:12:55,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:12:55,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043122602] [2023-02-17 00:12:55,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:12:55,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:12:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:12:56,143 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-17 00:12:56,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:12:56,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043122602] [2023-02-17 00:12:56,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043122602] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:12:56,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:12:56,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 00:12:56,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811722403] [2023-02-17 00:12:56,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:12:56,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 00:12:56,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:12:56,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 00:12:56,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 00:12:56,147 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-17 00:12:56,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:12:56,233 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2023-02-17 00:12:56,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 00:12:56,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2023-02-17 00:12:56,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:12:56,235 INFO L225 Difference]: With dead ends: 28 [2023-02-17 00:12:56,235 INFO L226 Difference]: Without dead ends: 20 [2023-02-17 00:12:56,235 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-17 00:12:56,236 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 00:12:56,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 10 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 00:12:56,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-17 00:12:56,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2023-02-17 00:12:56,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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-17 00:12:56,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2023-02-17 00:12:56,241 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2023-02-17 00:12:56,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:12:56,241 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2023-02-17 00:12:56,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-17 00:12:56,242 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2023-02-17 00:12:56,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-17 00:12:56,242 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:12:56,243 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:12:56,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 00:12:56,243 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:12:56,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:12:56,244 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2023-02-17 00:12:56,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:12:56,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101800762] [2023-02-17 00:12:56,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:12:56,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:12:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:12:56,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:12:56,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:12:56,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101800762] [2023-02-17 00:12:56,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101800762] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:12:56,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717668138] [2023-02-17 00:12:56,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:12:56,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:12:56,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:12:56,951 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-17 00:12:56,971 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-17 00:12:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:12:57,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-17 00:12:57,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:12:57,112 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-17 00:12:57,118 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-17 00:12:57,141 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-17 00:12:57,241 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-17 00:12:57,317 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 49 treesize of output 29 [2023-02-17 00:12:57,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:12:57,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:12:57,505 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:12:57,506 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-17 00:12:57,509 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 00:12:57,512 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-17 00:12:57,518 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 24 treesize of output 12 [2023-02-17 00:12:57,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:12:57,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717668138] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:12:57,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 00:12:57,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 21 [2023-02-17 00:12:57,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377388003] [2023-02-17 00:12:57,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 00:12:57,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-17 00:12:57,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:12:57,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-17 00:12:57,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2023-02-17 00:12:57,541 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 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-17 00:12:57,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:12:57,808 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2023-02-17 00:12:57,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 00:12:57,810 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-17 00:12:57,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:12:57,810 INFO L225 Difference]: With dead ends: 37 [2023-02-17 00:12:57,810 INFO L226 Difference]: Without dead ends: 33 [2023-02-17 00:12:57,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2023-02-17 00:12:57,812 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 44 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 00:12:57,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 32 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 00:12:57,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-17 00:12:57,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2023-02-17 00:12:57,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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-17 00:12:57,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2023-02-17 00:12:57,819 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 16 [2023-02-17 00:12:57,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:12:57,819 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2023-02-17 00:12:57,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 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-17 00:12:57,819 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2023-02-17 00:12:57,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-17 00:12:57,820 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:12:57,820 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:12:57,829 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-17 00:12:58,026 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-17 00:12:58,027 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:12:58,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:12:58,027 INFO L85 PathProgramCache]: Analyzing trace with hash 680869797, now seen corresponding path program 1 times [2023-02-17 00:12:58,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:12:58,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214756972] [2023-02-17 00:12:58,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:12:58,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:12:58,045 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 00:12:58,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [912943235] [2023-02-17 00:12:58,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:12:58,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:12:58,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:12:58,047 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-17 00:12:58,049 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-17 00:12:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:12:58,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-17 00:12:58,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:12:58,109 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-17 00:12:58,119 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 23 treesize of output 7 [2023-02-17 00:12:58,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:12:58,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:12:58,146 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 18 treesize of output 16 [2023-02-17 00:12:58,148 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 34 treesize of output 28 [2023-02-17 00:12:58,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:12:58,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:12:58,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214756972] [2023-02-17 00:12:58,156 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 00:12:58,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912943235] [2023-02-17 00:12:58,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912943235] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:12:58,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:12:58,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2023-02-17 00:12:58,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734321248] [2023-02-17 00:12:58,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:12:58,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 00:12:58,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:12:58,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 00:12:58,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-17 00:12:58,159 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:12:58,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:12:58,202 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2023-02-17 00:12:58,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 00:12:58,203 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-17 00:12:58,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:12:58,204 INFO L225 Difference]: With dead ends: 38 [2023-02-17 00:12:58,204 INFO L226 Difference]: Without dead ends: 26 [2023-02-17 00:12:58,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-02-17 00:12:58,211 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:12:58,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 37 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:12:58,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-17 00:12:58,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2023-02-17 00:12:58,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:12:58,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-02-17 00:12:58,229 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2023-02-17 00:12:58,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:12:58,229 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-02-17 00:12:58,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:12:58,230 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-02-17 00:12:58,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 00:12:58,231 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:12:58,231 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:12:58,243 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-17 00:12:58,437 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-17 00:12:58,438 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:12:58,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:12:58,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1137819675, now seen corresponding path program 2 times [2023-02-17 00:12:58,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:12:58,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870800493] [2023-02-17 00:12:58,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:12:58,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:12:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:12:58,517 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:12:58,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:12:58,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870800493] [2023-02-17 00:12:58,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870800493] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:12:58,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420147120] [2023-02-17 00:12:58,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 00:12:58,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:12:58,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:12:58,519 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-17 00:12:58,522 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-17 00:12:58,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 00:12:58,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:12:58,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 00:12:58,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:12:58,607 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:12:58,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:12:58,635 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:12:58,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420147120] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:12:58,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 00:12:58,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-17 00:12:58,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324490061] [2023-02-17 00:12:58,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 00:12:58,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 00:12:58,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:12:58,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 00:12:58,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-17 00:12:58,638 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 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-17 00:12:58,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:12:58,750 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2023-02-17 00:12:58,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 00:12:58,750 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 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 18 [2023-02-17 00:12:58,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:12:58,753 INFO L225 Difference]: With dead ends: 33 [2023-02-17 00:12:58,753 INFO L226 Difference]: Without dead ends: 29 [2023-02-17 00:12:58,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-02-17 00:12:58,755 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 32 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 00:12:58,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 28 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 00:12:58,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-17 00:12:58,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2023-02-17 00:12:58,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:12:58,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2023-02-17 00:12:58,760 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2023-02-17 00:12:58,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:12:58,760 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2023-02-17 00:12:58,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 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-17 00:12:58,761 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2023-02-17 00:12:58,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 00:12:58,761 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:12:58,761 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:12:58,769 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-17 00:12:58,967 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-17 00:12:58,968 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:12:58,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:12:58,968 INFO L85 PathProgramCache]: Analyzing trace with hash -479454913, now seen corresponding path program 3 times [2023-02-17 00:12:58,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:12:58,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618712850] [2023-02-17 00:12:58,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:12:58,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:12:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:12:59,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:12:59,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:12:59,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618712850] [2023-02-17 00:12:59,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618712850] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:12:59,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428980005] [2023-02-17 00:12:59,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 00:12:59,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:12:59,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:12:59,027 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-17 00:12:59,030 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-17 00:12:59,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-17 00:12:59,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:12:59,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 00:12:59,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:12:59,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:12:59,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:12:59,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:12:59,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428980005] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:12:59,142 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 00:12:59,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-17 00:12:59,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156467310] [2023-02-17 00:12:59,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 00:12:59,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 00:12:59,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:12:59,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 00:12:59,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-17 00:12:59,145 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 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-17 00:12:59,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:12:59,212 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2023-02-17 00:12:59,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 00:12:59,212 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 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 19 [2023-02-17 00:12:59,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:12:59,213 INFO L225 Difference]: With dead ends: 37 [2023-02-17 00:12:59,213 INFO L226 Difference]: Without dead ends: 25 [2023-02-17 00:12:59,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-02-17 00:12:59,215 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 00:12:59,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 22 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 00:12:59,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-17 00:12:59,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2023-02-17 00:12:59,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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-17 00:12:59,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2023-02-17 00:12:59,223 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2023-02-17 00:12:59,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:12:59,223 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2023-02-17 00:12:59,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 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-17 00:12:59,224 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2023-02-17 00:12:59,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-17 00:12:59,224 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:12:59,225 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:12:59,232 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-17 00:12:59,430 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-17 00:12:59,430 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:12:59,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:12:59,431 INFO L85 PathProgramCache]: Analyzing trace with hash 634982145, now seen corresponding path program 4 times [2023-02-17 00:12:59,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:12:59,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335370728] [2023-02-17 00:12:59,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:12:59,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:12:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:12:59,749 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:12:59,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:12:59,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335370728] [2023-02-17 00:12:59,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335370728] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:12:59,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606241730] [2023-02-17 00:12:59,752 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 00:12:59,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:12:59,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:12:59,757 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-17 00:12:59,783 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-17 00:12:59,819 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 00:12:59,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:12:59,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-17 00:12:59,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:12:59,827 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-17 00:12:59,829 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-17 00:12:59,844 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-17 00:12:59,860 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-17 00:12:59,905 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-17 00:12:59,984 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:12:59,985 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 61 [2023-02-17 00:13:02,301 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:13:02,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 187 treesize of output 283 [2023-02-17 00:13:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:13:10,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:13:17,348 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:13:17,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606241730] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:13:17,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 00:13:17,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 36 [2023-02-17 00:13:17,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323017018] [2023-02-17 00:13:17,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 00:13:17,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-17 00:13:17,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:13:17,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-17 00:13:17,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1108, Unknown=10, NotChecked=0, Total=1260 [2023-02-17 00:13:17,357 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 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-17 00:13:20,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 00:13:24,903 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse13 (* (- 1) 5)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse23 (+ (* 5 |c_ULTIMATE.start_main_~i~0#1|) 5))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|v_ULTIMATE.start_main_~i~0#1_43| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_44| 4)))) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4))))) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_44| 0)) (< |v_ULTIMATE.start_main_~i~0#1_43| .cse0) (not (= .cse1 5)) (< (+ 5 (* |v_ULTIMATE.start_main_~i~0#1_43| 5)) (+ .cse1 .cse2 .cse3 1)) (not (<= |v_ULTIMATE.start_main_~i~0#1_43| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1))) (not (= 5 .cse2)))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_44| Int)) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_44| 0)) (forall ((|v_ULTIMATE.start_main_~i~0#1_43| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_43| 1) .cse0) (not (<= |v_ULTIMATE.start_main_~i~0#1_43| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_44| 4)))) (.cse8 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse6 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4))))) (or (not (= .cse6 5)) (< (+ 5 (* |v_ULTIMATE.start_main_~i~0#1_43| 5)) (+ .cse6 .cse7 .cse8 1)) (not (= 5 .cse7)))))))))))) (or (exists ((|v_ULTIMATE.start_main_~i~0#1_41| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_40| Int)) (and (<= |v_ULTIMATE.start_main_~i~0#1_41| (+ |v_ULTIMATE.start_main_~i~0#1_40| 1)) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~a~0#1.offset| Int)) (let ((.cse15 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse12 (select .cse15 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_41| 4)))) (.cse14 (select .cse15 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_40| 4))))) (and (= (+ (+ .cse11 (* (- 1) .cse12)) .cse13) 0) (= .cse12 .cse14) (= 5 .cse12) (= 5 .cse14))))) (not (= |ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)))) (<= |v_ULTIMATE.start_main_~i~0#1_40| 0))) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_41| 1)))) (exists ((|v_ULTIMATE.start_main_~i~0#1_41| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_40| Int)) (and (<= |v_ULTIMATE.start_main_~i~0#1_41| (+ |v_ULTIMATE.start_main_~i~0#1_40| 1)) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (exists ((|ULTIMATE.start_main_~a~0#1.offset| Int)) (let ((.cse19 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse17 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_41| 4)))) (let ((.cse16 (select .cse19 .cse17)) (.cse18 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_40| 4)))) (and (= (+ (+ .cse11 (* (- 1) .cse16)) .cse13) 0) (not (= .cse17 .cse18)) (= 5 .cse16) (= 5 (select .cse19 .cse18)))))) (not (= |ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)))) (<= |v_ULTIMATE.start_main_~i~0#1_40| 0))) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_41| 1))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (|v_ULTIMATE.start_main_~i~0#1_43| Int)) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse21 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_44| 4)))) (.cse22 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse20 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4))))) (or (< (+ .cse20 .cse21 .cse22 (- 6)) .cse23) (not (<= |v_ULTIMATE.start_main_~i~0#1_44| 0)) (< |v_ULTIMATE.start_main_~i~0#1_43| .cse0) (not (= .cse20 5)) (not (<= |v_ULTIMATE.start_main_~i~0#1_43| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1))) (not (= 5 .cse21)))))))) (or (exists ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_41| Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int)) (let ((.cse28 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse26 (select .cse28 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_41| 4)))) (.cse27 (select .cse28 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_40| 4))))) (and (<= |v_ULTIMATE.start_main_~i~0#1_41| (+ |v_ULTIMATE.start_main_~i~0#1_40| 1)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_41| 1)) (= (+ (+ .cse11 (* (- 1) .cse26)) .cse13) 0) (= .cse26 .cse27) (= 5 .cse26) (= 5 .cse27) (<= |v_ULTIMATE.start_main_~i~0#1_40| 0) (not (= |ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)))))) (exists ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|ULTIMATE.start_main_~a~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_41| Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int)) (let ((.cse32 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse30 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_41| 4)))) (let ((.cse29 (select .cse32 .cse30)) (.cse31 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_40| 4)))) (and (<= |v_ULTIMATE.start_main_~i~0#1_41| (+ |v_ULTIMATE.start_main_~i~0#1_40| 1)) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_41| 1)) (= (+ (+ .cse11 (* (- 1) .cse29)) .cse13) 0) (not (= .cse30 .cse31)) (= 5 .cse29) (= 5 (select .cse32 .cse31)) (<= |v_ULTIMATE.start_main_~i~0#1_40| 0) (not (= |ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|))))))) (<= 1 (+ (- 1) c_~N~0)) (forall ((|v_ULTIMATE.start_main_~i~0#1_44| Int)) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_44| 0)) (forall ((|v_ULTIMATE.start_main_~i~0#1_43| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_43| 1) .cse0) (not (<= |v_ULTIMATE.start_main_~i~0#1_43| (+ |v_ULTIMATE.start_main_~i~0#1_44| 1))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse34 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_44| 4)))) (.cse35 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse33 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4))))) (or (< (+ (- 1) .cse33 .cse34 .cse35) .cse23) (not (= .cse33 5)) (not (= 5 .cse34)))))))))))))) is different from false [2023-02-17 00:13:26,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 00:13:29,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 00:13:29,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:13:29,099 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2023-02-17 00:13:29,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-17 00:13:29,100 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 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 21 [2023-02-17 00:13:29,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:13:29,102 INFO L225 Difference]: With dead ends: 43 [2023-02-17 00:13:29,102 INFO L226 Difference]: Without dead ends: 39 [2023-02-17 00:13:29,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=354, Invalid=2393, Unknown=13, NotChecked=102, Total=2862 [2023-02-17 00:13:29,103 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 19 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 27 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2023-02-17 00:13:29,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 61 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 325 Invalid, 3 Unknown, 1 Unchecked, 6.8s Time] [2023-02-17 00:13:29,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-17 00:13:29,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 25. [2023-02-17 00:13:29,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:13:29,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-02-17 00:13:29,109 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 21 [2023-02-17 00:13:29,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:13:29,109 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-02-17 00:13:29,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 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-17 00:13:29,110 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-02-17 00:13:29,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-17 00:13:29,110 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:13:29,110 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:13:29,120 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-17 00:13:29,311 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-17 00:13:29,311 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:13:29,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:13:29,312 INFO L85 PathProgramCache]: Analyzing trace with hash 692240447, now seen corresponding path program 1 times [2023-02-17 00:13:29,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:13:29,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526282444] [2023-02-17 00:13:29,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:13:29,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:13:29,326 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 00:13:29,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1608901982] [2023-02-17 00:13:29,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:13:29,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:13:29,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:13:29,328 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-17 00:13:29,330 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-17 00:13:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:13:29,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-17 00:13:29,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:13:29,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-02-17 00:13:29,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:13:29,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-17 00:13:29,436 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 27 treesize of output 7 [2023-02-17 00:13:29,444 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:13:29,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:13:29,501 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:13:29,502 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-17 00:13:29,504 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:13:29,504 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 46 treesize of output 46 [2023-02-17 00:13:29,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-02-17 00:13:29,530 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:13:29,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:13:29,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526282444] [2023-02-17 00:13:29,532 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 00:13:29,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608901982] [2023-02-17 00:13:29,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608901982] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:13:29,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:13:29,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-02-17 00:13:29,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346911419] [2023-02-17 00:13:29,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:13:29,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-17 00:13:29,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:13:29,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-17 00:13:29,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=166, Unknown=4, NotChecked=0, Total=210 [2023-02-17 00:13:29,535 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 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-17 00:13:29,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:13:29,663 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2023-02-17 00:13:29,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 00:13:29,665 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 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-17 00:13:29,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:13:29,665 INFO L225 Difference]: With dead ends: 33 [2023-02-17 00:13:29,665 INFO L226 Difference]: Without dead ends: 26 [2023-02-17 00:13:29,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=268, Unknown=4, NotChecked=0, Total=342 [2023-02-17 00:13:29,666 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 23 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 00:13:29,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 56 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 00:13:29,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-17 00:13:29,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2023-02-17 00:13:29,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 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-17 00:13:29,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2023-02-17 00:13:29,671 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2023-02-17 00:13:29,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:13:29,671 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-02-17 00:13:29,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 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-17 00:13:29,671 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2023-02-17 00:13:29,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 00:13:29,672 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:13:29,672 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:13:29,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-17 00:13:29,880 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-17 00:13:29,881 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:13:29,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:13:29,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1038837147, now seen corresponding path program 5 times [2023-02-17 00:13:29,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:13:29,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934747619] [2023-02-17 00:13:29,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:13:29,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:13:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:13:30,011 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:13:30,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:13:30,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934747619] [2023-02-17 00:13:30,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934747619] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:13:30,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107052018] [2023-02-17 00:13:30,012 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-17 00:13:30,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:13:30,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:13:30,014 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-17 00:13:30,017 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-17 00:13:30,079 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-02-17 00:13:30,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:13:30,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 00:13:30,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:13:30,115 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:13:30,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:13:30,153 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:13:30,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107052018] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:13:30,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 00:13:30,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-02-17 00:13:30,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556310361] [2023-02-17 00:13:30,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 00:13:30,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 00:13:30,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:13:30,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 00:13:30,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-02-17 00:13:30,156 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:13:30,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:13:30,239 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2023-02-17 00:13:30,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 00:13:30,239 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-17 00:13:30,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:13:30,240 INFO L225 Difference]: With dead ends: 45 [2023-02-17 00:13:30,240 INFO L226 Difference]: Without dead ends: 30 [2023-02-17 00:13:30,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-02-17 00:13:30,241 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 21 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 00:13:30,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 32 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 00:13:30,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-17 00:13:30,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2023-02-17 00:13:30,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:13:30,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2023-02-17 00:13:30,251 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2023-02-17 00:13:30,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:13:30,252 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2023-02-17 00:13:30,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:13:30,253 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2023-02-17 00:13:30,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 00:13:30,254 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:13:30,254 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:13:30,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-17 00:13:30,460 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-17 00:13:30,461 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:13:30,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:13:30,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2121994781, now seen corresponding path program 6 times [2023-02-17 00:13:30,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:13:30,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842057603] [2023-02-17 00:13:30,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:13:30,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:13:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:13:30,972 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:13:30,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:13:30,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842057603] [2023-02-17 00:13:30,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842057603] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 00:13:30,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018551956] [2023-02-17 00:13:30,973 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-17 00:13:30,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:13:30,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:13:30,977 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-17 00:13:30,988 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-17 00:13:31,048 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-02-17 00:13:31,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:13:31,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-17 00:13:31,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:13:31,056 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-17 00:13:31,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:13:31,077 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-17 00:13:31,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:13:31,082 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-17 00:13:31,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:13:31,091 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-17 00:13:31,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:13:31,136 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-17 00:13:31,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:13:31,208 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:13:31,208 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 59 [2023-02-17 00:13:31,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:13:31,310 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:13:31,310 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 100 treesize of output 99 [2023-02-17 00:13:31,602 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:13:31,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 571 treesize of output 1787 [2023-02-17 00:13:31,659 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-17 00:13:31,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:14:02,815 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse18 (+ 0 1))) (let ((.cse19 (+ .cse18 1))) (let ((.cse2 (+ 5 (* .cse19 5))) (.cse7 (* .cse19 4)) (.cse9 (* .cse18 4)) (.cse10 (* 4 0))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_267 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_267))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse3 (select v_ArrVal_267 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10)))) (let ((.cse8 (+ (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse3))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse8)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse0 (+ .cse4 .cse8))) (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)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (< (+ (- 1) .cse0 .cse1) .cse2) (not (= 5 .cse1)) (not (= .cse3 5)) (not (= 5 .cse4)))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_267 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_267))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse13 (select v_ArrVal_267 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10)))) (let ((.cse17 (+ (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse13))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse17)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse11 (+ .cse14 .cse17))) (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)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (< .cse2 (+ .cse11 .cse12 1)) (not (= 5 .cse12)) (not (= .cse13 5)) (not (= 5 .cse14)))))))))))))) is different from false [2023-02-17 00:14:02,996 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2023-02-17 00:14:02,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018551956] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:14:02,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 00:14:02,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 16] total 43 [2023-02-17 00:14:02,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080067205] [2023-02-17 00:14:02,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 00:14:02,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-02-17 00:14:02,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:14:02,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-02-17 00:14:02,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1558, Unknown=9, NotChecked=80, Total=1806 [2023-02-17 00:14:03,000 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 43 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 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-17 00:14:06,634 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse18 (+ 0 1))) (let ((.cse19 (+ .cse18 1))) (let ((.cse2 (+ 5 (* .cse19 5))) (.cse7 (* .cse19 4)) (.cse9 (* .cse18 4)) (.cse10 (* 4 0))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_267 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_267))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse3 (select v_ArrVal_267 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10)))) (let ((.cse8 (+ (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse3))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse8)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse0 (+ .cse4 .cse8))) (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)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (< (+ (- 1) .cse0 .cse1) .cse2) (not (= 5 .cse1)) (not (= .cse3 5)) (not (= 5 .cse4)))))))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_267 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_267))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse13 (select v_ArrVal_267 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10)))) (let ((.cse17 (+ (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse13))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse17)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse11 (+ .cse14 .cse17))) (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)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (< .cse2 (+ .cse11 .cse12 1)) (not (= 5 .cse12)) (not (= .cse13 5)) (not (= 5 .cse14)))))))))) (<= (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) (+ (- 1) |c_ULTIMATE.start_main_~#sum~0#1.base|)))))) is different from false [2023-02-17 00:14:09,639 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse18 (+ 0 1))) (let ((.cse19 (+ .cse18 1))) (let ((.cse2 (+ 5 (* .cse19 5))) (.cse7 (* .cse19 4)) (.cse9 (* .cse18 4)) (.cse10 (* 4 0))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_267 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_267))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse3 (select v_ArrVal_267 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10)))) (let ((.cse8 (+ (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse3))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse8)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse0 (+ .cse4 .cse8))) (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)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (< (+ (- 1) .cse0 .cse1) .cse2) (not (= 5 .cse1)) (not (= .cse3 5)) (not (= 5 .cse4)))))))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_267 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_267))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse13 (select v_ArrVal_267 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10)))) (let ((.cse17 (+ (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse13))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse17)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse11 (+ .cse14 .cse17))) (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)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (< .cse2 (+ .cse11 .cse12 1)) (not (= 5 .cse12)) (not (= .cse13 5)) (not (= 5 .cse14)))))))))) (<= (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) (+ (- 1) |c_ULTIMATE.start_main_~#sum~0#1.base|)))))) is different from false [2023-02-17 00:14:13,617 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse18 (+ 0 1))) (let ((.cse19 (+ .cse18 1))) (let ((.cse2 (+ 5 (* .cse19 5))) (.cse7 (* .cse19 4)) (.cse9 (* .cse18 4)) (.cse10 (* 4 0))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_267 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_267))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse3 (select v_ArrVal_267 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10)))) (let ((.cse8 (+ (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse3))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse8)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse0 (+ .cse4 .cse8))) (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)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (< (+ (- 1) .cse0 .cse1) .cse2) (not (= 5 .cse1)) (not (= .cse3 5)) (not (= 5 .cse4)))))))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 0 (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|)) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_267 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_267))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse13 (select v_ArrVal_267 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10)))) (let ((.cse17 (+ (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse13))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse17)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse11 (+ .cse14 .cse17))) (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)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (< .cse2 (+ .cse11 .cse12 1)) (not (= 5 .cse12)) (not (= .cse13 5)) (not (= 5 .cse14)))))))))) (<= (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) (+ (- 1) |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from false [2023-02-17 00:14:17,018 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse18 (+ 0 1))) (let ((.cse19 (+ .cse18 1))) (let ((.cse2 (+ 5 (* .cse19 5))) (.cse7 (* .cse19 4)) (.cse9 (* .cse18 4)) (.cse10 (* 4 0))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_267 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_267))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse3 (select v_ArrVal_267 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10)))) (let ((.cse8 (+ (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse3))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse8)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse0 (+ .cse4 .cse8))) (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)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (< (+ (- 1) .cse0 .cse1) .cse2) (not (= 5 .cse1)) (not (= .cse3 5)) (not (= 5 .cse4)))))))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_267 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_267))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse13 (select v_ArrVal_267 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10)))) (let ((.cse17 (+ (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse13))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse17)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse11 (+ .cse14 .cse17))) (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)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (< .cse2 (+ .cse11 .cse12 1)) (not (= 5 .cse12)) (not (= .cse13 5)) (not (= 5 .cse14)))))))))) (<= (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) (+ (- 1) |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= 0 (+ (- 2) |c_ULTIMATE.start_main_~i~0#1|)) (<= |c_ULTIMATE.start_main_~i~0#1| 2))))) is different from false [2023-02-17 00:14:19,985 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse18 (+ 0 1))) (let ((.cse19 (+ .cse18 1))) (let ((.cse2 (+ 5 (* .cse19 5))) (.cse7 (* .cse19 4)) (.cse9 (* .cse18 4)) (.cse10 (* 4 0))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_267 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_267))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse3 (select v_ArrVal_267 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10)))) (let ((.cse8 (+ (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse3))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse8)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse0 (+ .cse4 .cse8))) (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)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (< (+ (- 1) .cse0 .cse1) .cse2) (not (= 5 .cse1)) (not (= .cse3 5)) (not (= 5 .cse4)))))))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_267 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_267))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse13 (select v_ArrVal_267 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10)))) (let ((.cse17 (+ (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse13))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse17)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse11 (+ .cse14 .cse17))) (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)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (< .cse2 (+ .cse11 .cse12 1)) (not (= 5 .cse12)) (not (= .cse13 5)) (not (= 5 .cse14)))))))))) (<= (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) (+ (- 1) |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= |c_ULTIMATE.start_main_~i~0#1| 2) (<= 0 (+ c_~N~0 (- 3))))))) is different from false [2023-02-17 00:14:23,697 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse18 (+ 0 1))) (let ((.cse19 (+ .cse18 1))) (let ((.cse2 (+ 5 (* .cse19 5))) (.cse7 (* .cse19 4)) (.cse9 (* .cse18 4)) (.cse10 (* 4 0))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_267 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_267))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse3 (select v_ArrVal_267 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10)))) (let ((.cse8 (+ (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse3))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse8)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse0 (+ .cse4 .cse8))) (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)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (< (+ (- 1) .cse0 .cse1) .cse2) (not (= 5 .cse1)) (not (= .cse3 5)) (not (= 5 .cse4)))))))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_267 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_267))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse13 (select v_ArrVal_267 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10)))) (let ((.cse17 (+ (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse13))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse17)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse11 (+ .cse14 .cse17))) (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)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (< .cse2 (+ .cse11 .cse12 1)) (not (= 5 .cse12)) (not (= .cse13 5)) (not (= 5 .cse14)))))))))) (<= (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) (+ (- 1) |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= |c_ULTIMATE.start_main_~i~0#1| 3) (<= 0 (+ c_~N~0 (- 3))))))) is different from false [2023-02-17 00:14:27,974 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse18 (+ 0 1))) (let ((.cse19 (+ .cse18 1))) (let ((.cse2 (+ 5 (* .cse19 5))) (.cse7 (* .cse19 4)) (.cse9 (* .cse18 4)) (.cse10 (* 4 0))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_267 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_267))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse3 (select v_ArrVal_267 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10)))) (let ((.cse8 (+ (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse3))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse8)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse0 (+ .cse4 .cse8))) (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)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (< (+ (- 1) .cse0 .cse1) .cse2) (not (= 5 .cse1)) (not (= .cse3 5)) (not (= 5 .cse4)))))))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_267 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_267))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse13 (select v_ArrVal_267 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10)))) (let ((.cse17 (+ (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse13))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse17)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse9)))) (let ((.cse11 (+ .cse14 .cse17))) (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)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse7)))) (or (< .cse2 (+ .cse11 .cse12 1)) (not (= 5 .cse12)) (not (= .cse13 5)) (not (= 5 .cse14)))))))))) (<= (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) (+ (- 1) |c_ULTIMATE.start_main_~#sum~0#1.base|)))))) is different from false [2023-02-17 00:14:39,242 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-17 00:14:43,700 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-17 00:14:52,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:14:52,208 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2023-02-17 00:14:52,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-02-17 00:14:52,209 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 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) Word has length 26 [2023-02-17 00:14:52,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:14:52,209 INFO L225 Difference]: With dead ends: 56 [2023-02-17 00:14:52,210 INFO L226 Difference]: Without dead ends: 50 [2023-02-17 00:14:52,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 71.8s TimeCoverageRelationStatistics Valid=515, Invalid=4329, Unknown=18, NotChecked=1144, Total=6006 [2023-02-17 00:14:52,212 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 42 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 29 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2023-02-17 00:14:52,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 77 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 387 Invalid, 2 Unknown, 42 Unchecked, 9.2s Time] [2023-02-17 00:14:52,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-17 00:14:52,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 28. [2023-02-17 00:14:52,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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-17 00:14:52,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-02-17 00:14:52,219 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 26 [2023-02-17 00:14:52,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:14:52,220 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-02-17 00:14:52,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 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-17 00:14:52,220 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2023-02-17 00:14:52,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 00:14:52,221 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:14:52,221 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:14:52,230 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-17 00:14:52,435 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-17 00:14:52,436 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:14:52,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:14:52,436 INFO L85 PathProgramCache]: Analyzing trace with hash -2064736479, now seen corresponding path program 2 times [2023-02-17 00:14:52,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:14:52,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235273470] [2023-02-17 00:14:52,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:14:52,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:14:52,446 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 00:14:52,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1128374411] [2023-02-17 00:14:52,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 00:14:52,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:14:52,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:14:52,448 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-17 00:14:52,453 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-17 00:14:52,525 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 00:14:52,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:14:52,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-17 00:14:52,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:14:52,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-02-17 00:14:52,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:14:52,894 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-17 00:14:53,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:14:53,047 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-17 00:14:53,315 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 23 treesize of output 7 [2023-02-17 00:14:53,448 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:14:53,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:14:53,784 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 5)) is different from false [2023-02-17 00:14:53,817 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 5)) is different from false [2023-02-17 00:14:53,849 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ 0 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2023-02-17 00:14:53,880 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:14:53,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2023-02-17 00:14:53,900 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:14:53,901 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 50 treesize of output 50 [2023-02-17 00:14:53,922 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 3 [2023-02-17 00:14:54,456 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2023-02-17 00:14:54,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:14:54,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235273470] [2023-02-17 00:14:54,457 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 00:14:54,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128374411] [2023-02-17 00:14:54,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128374411] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:14:54,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:14:54,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2023-02-17 00:14:54,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43181894] [2023-02-17 00:14:54,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:14:54,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-17 00:14:54,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:14:54,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-17 00:14:54,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2023-02-17 00:14:54,458 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 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-17 00:14:57,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:14:57,203 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2023-02-17 00:14:57,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 00:14:57,204 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-17 00:14:57,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:14:57,204 INFO L225 Difference]: With dead ends: 40 [2023-02-17 00:14:57,204 INFO L226 Difference]: Without dead ends: 33 [2023-02-17 00:14:57,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=91, Invalid=380, Unknown=3, NotChecked=126, Total=600 [2023-02-17 00:14:57,205 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:14:57,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 68 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 214 Invalid, 0 Unknown, 72 Unchecked, 2.0s Time] [2023-02-17 00:14:57,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-17 00:14:57,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2023-02-17 00:14:57,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 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-17 00:14:57,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2023-02-17 00:14:57,213 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 26 [2023-02-17 00:14:57,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:14:57,213 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2023-02-17 00:14:57,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 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-17 00:14:57,213 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2023-02-17 00:14:57,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-17 00:14:57,213 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:14:57,214 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:14:57,221 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-17 00:14:57,419 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-17 00:14:57,419 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:14:57,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:14:57,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1421579903, now seen corresponding path program 3 times [2023-02-17 00:14:57,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:14:57,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005798738] [2023-02-17 00:14:57,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:14:57,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:14:57,431 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 00:14:57,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [653788091] [2023-02-17 00:14:57,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 00:14:57,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:14:57,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:14:57,433 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-17 00:14:57,437 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-17 00:14:57,514 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-17 00:14:57,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:14:57,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 00:14:57,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:14:58,072 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:14:58,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:14:58,698 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:14:58,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:14:58,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005798738] [2023-02-17 00:14:58,698 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 00:14:58,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653788091] [2023-02-17 00:14:58,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653788091] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:14:58,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:14:58,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2023-02-17 00:14:58,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257492266] [2023-02-17 00:14:58,699 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:14:58,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-17 00:14:58,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:14:58,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-17 00:14:58,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2023-02-17 00:14:58,700 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 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-17 00:14:59,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:14:59,860 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2023-02-17 00:14:59,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 00:14:59,860 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 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-17 00:14:59,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:14:59,861 INFO L225 Difference]: With dead ends: 60 [2023-02-17 00:14:59,861 INFO L226 Difference]: Without dead ends: 39 [2023-02-17 00:14:59,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2023-02-17 00:14:59,862 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 35 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-17 00:14:59,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 27 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-17 00:14:59,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-17 00:14:59,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2023-02-17 00:14:59,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.125) internal successors, (36), 32 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-17 00:14:59,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2023-02-17 00:14:59,868 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 29 [2023-02-17 00:14:59,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:14:59,869 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2023-02-17 00:14:59,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 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-17 00:14:59,869 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2023-02-17 00:14:59,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-17 00:14:59,869 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:14:59,869 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:14:59,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-17 00:15:00,073 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-17 00:15:00,073 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:15:00,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:15:00,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1961716541, now seen corresponding path program 4 times [2023-02-17 00:15:00,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:15:00,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31574021] [2023-02-17 00:15:00,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:15:00,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:15:00,083 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 00:15:00,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1603952225] [2023-02-17 00:15:00,084 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 00:15:00,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:15:00,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:15:00,085 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-17 00:15:00,088 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-17 00:15:00,167 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 00:15:00,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:15:00,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-17 00:15:00,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:15:00,194 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-17 00:15:00,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-02-17 00:15:00,477 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-17 00:15:00,588 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-17 00:15:00,721 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-17 00:15:00,910 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:15:00,910 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 23 [2023-02-17 00:15:01,270 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-17 00:15:01,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:15:03,062 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:15:03,063 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 32 treesize of output 33 [2023-02-17 00:15:03,085 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:15:03,085 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 54 treesize of output 54 [2023-02-17 00:15:03,106 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 19 treesize of output 7 [2023-02-17 00:15:03,711 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:15:03,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:15:03,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31574021] [2023-02-17 00:15:03,712 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 00:15:03,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603952225] [2023-02-17 00:15:03,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603952225] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:15:03,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:15:03,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 28 [2023-02-17 00:15:03,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450046237] [2023-02-17 00:15:03,713 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:15:03,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-17 00:15:03,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:15:03,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-17 00:15:03,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2023-02-17 00:15:03,714 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 28 states, 28 states have (on average 1.75) internal successors, (49), 28 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-17 00:15:08,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:15:08,885 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2023-02-17 00:15:08,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-17 00:15:08,886 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.75) internal successors, (49), 28 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 31 [2023-02-17 00:15:08,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:15:08,886 INFO L225 Difference]: With dead ends: 48 [2023-02-17 00:15:08,886 INFO L226 Difference]: Without dead ends: 44 [2023-02-17 00:15:08,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=609, Invalid=1647, Unknown=0, NotChecked=0, Total=2256 [2023-02-17 00:15:08,888 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:15:08,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 56 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-02-17 00:15:08,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-17 00:15:08,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2023-02-17 00:15:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 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-17 00:15:08,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2023-02-17 00:15:08,897 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 31 [2023-02-17 00:15:08,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:15:08,897 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2023-02-17 00:15:08,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.75) internal successors, (49), 28 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-17 00:15:08,898 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2023-02-17 00:15:08,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-17 00:15:08,898 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:15:08,898 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:15:08,903 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-17 00:15:09,099 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-17 00:15:09,099 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:15:09,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:15:09,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1661543779, now seen corresponding path program 5 times [2023-02-17 00:15:09,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:15:09,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533843359] [2023-02-17 00:15:09,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:15:09,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:15:09,114 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 00:15:09,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1446603448] [2023-02-17 00:15:09,115 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-17 00:15:09,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:15:09,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:15:09,117 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-17 00:15:09,146 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-17 00:15:09,240 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-02-17 00:15:09,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:15:09,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 00:15:09,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:15:10,002 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:15:10,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:15:10,915 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:15:10,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:15:10,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533843359] [2023-02-17 00:15:10,916 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 00:15:10,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446603448] [2023-02-17 00:15:10,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446603448] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:15:10,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:15:10,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2023-02-17 00:15:10,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793717483] [2023-02-17 00:15:10,916 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:15:10,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-17 00:15:10,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:15:10,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-17 00:15:10,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2023-02-17 00:15:10,918 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 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-17 00:15:12,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:15:12,181 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2023-02-17 00:15:12,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 00:15:12,182 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 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 34 [2023-02-17 00:15:12,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:15:12,182 INFO L225 Difference]: With dead ends: 78 [2023-02-17 00:15:12,183 INFO L226 Difference]: Without dead ends: 50 [2023-02-17 00:15:12,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2023-02-17 00:15:12,184 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 55 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-17 00:15:12,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 26 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-17 00:15:12,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-17 00:15:12,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 37. [2023-02-17 00:15:12,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 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-17 00:15:12,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2023-02-17 00:15:12,194 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 34 [2023-02-17 00:15:12,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:15:12,194 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2023-02-17 00:15:12,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 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-17 00:15:12,194 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2023-02-17 00:15:12,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-17 00:15:12,195 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:15:12,195 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:15:12,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-02-17 00:15:12,400 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-17 00:15:12,401 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:15:12,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:15:12,401 INFO L85 PathProgramCache]: Analyzing trace with hash 83735393, now seen corresponding path program 6 times [2023-02-17 00:15:12,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:15:12,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664169347] [2023-02-17 00:15:12,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:15:12,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:15:12,412 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 00:15:12,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [385067260] [2023-02-17 00:15:12,413 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-17 00:15:12,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:15:12,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:15:12,414 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-17 00:15:12,426 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-17 00:15:12,520 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2023-02-17 00:15:12,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:15:12,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-17 00:15:12,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:15:12,719 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-17 00:15:12,824 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:15:12,824 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 27 treesize of output 62 [2023-02-17 00:15:13,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:15:13,247 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 22 treesize of output 24 [2023-02-17 00:15:13,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:15:13,391 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 22 treesize of output 24 [2023-02-17 00:15:13,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:15:13,554 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 22 treesize of output 24 [2023-02-17 00:15:13,903 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 00:15:13,903 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:15:13,903 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 27 treesize of output 14 [2023-02-17 00:15:14,523 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:15:14,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:15:18,325 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:15:18,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 82 [2023-02-17 00:15:18,346 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:15:18,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 105 [2023-02-17 00:15:18,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2023-02-17 00:15:19,634 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:15:19,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:15:19,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664169347] [2023-02-17 00:15:19,635 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 00:15:19,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385067260] [2023-02-17 00:15:19,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385067260] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:15:19,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:15:19,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2023-02-17 00:15:19,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051760312] [2023-02-17 00:15:19,636 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:15:19,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-17 00:15:19,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:15:19,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-17 00:15:19,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=946, Unknown=1, NotChecked=0, Total=1122 [2023-02-17 00:15:19,638 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 34 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 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-17 00:15:25,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:15:25,637 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2023-02-17 00:15:25,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-17 00:15:25,638 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 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) Word has length 36 [2023-02-17 00:15:25,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:15:25,638 INFO L225 Difference]: With dead ends: 52 [2023-02-17 00:15:25,638 INFO L226 Difference]: Without dead ends: 41 [2023-02-17 00:15:25,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=352, Invalid=1717, Unknown=1, NotChecked=0, Total=2070 [2023-02-17 00:15:25,640 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 56 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:15:25,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 64 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-02-17 00:15:25,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-02-17 00:15:25,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2023-02-17 00:15:25,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 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-17 00:15:25,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2023-02-17 00:15:25,651 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 36 [2023-02-17 00:15:25,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:15:25,651 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2023-02-17 00:15:25,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 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-17 00:15:25,652 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2023-02-17 00:15:25,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-17 00:15:25,652 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:15:25,653 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:15:25,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-17 00:15:25,857 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-17 00:15:25,857 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:15:25,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:15:25,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1146006857, now seen corresponding path program 7 times [2023-02-17 00:15:25,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:15:25,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113985810] [2023-02-17 00:15:25,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:15:25,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:15:25,868 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 00:15:25,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [80381002] [2023-02-17 00:15:25,868 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-17 00:15:25,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:15:25,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:15:25,870 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-17 00:15:25,873 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-17 00:15:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:15:25,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-17 00:15:25,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:15:26,986 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:15:26,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:15:28,252 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:15:28,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:15:28,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113985810] [2023-02-17 00:15:28,253 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 00:15:28,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80381002] [2023-02-17 00:15:28,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80381002] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:15:28,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:15:28,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2023-02-17 00:15:28,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948359082] [2023-02-17 00:15:28,253 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:15:28,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-17 00:15:28,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:15:28,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-17 00:15:28,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2023-02-17 00:15:28,254 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 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-17 00:15:30,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:15:30,588 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2023-02-17 00:15:30,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-17 00:15:30,589 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 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-17 00:15:30,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:15:30,589 INFO L225 Difference]: With dead ends: 86 [2023-02-17 00:15:30,589 INFO L226 Difference]: Without dead ends: 55 [2023-02-17 00:15:30,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2023-02-17 00:15:30,590 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 58 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-17 00:15:30,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 32 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-02-17 00:15:30,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-17 00:15:30,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2023-02-17 00:15:30,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:15:30,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2023-02-17 00:15:30,600 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 39 [2023-02-17 00:15:30,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:15:30,600 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2023-02-17 00:15:30,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 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-17 00:15:30,601 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2023-02-17 00:15:30,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-17 00:15:30,601 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:15:30,601 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:15:30,606 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-17 00:15:30,805 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-17 00:15:30,805 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:15:30,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:15:30,805 INFO L85 PathProgramCache]: Analyzing trace with hash 127479307, now seen corresponding path program 8 times [2023-02-17 00:15:30,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:15:30,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694651544] [2023-02-17 00:15:30,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:15:30,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:15:30,820 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 00:15:30,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1882207824] [2023-02-17 00:15:30,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 00:15:30,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:15:30,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:15:30,822 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-17 00:15:30,842 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-17 00:15:30,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 00:15:30,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:15:30,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-17 00:15:30,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:15:31,209 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-17 00:15:31,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:15:31,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 27 treesize of output 26 [2023-02-17 00:15:31,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:15:31,724 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-17 00:15:31,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:15:31,890 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-17 00:15:32,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:15:32,063 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-17 00:15:32,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:15:32,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 18 treesize of output 20 [2023-02-17 00:15:32,606 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:15:32,607 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 29 treesize of output 10 [2023-02-17 00:15:32,800 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 23 proven. 62 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 00:15:32,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:15:34,133 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_648 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_648) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2023-02-17 00:15:36,962 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:15:36,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 84 [2023-02-17 00:15:36,982 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:15:36,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 111 [2023-02-17 00:15:37,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2023-02-17 00:15:38,397 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 23 proven. 51 refuted. 0 times theorem prover too weak. 2 trivial. 11 not checked. [2023-02-17 00:15:38,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:15:38,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694651544] [2023-02-17 00:15:38,397 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 00:15:38,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882207824] [2023-02-17 00:15:38,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882207824] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:15:38,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:15:38,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2023-02-17 00:15:38,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829480152] [2023-02-17 00:15:38,398 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:15:38,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-17 00:15:38,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:15:38,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-17 00:15:38,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=746, Unknown=22, NotChecked=56, Total=930 [2023-02-17 00:15:38,400 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 31 states, 31 states have (on average 2.193548387096774) internal successors, (68), 31 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-17 00:15:46,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:15:46,261 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2023-02-17 00:15:46,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-17 00:15:46,261 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.193548387096774) internal successors, (68), 31 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-02-17 00:15:46,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:15:46,262 INFO L225 Difference]: With dead ends: 55 [2023-02-17 00:15:46,262 INFO L226 Difference]: Without dead ends: 46 [2023-02-17 00:15:46,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=145, Invalid=1097, Unknown=22, NotChecked=68, Total=1332 [2023-02-17 00:15:46,263 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2023-02-17 00:15:46,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 107 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 740 Invalid, 0 Unknown, 37 Unchecked, 6.7s Time] [2023-02-17 00:15:46,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-17 00:15:46,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2023-02-17 00:15:46,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 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-17 00:15:46,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2023-02-17 00:15:46,275 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 41 [2023-02-17 00:15:46,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:15:46,275 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2023-02-17 00:15:46,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.193548387096774) internal successors, (68), 31 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-17 00:15:46,275 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2023-02-17 00:15:46,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-17 00:15:46,276 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:15:46,276 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:15:46,282 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-17 00:15:46,481 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-17 00:15:46,481 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:15:46,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:15:46,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1349109153, now seen corresponding path program 9 times [2023-02-17 00:15:46,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:15:46,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504813833] [2023-02-17 00:15:46,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:15:46,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:15:46,492 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 00:15:46,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1733446485] [2023-02-17 00:15:46,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 00:15:46,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:15:46,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:15:46,494 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-17 00:15:46,501 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-17 00:15:46,643 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-02-17 00:15:46,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:15:46,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-17 00:15:46,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:15:47,965 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:15:47,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:15:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:15:49,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:15:49,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504813833] [2023-02-17 00:15:49,546 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 00:15:49,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733446485] [2023-02-17 00:15:49,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733446485] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:15:49,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:15:49,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2023-02-17 00:15:49,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478008543] [2023-02-17 00:15:49,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:15:49,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-17 00:15:49,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:15:49,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-17 00:15:49,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2023-02-17 00:15:49,548 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 24 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 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-17 00:15:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:15:52,358 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2023-02-17 00:15:52,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-17 00:15:52,358 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-02-17 00:15:52,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:15:52,359 INFO L225 Difference]: With dead ends: 94 [2023-02-17 00:15:52,359 INFO L226 Difference]: Without dead ends: 60 [2023-02-17 00:15:52,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 56 SyntacticMatches, 8 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=260, Invalid=732, Unknown=0, NotChecked=0, Total=992 [2023-02-17 00:15:52,360 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 54 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:15:52,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 33 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-02-17 00:15:52,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-17 00:15:52,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 47. [2023-02-17 00:15:52,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 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-17 00:15:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2023-02-17 00:15:52,378 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 44 [2023-02-17 00:15:52,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:15:52,378 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2023-02-17 00:15:52,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 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-17 00:15:52,379 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2023-02-17 00:15:52,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-17 00:15:52,380 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:15:52,380 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:15:52,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-02-17 00:15:52,585 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-17 00:15:52,587 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:15:52,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:15:52,587 INFO L85 PathProgramCache]: Analyzing trace with hash 568845021, now seen corresponding path program 10 times [2023-02-17 00:15:52,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:15:52,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245492435] [2023-02-17 00:15:52,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:15:52,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:15:52,598 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 00:15:52,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [934950328] [2023-02-17 00:15:52,598 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 00:15:52,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:15:52,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:15:52,600 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-17 00:15:52,611 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-17 00:15:52,763 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 00:15:52,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:15:52,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-17 00:15:52,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:15:52,786 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-17 00:15:52,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-02-17 00:15:52,918 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 29 treesize of output 28 [2023-02-17 00:15:53,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-17 00:15:53,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-17 00:15:53,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-17 00:15:53,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-17 00:15:53,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-17 00:15:53,550 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:15:53,550 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 25 treesize of output 25 [2023-02-17 00:15:54,120 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-02-17 00:15:54,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:16:00,145 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 (Array Int Int)) (v_ArrVal_789 Int) (|v_ULTIMATE.start_main_~i~0#1_249| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (+ 2 |v_ULTIMATE.start_main_~i~0#1_249|))) (or (< .cse0 .cse1) (= 5 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_789)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_795) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_249| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< .cse1 .cse0)))) is different from false [2023-02-17 00:16:00,276 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 5 proven. 56 refuted. 0 times theorem prover too weak. 51 trivial. 7 not checked. [2023-02-17 00:16:00,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:16:00,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245492435] [2023-02-17 00:16:00,277 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 00:16:00,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934950328] [2023-02-17 00:16:00,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934950328] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:16:00,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:16:00,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 19 [2023-02-17 00:16:00,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045446071] [2023-02-17 00:16:00,277 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:16:00,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-17 00:16:00,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:16:00,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-17 00:16:00,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=4, NotChecked=32, Total=342 [2023-02-17 00:16:00,279 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:16:02,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:16:02,965 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2023-02-17 00:16:02,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-17 00:16:02,965 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-02-17 00:16:02,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:16:02,966 INFO L225 Difference]: With dead ends: 56 [2023-02-17 00:16:02,966 INFO L226 Difference]: Without dead ends: 52 [2023-02-17 00:16:02,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=245, Invalid=684, Unknown=5, NotChecked=58, Total=992 [2023-02-17 00:16:02,968 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 35 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-02-17 00:16:02,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 32 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 160 Invalid, 0 Unknown, 25 Unchecked, 1.6s Time] [2023-02-17 00:16:02,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-17 00:16:02,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2023-02-17 00:16:02,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 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-17 00:16:02,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2023-02-17 00:16:02,980 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 46 [2023-02-17 00:16:02,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:16:02,980 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2023-02-17 00:16:02,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:16:02,980 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2023-02-17 00:16:02,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-17 00:16:02,981 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:16:02,981 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:16:02,988 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-17 00:16:03,181 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-17 00:16:03,182 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:16:03,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:16:03,182 INFO L85 PathProgramCache]: Analyzing trace with hash 60090633, now seen corresponding path program 11 times [2023-02-17 00:16:03,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:16:03,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217743877] [2023-02-17 00:16:03,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:16:03,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:16:03,195 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 00:16:03,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [768024584] [2023-02-17 00:16:03,196 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-17 00:16:03,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:16:03,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:16:03,197 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-17 00:16:03,211 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-17 00:16:03,648 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2023-02-17 00:16:03,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:16:03,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 00:16:03,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:16:05,261 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 92 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:16:05,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:16:07,381 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 92 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:16:07,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:16:07,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217743877] [2023-02-17 00:16:07,382 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 00:16:07,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768024584] [2023-02-17 00:16:07,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768024584] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:16:07,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:16:07,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 27 [2023-02-17 00:16:07,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398293871] [2023-02-17 00:16:07,383 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:16:07,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-17 00:16:07,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:16:07,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-17 00:16:07,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2023-02-17 00:16:07,385 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 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-17 00:16:10,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:16:10,289 INFO L93 Difference]: Finished difference Result 120 states and 137 transitions. [2023-02-17 00:16:10,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-17 00:16:10,290 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 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 49 [2023-02-17 00:16:10,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:16:10,291 INFO L225 Difference]: With dead ends: 120 [2023-02-17 00:16:10,291 INFO L226 Difference]: Without dead ends: 75 [2023-02-17 00:16:10,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 62 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=324, Invalid=936, Unknown=0, NotChecked=0, Total=1260 [2023-02-17 00:16:10,292 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 77 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:16:10,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 34 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-02-17 00:16:10,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-17 00:16:10,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2023-02-17 00:16:10,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 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-17 00:16:10,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2023-02-17 00:16:10,304 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 49 [2023-02-17 00:16:10,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:16:10,304 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2023-02-17 00:16:10,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 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-17 00:16:10,305 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2023-02-17 00:16:10,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-17 00:16:10,305 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:16:10,305 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:16:10,314 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-17 00:16:10,513 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-17 00:16:10,513 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:16:10,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:16:10,514 INFO L85 PathProgramCache]: Analyzing trace with hash -519119029, now seen corresponding path program 12 times [2023-02-17 00:16:10,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:16:10,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185445002] [2023-02-17 00:16:10,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:16:10,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:16:10,526 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 00:16:10,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [776605901] [2023-02-17 00:16:10,527 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-17 00:16:10,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:16:10,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:16:10,528 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-17 00:16:10,555 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-17 00:16:10,773 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2023-02-17 00:16:10,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:16:10,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-17 00:16:10,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:16:11,229 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-17 00:16:11,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:16:11,516 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-17 00:16:11,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:16:11,718 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-17 00:16:12,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:16:12,029 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-17 00:16:12,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:16:12,218 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-17 00:16:12,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:16:12,412 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-17 00:16:12,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:16:12,624 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-17 00:16:12,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:16:12,842 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-17 00:16:13,261 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 23 treesize of output 7 [2023-02-17 00:16:13,499 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 46 proven. 103 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 00:16:13,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:16:13,981 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_958 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 5)) is different from false [2023-02-17 00:16:14,009 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_958 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2023-02-17 00:16:15,031 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_958 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1) 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 5)) is different from false [2023-02-17 00:16:15,061 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_958 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ (+ (+ 0 1) 1) 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2023-02-17 00:16:18,654 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_950 Int) (|v_ULTIMATE.start_main_~i~0#1_310| Int) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_953 Int)) (or (= 5 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_950) (+ (* |v_ULTIMATE.start_main_~i~0#1_310| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_953)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ (+ (+ 0 1) 1) 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_310|)))) is different from false [2023-02-17 00:16:20,669 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_311| Int)) (or (forall ((v_ArrVal_950 Int) (|v_ULTIMATE.start_main_~i~0#1_310| Int) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_953 Int)) (or (= 5 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_311| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_950) (+ (* |v_ULTIMATE.start_main_~i~0#1_310| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_953)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ (+ (+ 0 1) 1) 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_311| 1) |v_ULTIMATE.start_main_~i~0#1_310|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_311|)))) is different from false [2023-02-17 00:16:20,701 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:16:20,702 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 3 case distinctions, treesize of input 50 treesize of output 183 [2023-02-17 00:16:20,722 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:16:20,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 212 treesize of output 232 [2023-02-17 00:16:20,793 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 19 treesize of output 3 [2023-02-17 00:16:23,073 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 7 trivial. 59 not checked. [2023-02-17 00:16:23,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:16:23,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185445002] [2023-02-17 00:16:23,074 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 00:16:23,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776605901] [2023-02-17 00:16:23,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776605901] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:16:23,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:16:23,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 38 [2023-02-17 00:16:23,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951748334] [2023-02-17 00:16:23,075 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:16:23,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-17 00:16:23,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:16:23,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-17 00:16:23,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=882, Unknown=16, NotChecked=390, Total=1406 [2023-02-17 00:16:23,076 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 38 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 38 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-17 00:16:33,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:16:33,158 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2023-02-17 00:16:33,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-17 00:16:33,159 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 38 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) Word has length 51 [2023-02-17 00:16:33,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:16:33,159 INFO L225 Difference]: With dead ends: 72 [2023-02-17 00:16:33,159 INFO L226 Difference]: Without dead ends: 60 [2023-02-17 00:16:33,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=169, Invalid=1399, Unknown=16, NotChecked=486, Total=2070 [2023-02-17 00:16:33,161 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 263 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2023-02-17 00:16:33,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 103 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 820 Invalid, 0 Unknown, 263 Unchecked, 7.8s Time] [2023-02-17 00:16:33,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-17 00:16:33,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2023-02-17 00:16:33,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:16:33,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2023-02-17 00:16:33,178 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 51 [2023-02-17 00:16:33,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:16:33,179 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2023-02-17 00:16:33,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 38 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-17 00:16:33,179 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2023-02-17 00:16:33,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-17 00:16:33,179 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:16:33,180 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:16:33,186 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-17 00:16:33,386 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-17 00:16:33,387 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:16:33,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:16:33,387 INFO L85 PathProgramCache]: Analyzing trace with hash -115678185, now seen corresponding path program 13 times [2023-02-17 00:16:33,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:16:33,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848944047] [2023-02-17 00:16:33,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:16:33,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:16:33,411 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 00:16:33,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1651420640] [2023-02-17 00:16:33,412 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-17 00:16:33,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:16:33,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:16:33,413 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-17 00:16:33,437 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-17 00:16:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:16:33,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-17 00:16:33,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:16:35,576 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 117 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:16:35,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:16:38,149 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 117 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:16:38,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:16:38,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848944047] [2023-02-17 00:16:38,149 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 00:16:38,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651420640] [2023-02-17 00:16:38,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651420640] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:16:38,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:16:38,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 30 [2023-02-17 00:16:38,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831949160] [2023-02-17 00:16:38,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:16:38,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-17 00:16:38,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:16:38,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-17 00:16:38,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=651, Unknown=0, NotChecked=0, Total=870 [2023-02-17 00:16:38,152 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 30 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 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-17 00:16:42,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:16:42,241 INFO L93 Difference]: Finished difference Result 128 states and 145 transitions. [2023-02-17 00:16:42,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-17 00:16:42,243 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 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 54 [2023-02-17 00:16:42,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:16:42,243 INFO L225 Difference]: With dead ends: 128 [2023-02-17 00:16:42,243 INFO L226 Difference]: Without dead ends: 80 [2023-02-17 00:16:42,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 68 SyntacticMatches, 10 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=395, Invalid=1165, Unknown=0, NotChecked=0, Total=1560 [2023-02-17 00:16:42,245 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 113 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:16:42,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 42 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-02-17 00:16:42,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-17 00:16:42,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 57. [2023-02-17 00:16:42,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 56 states have internal predecessors, (61), 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-17 00:16:42,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2023-02-17 00:16:42,261 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 54 [2023-02-17 00:16:42,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:16:42,261 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2023-02-17 00:16:42,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 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-17 00:16:42,262 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2023-02-17 00:16:42,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-17 00:16:42,262 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:16:42,262 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:16:42,273 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-17 00:16:42,472 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-17 00:16:42,472 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:16:42,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:16:42,472 INFO L85 PathProgramCache]: Analyzing trace with hash -670398699, now seen corresponding path program 14 times [2023-02-17 00:16:42,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:16:42,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687912207] [2023-02-17 00:16:42,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:16:42,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:16:42,487 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 00:16:42,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [559192865] [2023-02-17 00:16:42,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 00:16:42,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:16:42,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:16:42,489 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-17 00:16:42,493 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-17 00:16:42,600 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 00:16:42,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:16:42,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-17 00:16:42,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:16:43,142 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-17 00:16:43,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:16:43,484 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-17 00:16:43,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:16:43,699 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-17 00:16:44,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:16:44,078 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-17 00:16:44,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:16:44,299 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-17 00:16:44,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:16:44,528 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-17 00:16:44,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:16:44,769 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-17 00:16:45,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:16:45,028 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-17 00:16:45,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:16:45,279 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-17 00:16:45,774 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:16:45,774 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 27 treesize of output 10 [2023-02-17 00:16:46,040 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 54 proven. 137 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 00:16:46,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:16:46,608 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1138 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2023-02-17 00:16:47,166 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1138 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2023-02-17 00:16:47,198 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1138 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2023-02-17 00:16:47,950 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1138 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ (+ (+ (+ |c_ULTIMATE.start_main_~i~0#1| 1) 1) 1) 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2023-02-17 00:16:47,982 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ (+ (+ (+ 0 1) 1) 1) 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 5)) is different from false [2023-02-17 00:16:56,163 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_378| Int) (v_ArrVal_1130 Int) (v_ArrVal_1132 Int) (v_ArrVal_1138 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1130) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_378| 4)) v_ArrVal_1132)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ (+ (+ (+ 0 1) 1) 1) 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 5) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_378|)))) is different from false [2023-02-17 00:16:58,184 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_379| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_378| Int) (v_ArrVal_1130 Int) (v_ArrVal_1132 Int) (v_ArrVal_1138 (Array Int Int))) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_379| 1) |v_ULTIMATE.start_main_~i~0#1_378|)) (= 5 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_379| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1130) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_378| 4)) v_ArrVal_1132)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (+ (+ (+ (+ (+ (+ 0 1) 1) 1) 1) 1) 1) 4) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_379|)))) is different from false [2023-02-17 00:16:58,215 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:16:58,216 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 3 case distinctions, treesize of input 52 treesize of output 185 [2023-02-17 00:16:58,236 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:16:58,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 216 treesize of output 240 [2023-02-17 00:16:58,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 21 treesize of output 3 [2023-02-17 00:17:00,934 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 53 proven. 58 refuted. 0 times theorem prover too weak. 7 trivial. 80 not checked. [2023-02-17 00:17:00,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:17:00,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687912207] [2023-02-17 00:17:00,935 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 00:17:00,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559192865] [2023-02-17 00:17:00,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559192865] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:17:00,935 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:17:00,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 42 [2023-02-17 00:17:00,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841893679] [2023-02-17 00:17:00,935 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:17:00,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-02-17 00:17:00,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:17:00,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-02-17 00:17:00,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1066, Unknown=21, NotChecked=504, Total=1722 [2023-02-17 00:17:00,937 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 42 states, 42 states have (on average 2.1904761904761907) internal successors, (92), 42 states have internal predecessors, (92), 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-17 00:17:14,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:17:14,612 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2023-02-17 00:17:14,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-17 00:17:14,613 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.1904761904761907) internal successors, (92), 42 states have internal predecessors, (92), 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 56 [2023-02-17 00:17:14,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:17:14,614 INFO L225 Difference]: With dead ends: 77 [2023-02-17 00:17:14,614 INFO L226 Difference]: Without dead ends: 65 [2023-02-17 00:17:14,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 70 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=187, Invalid=1712, Unknown=21, NotChecked=630, Total=2550 [2023-02-17 00:17:14,615 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 19 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 374 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2023-02-17 00:17:14,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 126 Invalid, 1528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1132 Invalid, 0 Unknown, 374 Unchecked, 10.9s Time] [2023-02-17 00:17:14,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-17 00:17:14,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2023-02-17 00:17:14,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 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-17 00:17:14,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2023-02-17 00:17:14,632 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 56 [2023-02-17 00:17:14,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:17:14,632 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2023-02-17 00:17:14,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.1904761904761907) internal successors, (92), 42 states have internal predecessors, (92), 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-17 00:17:14,633 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2023-02-17 00:17:14,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-17 00:17:14,633 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:17:14,633 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:17:14,638 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-17 00:17:14,833 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-17 00:17:14,834 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:17:14,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:17:14,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1467633651, now seen corresponding path program 15 times [2023-02-17 00:17:14,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:17:14,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738561644] [2023-02-17 00:17:14,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:17:14,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:17:14,849 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 00:17:14,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [244097588] [2023-02-17 00:17:14,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 00:17:14,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:17:14,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:17:14,851 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-17 00:17:14,875 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-17 00:17:15,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-02-17 00:17:15,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:17:15,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-17 00:17:15,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:17:17,546 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 145 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:17:17,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:17:20,368 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 145 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:17:20,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:17:20,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738561644] [2023-02-17 00:17:20,368 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 00:17:20,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244097588] [2023-02-17 00:17:20,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244097588] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:17:20,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:17:20,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 33 [2023-02-17 00:17:20,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350776050] [2023-02-17 00:17:20,369 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:17:20,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-17 00:17:20,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:17:20,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-17 00:17:20,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2023-02-17 00:17:20,371 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 33 states, 33 states have (on average 2.6666666666666665) internal successors, (88), 33 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-17 00:17:23,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:17:23,992 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2023-02-17 00:17:23,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-17 00:17:23,993 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.6666666666666665) internal successors, (88), 33 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) Word has length 59 [2023-02-17 00:17:23,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:17:23,993 INFO L225 Difference]: With dead ends: 136 [2023-02-17 00:17:23,993 INFO L226 Difference]: Without dead ends: 85 [2023-02-17 00:17:23,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 74 SyntacticMatches, 11 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=473, Invalid=1419, Unknown=0, NotChecked=0, Total=1892 [2023-02-17 00:17:23,994 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 119 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-02-17 00:17:23,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 34 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-02-17 00:17:23,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-17 00:17:24,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 62. [2023-02-17 00:17:24,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 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-17 00:17:24,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2023-02-17 00:17:24,009 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 59 [2023-02-17 00:17:24,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:17:24,010 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2023-02-17 00:17:24,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.6666666666666665) internal successors, (88), 33 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-17 00:17:24,010 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2023-02-17 00:17:24,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-17 00:17:24,010 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:17:24,010 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:17:24,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-02-17 00:17:24,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:17:24,211 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:17:24,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:17:24,211 INFO L85 PathProgramCache]: Analyzing trace with hash -377865265, now seen corresponding path program 16 times [2023-02-17 00:17:24,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:17:24,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409036985] [2023-02-17 00:17:24,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:17:24,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:17:24,228 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 00:17:24,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1245250326] [2023-02-17 00:17:24,229 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 00:17:24,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:17:24,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:17:24,230 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 00:17:24,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-02-17 00:17:24,474 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 00:17:24,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:17:24,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-17 00:17:24,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:17: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 15 treesize of output 11 [2023-02-17 00:17:24,606 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 29 treesize of output 28 [2023-02-17 00:17:24,689 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 31 treesize of output 30 [2023-02-17 00:17:25,174 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:17:25,174 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 27 treesize of output 74 [2023-02-17 00:17:25,558 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 00:17:25,559 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 00:17:25,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 218 treesize of output 614