./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/condg.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/condg.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 2909e53e12aac54327f6ce090ad489c978c1fbcfb0ae8bd4172abe8a99b2cb53 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:15:17,617 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:15:17,619 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:15:17,664 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:15:17,665 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:15:17,666 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:15:17,668 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:15:17,670 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:15:17,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:15:17,677 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:15:17,678 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:15:17,680 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:15:17,680 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:15:17,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:15:17,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:15:17,686 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:15:17,687 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:15:17,689 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:15:17,690 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:15:17,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:15:17,696 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:15:17,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:15:17,698 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:15:17,699 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:15:17,700 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:15:17,705 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:15:17,705 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:15:17,705 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:15:17,706 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:15:17,707 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:15:17,708 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:15:17,708 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:15:17,709 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:15:17,710 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:15:17,710 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:15:17,711 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:15:17,711 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:15:17,712 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:15:17,712 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:15:17,712 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:15:17,713 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:15:17,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:15:17,716 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:15:17,746 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:15:17,747 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:15:17,747 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:15:17,747 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:15:17,748 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:15:17,748 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:15:17,749 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:15:17,749 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:15:17,749 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:15:17,750 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:15:17,750 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:15:17,750 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:15:17,750 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:15:17,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:15:17,751 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:15:17,751 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:15:17,751 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:15:17,751 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:15:17,751 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:15:17,752 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:15:17,753 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:15:17,753 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:15:17,753 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:15:17,753 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:15:17,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:15:17,754 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:15:17,754 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:15:17,754 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:15:17,754 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:15:17,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:15:17,755 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:15:17,755 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:15:17,755 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:15:17,755 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2909e53e12aac54327f6ce090ad489c978c1fbcfb0ae8bd4172abe8a99b2cb53 [2022-07-11 23:15:17,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:15:17,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:15:17,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:15:17,976 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:15:17,976 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:15:17,978 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/condg.c [2022-07-11 23:15:18,049 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50144dbbc/7e59279b2830483c9d1e334a96e4d82f/FLAG5cd1b82df [2022-07-11 23:15:18,420 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:15:18,420 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condg.c [2022-07-11 23:15:18,426 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50144dbbc/7e59279b2830483c9d1e334a96e4d82f/FLAG5cd1b82df [2022-07-11 23:15:18,827 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50144dbbc/7e59279b2830483c9d1e334a96e4d82f [2022-07-11 23:15:18,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:15:18,830 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:15:18,832 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:15:18,832 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:15:18,834 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:15:18,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:15:18" (1/1) ... [2022-07-11 23:15:18,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@365c15a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:15:18, skipping insertion in model container [2022-07-11 23:15:18,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:15:18" (1/1) ... [2022-07-11 23:15:18,842 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:15:18,853 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:15:18,981 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condg.c[588,601] [2022-07-11 23:15:18,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:15:19,003 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:15:19,013 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/condg.c[588,601] [2022-07-11 23:15:19,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:15:19,036 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:15:19,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:15:19 WrapperNode [2022-07-11 23:15:19,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:15:19,042 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:15:19,043 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:15:19,043 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:15:19,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:15:19" (1/1) ... [2022-07-11 23:15:19,053 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:15:19" (1/1) ... [2022-07-11 23:15:19,067 INFO L137 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2022-07-11 23:15:19,068 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:15:19,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:15:19,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:15:19,069 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:15:19,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:15:19" (1/1) ... [2022-07-11 23:15:19,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:15:19" (1/1) ... [2022-07-11 23:15:19,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:15:19" (1/1) ... [2022-07-11 23:15:19,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:15:19" (1/1) ... [2022-07-11 23:15:19,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:15:19" (1/1) ... [2022-07-11 23:15:19,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:15:19" (1/1) ... [2022-07-11 23:15:19,087 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:15:19" (1/1) ... [2022-07-11 23:15:19,089 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:15:19,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:15:19,090 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:15:19,090 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:15:19,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:15:19" (1/1) ... [2022-07-11 23:15:19,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:15:19,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:15:19,129 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-11 23:15:19,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-11 23:15:19,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:15:19,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:15:19,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-11 23:15:19,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 23:15:19,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-11 23:15:19,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:15:19,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:15:19,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 23:15:19,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-11 23:15:19,227 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:15:19,228 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:15:19,341 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:15:19,346 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:15:19,346 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-11 23:15:19,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:15:19 BoogieIcfgContainer [2022-07-11 23:15:19,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:15:19,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:15:19,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:15:19,353 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:15:19,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:15:18" (1/3) ... [2022-07-11 23:15:19,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c68d52b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:15:19, skipping insertion in model container [2022-07-11 23:15:19,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:15:19" (2/3) ... [2022-07-11 23:15:19,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c68d52b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:15:19, skipping insertion in model container [2022-07-11 23:15:19,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:15:19" (3/3) ... [2022-07-11 23:15:19,356 INFO L111 eAbstractionObserver]: Analyzing ICFG condg.c [2022-07-11 23:15:19,368 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:15:19,368 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:15:19,409 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:15:19,415 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2a12c99, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@47ad79ce [2022-07-11 23:15:19,416 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:15:19,419 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 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) [2022-07-11 23:15:19,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-11 23:15:19,425 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:15:19,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:15:19,426 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:15:19,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:15:19,435 INFO L85 PathProgramCache]: Analyzing trace with hash -592817118, now seen corresponding path program 1 times [2022-07-11 23:15:19,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:15:19,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28158259] [2022-07-11 23:15:19,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:15:19,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:15:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:15:19,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:15:19,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:15:19,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28158259] [2022-07-11 23:15:19,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28158259] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:15:19,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:15:19,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 23:15:19,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928788987] [2022-07-11 23:15:19,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:15:19,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-11 23:15:19,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:15:19,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-11 23:15:19,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 23:15:19,618 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 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) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:15:19,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:15:19,638 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2022-07-11 23:15:19,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-11 23:15:19,641 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-11 23:15:19,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:15:19,648 INFO L225 Difference]: With dead ends: 46 [2022-07-11 23:15:19,648 INFO L226 Difference]: Without dead ends: 21 [2022-07-11 23:15:19,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 23:15:19,658 INFO L413 NwaCegarLoop]: 30 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, 30 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:15:19,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:15:19,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-11 23:15:19,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-11 23:15:19,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:15:19,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-07-11 23:15:19,690 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2022-07-11 23:15:19,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:15:19,691 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-07-11 23:15:19,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:15:19,692 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-07-11 23:15:19,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-11 23:15:19,693 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:15:19,693 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:15:19,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:15:19,694 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:15:19,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:15:19,695 INFO L85 PathProgramCache]: Analyzing trace with hash 108247460, now seen corresponding path program 1 times [2022-07-11 23:15:19,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:15:19,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452776683] [2022-07-11 23:15:19,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:15:19,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:15:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:15:19,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:15:19,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:15:19,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452776683] [2022-07-11 23:15:19,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452776683] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:15:19,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:15:19,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:15:19,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361854590] [2022-07-11 23:15:19,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:15:19,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:15:19,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:15:19,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:15:19,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:15:19,837 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:15:19,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:15:19,891 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-07-11 23:15:19,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:15:19,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-11 23:15:19,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:15:19,892 INFO L225 Difference]: With dead ends: 48 [2022-07-11 23:15:19,892 INFO L226 Difference]: Without dead ends: 34 [2022-07-11 23:15:19,893 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 [2022-07-11 23:15:19,894 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 41 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:15:19,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 16 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:15:19,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-11 23:15:19,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 24. [2022-07-11 23:15:19,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 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) [2022-07-11 23:15:19,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-11 23:15:19,900 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2022-07-11 23:15:19,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:15:19,901 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-11 23:15:19,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:15:19,901 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-11 23:15:19,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-11 23:15:19,902 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:15:19,902 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:15:19,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:15:19,903 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:15:19,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:15:19,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1242970242, now seen corresponding path program 1 times [2022-07-11 23:15:19,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:15:19,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435504090] [2022-07-11 23:15:19,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:15:19,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:15:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:15:20,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:15:20,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:15:20,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435504090] [2022-07-11 23:15:20,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435504090] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:15:20,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125309289] [2022-07-11 23:15:20,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:15:20,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:15:20,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:15:20,263 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:15:20,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-11 23:15:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:15:20,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-11 23:15:20,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:15:20,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-11 23:15:20,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 14 [2022-07-11 23:15:20,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:15:20,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 20 [2022-07-11 23:15:20,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:15:20,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:15:20,759 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_44 (Array Int Int))) (= (+ (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_44) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)) is different from false [2022-07-11 23:15:20,796 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:15:20,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-11 23:15:20,810 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:15:20,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-07-11 23:15:20,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-11 23:15:20,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-11 23:15:20,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125309289] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:15:20,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:15:20,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2022-07-11 23:15:20,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892652162] [2022-07-11 23:15:20,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:15:20,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-11 23:15:20,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:15:20,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-11 23:15:20,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=193, Unknown=1, NotChecked=28, Total=272 [2022-07-11 23:15:20,859 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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) [2022-07-11 23:15:21,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:15:21,097 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2022-07-11 23:15:21,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-11 23:15:21,098 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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 21 [2022-07-11 23:15:21,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:15:21,101 INFO L225 Difference]: With dead ends: 56 [2022-07-11 23:15:21,101 INFO L226 Difference]: Without dead ends: 54 [2022-07-11 23:15:21,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=370, Unknown=1, NotChecked=40, Total=506 [2022-07-11 23:15:21,102 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 62 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:15:21,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 96 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 158 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2022-07-11 23:15:21,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-11 23:15:21,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 33. [2022-07-11 23:15:21,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:15:21,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2022-07-11 23:15:21,109 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 21 [2022-07-11 23:15:21,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:15:21,110 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-07-11 23:15:21,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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) [2022-07-11 23:15:21,110 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-07-11 23:15:21,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-11 23:15:21,114 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:15:21,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:15:21,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-11 23:15:21,315 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 [2022-07-11 23:15:21,315 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:15:21,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:15:21,316 INFO L85 PathProgramCache]: Analyzing trace with hash 532037120, now seen corresponding path program 1 times [2022-07-11 23:15:21,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:15:21,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318839540] [2022-07-11 23:15:21,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:15:21,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:15:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:15:21,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:15:21,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:15:21,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318839540] [2022-07-11 23:15:21,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318839540] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:15:21,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037210345] [2022-07-11 23:15:21,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:15:21,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:15:21,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:15:21,863 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:15:21,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-11 23:15:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:15:21,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-11 23:15:21,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:15:22,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:15:22,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-11 23:15:22,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:15:22,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-07-11 23:15:22,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-07-11 23:15:22,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:15:22,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:15:22,404 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:15:22,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:15:22,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037210345] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:15:22,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:15:22,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2022-07-11 23:15:22,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144823090] [2022-07-11 23:15:22,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:15:22,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-11 23:15:22,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:15:22,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-11 23:15:22,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2022-07-11 23:15:22,423 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 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) [2022-07-11 23:15:22,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:15:22,650 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2022-07-11 23:15:22,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 23:15:22,651 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 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 21 [2022-07-11 23:15:22,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:15:22,652 INFO L225 Difference]: With dead ends: 66 [2022-07-11 23:15:22,652 INFO L226 Difference]: Without dead ends: 56 [2022-07-11 23:15:22,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2022-07-11 23:15:22,653 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:15:22,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 106 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 171 Invalid, 0 Unknown, 8 Unchecked, 0.1s Time] [2022-07-11 23:15:22,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-11 23:15:22,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2022-07-11 23:15:22,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:15:22,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2022-07-11 23:15:22,661 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 21 [2022-07-11 23:15:22,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:15:22,661 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2022-07-11 23:15:22,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 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) [2022-07-11 23:15:22,662 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-07-11 23:15:22,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-11 23:15:22,662 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:15:22,663 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:15:22,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-11 23:15:22,879 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 [2022-07-11 23:15:22,880 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:15:22,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:15:22,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1912499326, now seen corresponding path program 2 times [2022-07-11 23:15:22,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:15:22,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153802419] [2022-07-11 23:15:22,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:15:22,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:15:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:15:22,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:15:22,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:15:22,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153802419] [2022-07-11 23:15:22,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153802419] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:15:22,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156951660] [2022-07-11 23:15:22,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:15:22,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:15:22,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:15:22,935 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:15:22,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-11 23:15:22,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:15:22,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:15:23,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-11 23:15:23,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:15:23,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:15:23,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:15:23,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:15:23,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156951660] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:15:23,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:15:23,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-07-11 23:15:23,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032627827] [2022-07-11 23:15:23,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:15:23,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-11 23:15:23,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:15:23,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-11 23:15:23,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:15:23,104 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:15:23,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:15:23,365 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2022-07-11 23:15:23,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-11 23:15:23,366 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-11 23:15:23,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:15:23,367 INFO L225 Difference]: With dead ends: 93 [2022-07-11 23:15:23,367 INFO L226 Difference]: Without dead ends: 55 [2022-07-11 23:15:23,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2022-07-11 23:15:23,368 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 161 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:15:23,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 82 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:15:23,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-11 23:15:23,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2022-07-11 23:15:23,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:15:23,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-07-11 23:15:23,387 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 23 [2022-07-11 23:15:23,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:15:23,388 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-07-11 23:15:23,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:15:23,388 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-07-11 23:15:23,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-11 23:15:23,389 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:15:23,389 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:15:23,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-11 23:15:23,603 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 [2022-07-11 23:15:23,604 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:15:23,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:15:23,604 INFO L85 PathProgramCache]: Analyzing trace with hash 550852762, now seen corresponding path program 1 times [2022-07-11 23:15:23,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:15:23,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784978304] [2022-07-11 23:15:23,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:15:23,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:15:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:15:23,665 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-11 23:15:23,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:15:23,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784978304] [2022-07-11 23:15:23,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784978304] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:15:23,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985375923] [2022-07-11 23:15:23,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:15:23,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:15:23,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:15:23,668 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:15:23,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-11 23:15:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:15:23,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-11 23:15:23,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:15:23,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:15:23,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:15:23,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-11 23:15:23,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-11 23:15:23,810 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-11 23:15:23,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:15:23,820 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_151 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) |c_ULTIMATE.start_main_#t~mem11#1|)) is different from false [2022-07-11 23:15:23,824 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_151 (Array Int Int))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-07-11 23:15:23,837 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:15:23,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-11 23:15:23,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-11 23:15:23,851 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 5 not checked. [2022-07-11 23:15:23,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985375923] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:15:23,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:15:23,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 11 [2022-07-11 23:15:23,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658906417] [2022-07-11 23:15:23,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:15:23,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:15:23,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:15:23,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:15:23,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2022-07-11 23:15:23,853 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 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) [2022-07-11 23:15:23,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:15:23,943 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-07-11 23:15:23,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:15:23,943 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-11 23:15:23,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:15:23,944 INFO L225 Difference]: With dead ends: 50 [2022-07-11 23:15:23,944 INFO L226 Difference]: Without dead ends: 40 [2022-07-11 23:15:23,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=79, Unknown=2, NotChecked=38, Total=156 [2022-07-11 23:15:23,945 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:15:23,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 98 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 35 Unchecked, 0.1s Time] [2022-07-11 23:15:23,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-11 23:15:23,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-07-11 23:15:23,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:15:23,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-07-11 23:15:23,951 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 28 [2022-07-11 23:15:23,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:15:23,955 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-07-11 23:15:23,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 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) [2022-07-11 23:15:23,956 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-07-11 23:15:23,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-11 23:15:23,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:15:23,956 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:15:23,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-11 23:15:24,172 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 [2022-07-11 23:15:24,173 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:15:24,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:15:24,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1969107172, now seen corresponding path program 3 times [2022-07-11 23:15:24,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:15:24,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769096194] [2022-07-11 23:15:24,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:15:24,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:15:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:15:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 23:15:24,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:15:24,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769096194] [2022-07-11 23:15:24,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769096194] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:15:24,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133126473] [2022-07-11 23:15:24,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:15:24,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:15:24,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:15:24,834 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:15:24,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-11 23:15:24,902 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-11 23:15:24,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:15:24,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-11 23:15:24,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:15:24,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:15:24,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:15:24,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:15:25,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:15:25,014 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-11 23:15:25,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-07-11 23:15:25,190 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:15:25,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:15:25,194 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-11 23:15:25,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 41 [2022-07-11 23:15:25,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:15:25,317 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-07-11 23:15:25,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 48 [2022-07-11 23:15:25,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:15:25,586 INFO L356 Elim1Store]: treesize reduction 10, result has 69.7 percent of original size [2022-07-11 23:15:25,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 37 [2022-07-11 23:15:25,711 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:15:25,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:16:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:16:18,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133126473] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:16:18,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:16:18,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 18] total 46 [2022-07-11 23:16:18,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451391170] [2022-07-11 23:16:18,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:16:18,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-11 23:16:18,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:16:18,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-11 23:16:18,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=1760, Unknown=20, NotChecked=0, Total=2070 [2022-07-11 23:16:18,088 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 46 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 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) [2022-07-11 23:16:53,605 WARN L233 SmtUtils]: Spent 21.12s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-11 23:17:08,153 WARN L233 SmtUtils]: Spent 8.84s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-11 23:17:09,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:17:09,611 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-07-11 23:17:09,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-11 23:17:09,612 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 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) Word has length 28 [2022-07-11 23:17:09,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:17:09,614 INFO L225 Difference]: With dead ends: 79 [2022-07-11 23:17:09,614 INFO L226 Difference]: Without dead ends: 64 [2022-07-11 23:17:09,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 104.1s TimeCoverageRelationStatistics Valid=500, Invalid=3129, Unknown=31, NotChecked=0, Total=3660 [2022-07-11 23:17:09,616 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 263 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:17:09,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 150 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 157 Invalid, 0 Unknown, 263 Unchecked, 0.1s Time] [2022-07-11 23:17:09,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-11 23:17:09,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2022-07-11 23:17:09,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 54 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) [2022-07-11 23:17:09,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-07-11 23:17:09,626 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 28 [2022-07-11 23:17:09,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:17:09,626 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-07-11 23:17:09,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 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) [2022-07-11 23:17:09,627 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-07-11 23:17:09,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-11 23:17:09,628 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:17:09,628 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:17:09,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-11 23:17:09,852 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 [2022-07-11 23:17:09,852 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:17:09,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:17:09,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1202810022, now seen corresponding path program 4 times [2022-07-11 23:17:09,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:17:09,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066175515] [2022-07-11 23:17:09,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:17:09,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:17:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:17:09,931 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-11 23:17:09,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:17:09,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066175515] [2022-07-11 23:17:09,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066175515] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:17:09,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499482723] [2022-07-11 23:17:09,932 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 23:17:09,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:17:09,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:17:09,934 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:17:09,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-11 23:17:09,989 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 23:17:09,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:17:09,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 23:17:09,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:17:10,045 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-11 23:17:10,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:17:10,073 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-11 23:17:10,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499482723] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:17:10,073 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:17:10,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-11 23:17:10,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053938142] [2022-07-11 23:17:10,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:17:10,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-11 23:17:10,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:17:10,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-11 23:17:10,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:17:10,075 INFO L87 Difference]: Start difference. First operand 55 states and 66 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) [2022-07-11 23:17:10,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:17:10,241 INFO L93 Difference]: Finished difference Result 142 states and 167 transitions. [2022-07-11 23:17:10,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-11 23:17:10,241 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 30 [2022-07-11 23:17:10,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:17:10,242 INFO L225 Difference]: With dead ends: 142 [2022-07-11 23:17:10,242 INFO L226 Difference]: Without dead ends: 113 [2022-07-11 23:17:10,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:17:10,243 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 118 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:17:10,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 70 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:17:10,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-11 23:17:10,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 85. [2022-07-11 23:17:10,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.2023809523809523) internal successors, (101), 84 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:17:10,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2022-07-11 23:17:10,256 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 30 [2022-07-11 23:17:10,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:17:10,256 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2022-07-11 23:17:10,256 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) [2022-07-11 23:17:10,257 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2022-07-11 23:17:10,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-11 23:17:10,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:17:10,258 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:17:10,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-11 23:17:10,467 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 [2022-07-11 23:17:10,468 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:17:10,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:17:10,468 INFO L85 PathProgramCache]: Analyzing trace with hash -736332014, now seen corresponding path program 1 times [2022-07-11 23:17:10,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:17:10,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302655654] [2022-07-11 23:17:10,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:17:10,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:17:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:17:11,024 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:17:11,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:17:11,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302655654] [2022-07-11 23:17:11,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302655654] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:17:11,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775741046] [2022-07-11 23:17:11,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:17:11,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:17:11,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:17:11,028 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:17:11,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-11 23:17:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:17:11,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-11 23:17:11,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:17:11,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:17:11,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:11,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:17:11,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:11,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:11,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-11 23:17:11,318 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:17:11,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:11,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:11,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-07-11 23:17:11,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:11,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:11,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2022-07-11 23:17:11,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:11,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:11,615 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:17:11,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 45 [2022-07-11 23:17:11,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:11,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2022-07-11 23:17:11,927 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:17:11,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:17:12,612 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:17:12,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775741046] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:17:12,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:17:12,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 17] total 50 [2022-07-11 23:17:12,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925875865] [2022-07-11 23:17:12,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:17:12,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-11 23:17:12,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:17:12,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-11 23:17:12,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=2182, Unknown=0, NotChecked=0, Total=2450 [2022-07-11 23:17:12,616 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand has 50 states, 50 states have (on average 1.7) internal successors, (85), 50 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:17:14,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:17:14,622 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2022-07-11 23:17:14,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-11 23:17:14,622 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.7) internal successors, (85), 50 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-11 23:17:14,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:17:14,623 INFO L225 Difference]: With dead ends: 106 [2022-07-11 23:17:14,623 INFO L226 Difference]: Without dead ends: 89 [2022-07-11 23:17:14,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1961 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=900, Invalid=5580, Unknown=0, NotChecked=0, Total=6480 [2022-07-11 23:17:14,626 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 87 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:17:14,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 227 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 436 Invalid, 0 Unknown, 113 Unchecked, 0.4s Time] [2022-07-11 23:17:14,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-11 23:17:14,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-07-11 23:17:14,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.186046511627907) internal successors, (102), 86 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:17:14,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2022-07-11 23:17:14,639 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 32 [2022-07-11 23:17:14,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:17:14,639 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 102 transitions. [2022-07-11 23:17:14,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.7) internal successors, (85), 50 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:17:14,640 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2022-07-11 23:17:14,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-11 23:17:14,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:17:14,641 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:17:14,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-11 23:17:14,855 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 [2022-07-11 23:17:14,856 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:17:14,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:17:14,856 INFO L85 PathProgramCache]: Analyzing trace with hash -35267436, now seen corresponding path program 1 times [2022-07-11 23:17:14,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:17:14,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675921017] [2022-07-11 23:17:14,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:17:14,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:17:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:17:14,907 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-11 23:17:14,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:17:14,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675921017] [2022-07-11 23:17:14,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675921017] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:17:14,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539286242] [2022-07-11 23:17:14,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:17:14,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:17:14,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:17:14,910 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:17:14,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-11 23:17:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:17:14,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-11 23:17:14,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:17:15,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:17:15,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:15,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:17:15,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-11 23:17:15,037 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-11 23:17:15,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:17:15,047 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_334 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_334) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) |c_ULTIMATE.start_main_#t~mem11#1|)) is different from false [2022-07-11 23:17:15,051 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_334 (Array Int Int))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_334) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-07-11 23:17:15,061 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:17:15,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-11 23:17:15,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-11 23:17:15,073 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 5 not checked. [2022-07-11 23:17:15,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539286242] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:17:15,073 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:17:15,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 11 [2022-07-11 23:17:15,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455962821] [2022-07-11 23:17:15,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:17:15,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:17:15,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:17:15,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:17:15,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2022-07-11 23:17:15,075 INFO L87 Difference]: Start difference. First operand 87 states and 102 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:17:15,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:17:15,147 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2022-07-11 23:17:15,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:17:15,148 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-11 23:17:15,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:17:15,148 INFO L225 Difference]: With dead ends: 101 [2022-07-11 23:17:15,148 INFO L226 Difference]: Without dead ends: 68 [2022-07-11 23:17:15,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=79, Unknown=2, NotChecked=38, Total=156 [2022-07-11 23:17:15,150 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:17:15,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 86 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 31 Unchecked, 0.0s Time] [2022-07-11 23:17:15,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-11 23:17:15,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-07-11 23:17:15,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.164179104477612) internal successors, (78), 67 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:17:15,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2022-07-11 23:17:15,170 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 32 [2022-07-11 23:17:15,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:17:15,171 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-07-11 23:17:15,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:17:15,171 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-07-11 23:17:15,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-11 23:17:15,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:17:15,174 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:17:15,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-11 23:17:15,391 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 [2022-07-11 23:17:15,391 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:17:15,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:17:15,392 INFO L85 PathProgramCache]: Analyzing trace with hash -767176616, now seen corresponding path program 5 times [2022-07-11 23:17:15,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:17:15,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698200659] [2022-07-11 23:17:15,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:17:15,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:17:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:17:15,446 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:17:15,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:17:15,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698200659] [2022-07-11 23:17:15,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698200659] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:17:15,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877556580] [2022-07-11 23:17:15,447 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-11 23:17:15,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:17:15,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:17:15,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) [2022-07-11 23:17:15,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-11 23:17:15,548 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-11 23:17:15,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:17:15,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 23:17:15,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:17:15,615 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:17:15,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:17:15,657 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:17:15,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877556580] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:17:15,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:17:15,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-11 23:17:15,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374669991] [2022-07-11 23:17:15,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:17:15,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-11 23:17:15,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:17:15,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-11 23:17:15,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:17:15,661 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:17:15,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:17:15,810 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2022-07-11 23:17:15,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-11 23:17:15,810 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-11 23:17:15,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:17:15,811 INFO L225 Difference]: With dead ends: 91 [2022-07-11 23:17:15,811 INFO L226 Difference]: Without dead ends: 74 [2022-07-11 23:17:15,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-07-11 23:17:15,813 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 126 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:17:15,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 65 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:17:15,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-11 23:17:15,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 41. [2022-07-11 23:17:15,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:17:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-07-11 23:17:15,819 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 32 [2022-07-11 23:17:15,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:17:15,820 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-07-11 23:17:15,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:17:15,820 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-07-11 23:17:15,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-11 23:17:15,821 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:17:15,821 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:17:15,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-11 23:17:16,038 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 [2022-07-11 23:17:16,038 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:17:16,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:17:16,038 INFO L85 PathProgramCache]: Analyzing trace with hash -143226682, now seen corresponding path program 2 times [2022-07-11 23:17:16,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:17:16,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288764100] [2022-07-11 23:17:16,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:17:16,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:17:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:17:16,388 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:17:16,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:17:16,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288764100] [2022-07-11 23:17:16,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288764100] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:17:16,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883437093] [2022-07-11 23:17:16,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:17:16,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:17:16,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:17:16,390 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:17:16,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-11 23:17:16,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:17:16,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:17:16,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-11 23:17:16,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:17:16,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-11 23:17:16,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:16,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:17:16,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:16,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:17:16,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:16,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:17:16,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:16,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:17:16,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:16,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:17:16,718 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:17:16,720 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:17:16,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2022-07-11 23:17:16,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:16,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:17:16,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:16,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:17:16,849 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:17:16,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:17:18,943 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (forall ((v_ArrVal_444 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) is different from false [2022-07-11 23:17:24,831 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_139| Int)) (or (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int)) (or (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_139|)))) is different from false [2022-07-11 23:17:26,849 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (|v_ULTIMATE.start_main_~i~0#1_139| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_139|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (= (select (store (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) is different from false [2022-07-11 23:17:27,494 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)) (= (select (store (store (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) is different from false [2022-07-11 23:17:27,574 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_436 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (= (select (store (store (let ((.cse0 (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_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)))) is different from false [2022-07-11 23:17:27,593 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_436 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (= (select (store (store (let ((.cse0 (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_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_146|)))) is different from false [2022-07-11 23:17:27,611 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_436 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)) (= 0 (select (store (store (let ((.cse0 (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_434) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-07-11 23:17:27,640 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_147|)) (forall ((v_ArrVal_434 Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_436 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_147| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (= (select (store (store (let ((.cse0 (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_147| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_434) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)))))) is different from false [2022-07-11 23:17:27,674 INFO L356 Elim1Store]: treesize reduction 122, result has 23.3 percent of original size [2022-07-11 23:17:27,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 73 [2022-07-11 23:17:27,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2022-07-11 23:17:27,684 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:17:27,685 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:17:27,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-11 23:17:27,694 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:17:27,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 176 [2022-07-11 23:17:27,753 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 22 not checked. [2022-07-11 23:17:27,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883437093] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:17:27,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:17:27,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 17] total 42 [2022-07-11 23:17:27,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858963373] [2022-07-11 23:17:27,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:17:27,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-11 23:17:27,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:17:27,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-11 23:17:27,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=948, Unknown=18, NotChecked=568, Total=1722 [2022-07-11 23:17:27,756 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 42 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:17:29,776 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= |c_ULTIMATE.start_main_~i~0#1| 0) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_147|)) (forall ((v_ArrVal_434 Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_436 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_147| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (= (select (store (store (let ((.cse1 (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_147| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_434) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)))))) (or (= (select .cse0 0) 0) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-11 23:17:31,817 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_436 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (= (select (store (store (let ((.cse0 (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_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_146|)))) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (or (= (select .cse1 0) 0) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (= (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-11 23:17:35,059 WARN L833 $PredicateComparison]: unable to prove that (and (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) (<= 3 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_139| Int)) (or (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int)) (or (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_139|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (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|)) 0)) is different from false [2022-07-11 23:17:37,119 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 0) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (forall ((v_ArrVal_444 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (<= (+ (div (* (- 1) |c_ULTIMATE.start_main_~a~0#1.offset|) 4) 3) c_~N~0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= 0 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-11 23:17:39,176 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 0) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (forall ((v_ArrVal_444 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (<= (+ (div (* (- 1) |c_ULTIMATE.start_main_~a~0#1.offset|) 4) 3) c_~N~0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (= 0 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-11 23:17:39,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:17:39,442 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2022-07-11 23:17:39,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-11 23:17:39,442 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-11 23:17:39,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:17:39,443 INFO L225 Difference]: With dead ends: 80 [2022-07-11 23:17:39,443 INFO L226 Difference]: Without dead ends: 78 [2022-07-11 23:17:39,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 51 SyntacticMatches, 10 SemanticMatches, 64 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 905 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=463, Invalid=2320, Unknown=25, NotChecked=1482, Total=4290 [2022-07-11 23:17:39,444 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 75 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 422 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:17:39,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 216 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 347 Invalid, 0 Unknown, 422 Unchecked, 0.2s Time] [2022-07-11 23:17:39,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-11 23:17:39,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 49. [2022-07-11 23:17:39,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 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) [2022-07-11 23:17:39,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-07-11 23:17:39,452 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 35 [2022-07-11 23:17:39,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:17:39,453 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-07-11 23:17:39,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:17:39,453 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-07-11 23:17:39,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-11 23:17:39,454 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:17:39,454 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:17:39,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-11 23:17:39,662 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 [2022-07-11 23:17:39,662 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:17:39,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:17:39,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1123059706, now seen corresponding path program 2 times [2022-07-11 23:17:39,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:17:39,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253903441] [2022-07-11 23:17:39,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:17:39,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:17:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:17:39,713 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-11 23:17:39,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:17:39,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253903441] [2022-07-11 23:17:39,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253903441] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:17:39,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884285534] [2022-07-11 23:17:39,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:17:39,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:17:39,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:17:39,716 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:17:39,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-11 23:17:39,790 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:17:39,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:17:39,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-11 23:17:39,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:17:39,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:17:39,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:39,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-11 23:17:39,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:39,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-11 23:17:39,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-11 23:17:39,905 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:17:39,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:17:39,913 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 (Array Int Int))) (not (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) is different from false [2022-07-11 23:17:39,921 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-07-11 23:17:39,925 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 (Array Int Int))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-07-11 23:17:39,935 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:17:39,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-11 23:17:39,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-11 23:17:39,954 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 12 not checked. [2022-07-11 23:17:39,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884285534] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:17:39,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:17:39,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 8] total 16 [2022-07-11 23:17:39,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422419400] [2022-07-11 23:17:39,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:17:39,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-11 23:17:39,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:17:39,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-11 23:17:39,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=119, Unknown=3, NotChecked=72, Total=240 [2022-07-11 23:17:39,956 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:17:40,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:17:40,299 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2022-07-11 23:17:40,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-11 23:17:40,300 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-11 23:17:40,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:17:40,301 INFO L225 Difference]: With dead ends: 116 [2022-07-11 23:17:40,302 INFO L226 Difference]: Without dead ends: 100 [2022-07-11 23:17:40,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 64 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=342, Unknown=3, NotChecked=126, Total=600 [2022-07-11 23:17:40,303 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 110 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 205 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:17:40,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 170 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 311 Invalid, 0 Unknown, 205 Unchecked, 0.2s Time] [2022-07-11 23:17:40,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-11 23:17:40,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 52. [2022-07-11 23:17:40,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:17:40,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-07-11 23:17:40,312 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 35 [2022-07-11 23:17:40,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:17:40,313 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-07-11 23:17:40,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:17:40,313 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-07-11 23:17:40,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-11 23:17:40,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:17:40,316 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:17:40,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-11 23:17:40,539 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 [2022-07-11 23:17:40,540 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:17:40,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:17:40,540 INFO L85 PathProgramCache]: Analyzing trace with hash 651947656, now seen corresponding path program 6 times [2022-07-11 23:17:40,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:17:40,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595095100] [2022-07-11 23:17:40,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:17:40,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:17:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:17:41,423 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-11 23:17:41,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:17:41,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595095100] [2022-07-11 23:17:41,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595095100] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:17:41,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035554968] [2022-07-11 23:17:41,425 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-11 23:17:41,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:17:41,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:17:41,426 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:17:41,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-11 23:17:41,514 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-11 23:17:41,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:17:41,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-11 23:17:41,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:17:41,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:17:41,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:41,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:17:41,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:41,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:41,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-07-11 23:17:41,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:41,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:41,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:41,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:41,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2022-07-11 23:17:41,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:41,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:17:41,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:41,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:41,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:41,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-07-11 23:17:42,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:42,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:42,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:42,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:42,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:42,026 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-07-11 23:17:42,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 60 [2022-07-11 23:17:42,138 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:17:42,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:42,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:42,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:17:42,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 54 [2022-07-11 23:17:42,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:42,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2022-07-11 23:17:42,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:42,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:42,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:42,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 25 [2022-07-11 23:17:42,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-11 23:17:42,483 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 23:17:42,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:17:42,555 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_564 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-07-11 23:17:42,696 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_564 (Array Int Int))) (= c_~N~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse2)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0))) is different from false [2022-07-11 23:17:48,921 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_179| Int) (v_ArrVal_564 (Array Int Int))) (or (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_179|) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_179|)) (<= (select (select (store (let ((.cse6 (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| 4) 1))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (* |v_ULTIMATE.start_main_~i~0#1_179| 4))) (let ((.cse4 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse3 .cse4)))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (+ 2 |v_ULTIMATE.start_main_~i~0#1_179|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_179| Int) (v_ArrVal_564 (Array Int Int))) (or (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_179|) (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) (select (select (store (let ((.cse13 (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| 4) 1))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse13))) (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse10 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse12 (* |v_ULTIMATE.start_main_~i~0#1_179| 4))) (let ((.cse11 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse9 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse10 .cse11)))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_179|))))) is different from false [2022-07-11 23:17:53,664 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 7 refuted. 2 times theorem prover too weak. 2 trivial. 11 not checked. [2022-07-11 23:17:53,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035554968] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:17:53,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:17:53,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 18] total 53 [2022-07-11 23:17:53,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595879769] [2022-07-11 23:17:53,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:17:53,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-11 23:17:53,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:17:53,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-11 23:17:53,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=2169, Unknown=19, NotChecked=294, Total=2756 [2022-07-11 23:17:53,670 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 53 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 53 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:17:54,801 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (= (select .cse0 (+ .cse1 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_179| Int) (v_ArrVal_564 (Array Int Int))) (or (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_179|) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_179|)) (<= (select (select (store (let ((.cse8 (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| 4) 1))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse8))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (* |v_ULTIMATE.start_main_~i~0#1_179| 4))) (let ((.cse6 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse5 .cse6)))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (+ 2 |v_ULTIMATE.start_main_~i~0#1_179|)))) (= (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_~#sum~0#1.offset| 0) (= (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_179| Int) (v_ArrVal_564 (Array Int Int))) (or (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_179|) (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) (select (select (store (let ((.cse15 (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| 4) 1))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse12 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse14 (* |v_ULTIMATE.start_main_~i~0#1_179| 4))) (let ((.cse13 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse11 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse14 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse12 .cse13)))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_179|)))) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0))) is different from false [2022-07-11 23:17:55,782 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_564 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (forall ((v_ArrVal_564 (Array Int Int))) (= c_~N~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (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|)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)))) is different from false [2022-07-11 23:17:55,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:17:55,887 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2022-07-11 23:17:55,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-11 23:17:55,887 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 53 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-11 23:17:55,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:17:55,888 INFO L225 Difference]: With dead ends: 90 [2022-07-11 23:17:55,888 INFO L226 Difference]: Without dead ends: 72 [2022-07-11 23:17:55,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=427, Invalid=3593, Unknown=32, NotChecked=640, Total=4692 [2022-07-11 23:17:55,890 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:17:55,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 170 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 224 Invalid, 0 Unknown, 153 Unchecked, 0.1s Time] [2022-07-11 23:17:55,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-11 23:17:55,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2022-07-11 23:17:55,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.1764705882352942) internal successors, (80), 68 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) [2022-07-11 23:17:55,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2022-07-11 23:17:55,902 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 35 [2022-07-11 23:17:55,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:17:55,902 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2022-07-11 23:17:55,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 53 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:17:55,902 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-07-11 23:17:55,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-11 23:17:55,903 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:17:55,903 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:17:55,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-11 23:17:56,119 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 [2022-07-11 23:17:56,120 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:17:56,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:17:56,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1015472054, now seen corresponding path program 7 times [2022-07-11 23:17:56,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:17:56,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19597513] [2022-07-11 23:17:56,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:17:56,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:17:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:17:56,194 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:17:56,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:17:56,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19597513] [2022-07-11 23:17:56,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19597513] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:17:56,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703749351] [2022-07-11 23:17:56,195 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-11 23:17:56,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:17:56,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:17:56,200 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) [2022-07-11 23:17:56,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-11 23:17:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:17:56,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-11 23:17:56,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:17:56,357 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:17:56,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:17:56,389 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:17:56,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703749351] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:17:56,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:17:56,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-11 23:17:56,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241091297] [2022-07-11 23:17:56,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:17:56,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-11 23:17:56,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:17:56,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-11 23:17:56,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:17:56,390 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 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) [2022-07-11 23:17:56,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:17:56,746 INFO L93 Difference]: Finished difference Result 173 states and 198 transitions. [2022-07-11 23:17:56,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-11 23:17:56,747 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-11 23:17:56,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:17:56,747 INFO L225 Difference]: With dead ends: 173 [2022-07-11 23:17:56,748 INFO L226 Difference]: Without dead ends: 141 [2022-07-11 23:17:56,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-07-11 23:17:56,748 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 134 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:17:56,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 239 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:17:56,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-11 23:17:56,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 85. [2022-07-11 23:17:56,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.1547619047619047) internal successors, (97), 84 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:17:56,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2022-07-11 23:17:56,762 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 37 [2022-07-11 23:17:56,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:17:56,762 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2022-07-11 23:17:56,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 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) [2022-07-11 23:17:56,763 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2022-07-11 23:17:56,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-11 23:17:56,763 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:17:56,763 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:17:56,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-11 23:17:56,971 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 [2022-07-11 23:17:56,972 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:17:56,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:17:56,972 INFO L85 PathProgramCache]: Analyzing trace with hash -590527364, now seen corresponding path program 2 times [2022-07-11 23:17:56,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:17:56,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480626931] [2022-07-11 23:17:56,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:17:56,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:17:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:17:57,629 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:17:57,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:17:57,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480626931] [2022-07-11 23:17:57,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480626931] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:17:57,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868209602] [2022-07-11 23:17:57,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:17:57,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:17:57,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:17:57,632 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) [2022-07-11 23:17:57,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-11 23:17:57,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:17:57,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:17:57,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-11 23:17:57,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:17:57,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:17:57,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:57,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:17:57,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:57,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:57,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-11 23:17:57,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:57,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:57,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:57,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:57,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2022-07-11 23:17:58,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:17:58,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:58,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:58,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:58,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:58,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-07-11 23:17:58,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:58,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:58,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:58,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:58,124 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:17:58,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:58,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2022-07-11 23:17:58,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:58,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:58,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:58,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:58,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 55 [2022-07-11 23:17:58,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:58,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:58,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:58,401 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:17:58,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:58,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 53 [2022-07-11 23:17:58,521 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:17:58,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:58,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:58,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 41 [2022-07-11 23:17:58,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:58,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:58,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:17:58,650 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-07-11 23:17:58,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-07-11 23:17:58,846 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:17:58,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:18:01,014 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_216|)) (forall ((v_ArrVal_688 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_688) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)))) is different from false [2022-07-11 23:18:39,141 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-11 23:18:39,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868209602] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:18:39,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:18:39,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 23] total 67 [2022-07-11 23:18:39,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373769478] [2022-07-11 23:18:39,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:18:39,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-07-11 23:18:39,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:18:39,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-07-11 23:18:39,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=529, Invalid=3713, Unknown=52, NotChecked=128, Total=4422 [2022-07-11 23:18:39,143 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand has 67 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 67 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:18:45,272 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse2 (= (select .cse0 .cse1) 0))) (and (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (or (not (= .cse1 4)) .cse2) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 3 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_216|)) (forall ((v_ArrVal_688 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_688) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 3) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|))) .cse2 (<= |c_ULTIMATE.start_main_~i~0#1| 1) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0)))) is different from false [2022-07-11 23:19:11,759 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse0 4)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 3 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_216|)) (forall ((v_ArrVal_688 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_688) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2022-07-11 23:19:13,762 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int) (v_ArrVal_688 Int)) (or (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_216|)) (= (select (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_688) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_216|)) (forall ((v_ArrVal_688 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_688) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 3) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|)))) is different from false [2022-07-11 23:19:14,358 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_688 Int)) (= (select (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_688) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int) (v_ArrVal_688 Int)) (or (= (select (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_688) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_216|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 3) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|)))) is different from false [2022-07-11 23:19:14,931 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_688 Int)) (= (select (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_688) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int) (v_ArrVal_688 Int)) (or (= (select (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_688) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_216|))))) is different from false [2022-07-11 23:19:16,945 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_216| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_216|)) (forall ((v_ArrVal_688 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_216| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_688) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))))) is different from false [2022-07-11 23:19:18,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:19:18,612 INFO L93 Difference]: Finished difference Result 124 states and 146 transitions. [2022-07-11 23:19:18,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-07-11 23:19:18,613 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 67 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-11 23:19:18,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:19:18,614 INFO L225 Difference]: With dead ends: 124 [2022-07-11 23:19:18,614 INFO L226 Difference]: Without dead ends: 122 [2022-07-11 23:19:18,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 104 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 3082 ImplicationChecksByTransitivity, 80.3s TimeCoverageRelationStatistics Valid=1323, Invalid=8315, Unknown=92, NotChecked=1400, Total=11130 [2022-07-11 23:19:18,617 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 64 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 314 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:19:18,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 312 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 446 Invalid, 0 Unknown, 314 Unchecked, 0.2s Time] [2022-07-11 23:19:18,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-11 23:19:18,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2022-07-11 23:19:18,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.19) internal successors, (119), 100 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:19:18,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 119 transitions. [2022-07-11 23:19:18,634 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 119 transitions. Word has length 39 [2022-07-11 23:19:18,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:19:18,634 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 119 transitions. [2022-07-11 23:19:18,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 67 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:19:18,635 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 119 transitions. [2022-07-11 23:19:18,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-11 23:19:18,635 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:19:18,635 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:19:18,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-11 23:19:18,843 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 [2022-07-11 23:19:18,844 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:19:18,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:19:18,844 INFO L85 PathProgramCache]: Analyzing trace with hash 110537214, now seen corresponding path program 2 times [2022-07-11 23:19:18,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:19:18,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526212741] [2022-07-11 23:19:18,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:19:18,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:19:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:19:18,915 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-11 23:19:18,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:19:18,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526212741] [2022-07-11 23:19:18,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526212741] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:19:18,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818441200] [2022-07-11 23:19:18,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:19:18,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:19:18,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:19:18,918 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) [2022-07-11 23:19:18,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-11 23:19:19,006 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:19:19,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:19:19,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-11 23:19:19,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:19:19,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:19:19,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:19,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:19:19,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:19,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:19:19,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-11 23:19:19,144 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:19:19,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:19:19,152 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_742) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-07-11 23:19:19,160 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_742) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) |c_ULTIMATE.start_main_#t~mem11#1|)) is different from false [2022-07-11 23:19:19,164 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 (Array Int Int))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_742) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-07-11 23:19:19,174 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:19:19,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-11 23:19:19,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-11 23:19:19,195 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 12 not checked. [2022-07-11 23:19:19,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818441200] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:19:19,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:19:19,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 8] total 16 [2022-07-11 23:19:19,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672890909] [2022-07-11 23:19:19,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:19:19,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-11 23:19:19,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:19:19,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-11 23:19:19,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=119, Unknown=3, NotChecked=72, Total=240 [2022-07-11 23:19:19,196 INFO L87 Difference]: Start difference. First operand 101 states and 119 transitions. Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:19:19,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:19:19,564 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2022-07-11 23:19:19,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-11 23:19:19,564 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-11 23:19:19,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:19:19,565 INFO L225 Difference]: With dead ends: 150 [2022-07-11 23:19:19,565 INFO L226 Difference]: Without dead ends: 136 [2022-07-11 23:19:19,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 72 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=342, Unknown=3, NotChecked=126, Total=600 [2022-07-11 23:19:19,566 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 139 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:19:19,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 124 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 250 Invalid, 0 Unknown, 189 Unchecked, 0.1s Time] [2022-07-11 23:19:19,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-11 23:19:19,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 96. [2022-07-11 23:19:19,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.1368421052631579) internal successors, (108), 95 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:19:19,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2022-07-11 23:19:19,582 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 39 [2022-07-11 23:19:19,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:19:19,582 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2022-07-11 23:19:19,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:19:19,583 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2022-07-11 23:19:19,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-11 23:19:19,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:19:19,583 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:19:19,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-11 23:19:19,783 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 [2022-07-11 23:19:19,784 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:19:19,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:19:19,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1487374188, now seen corresponding path program 8 times [2022-07-11 23:19:19,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:19:19,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493267333] [2022-07-11 23:19:19,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:19:19,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:19:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:19:21,283 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 23:19:21,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:19:21,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493267333] [2022-07-11 23:19:21,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493267333] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:19:21,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015547535] [2022-07-11 23:19:21,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:19:21,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:19:21,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:19:21,284 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) [2022-07-11 23:19:21,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-11 23:19:21,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:19:21,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:19:21,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-11 23:19:21,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:19:21,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:19:21,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:21,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:19:21,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:21,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:21,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-07-11 23:19:21,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:21,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:21,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:21,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:21,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-07-11 23:19:21,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:21,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:21,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:21,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:21,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:21,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:21,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:21,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-07-11 23:19:21,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:21,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:19:21,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:21,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:21,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:21,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:21,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:21,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:21,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2022-07-11 23:19:22,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:22,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:22,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:22,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:22,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:22,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:19:22,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:22,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:22,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:22,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 61 [2022-07-11 23:19:22,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:22,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:22,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:22,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:22,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:22,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:22,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:22,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:22,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:22,272 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:19:22,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 68 [2022-07-11 23:19:22,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:22,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2022-07-11 23:19:22,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:22,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 23 [2022-07-11 23:19:22,551 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 23:19:22,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:19:25,376 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 23:19:25,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015547535] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:19:25,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:19:25,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 60 [2022-07-11 23:19:25,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77596222] [2022-07-11 23:19:25,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:19:25,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-07-11 23:19:25,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:19:25,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-07-11 23:19:25,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=3268, Unknown=0, NotChecked=0, Total=3540 [2022-07-11 23:19:25,379 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand has 60 states, 60 states have (on average 1.35) internal successors, (81), 60 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:19:27,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:19:27,605 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2022-07-11 23:19:27,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-11 23:19:27,606 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.35) internal successors, (81), 60 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-11 23:19:27,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:19:27,606 INFO L225 Difference]: With dead ends: 132 [2022-07-11 23:19:27,606 INFO L226 Difference]: Without dead ends: 114 [2022-07-11 23:19:27,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1292 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=332, Invalid=4090, Unknown=0, NotChecked=0, Total=4422 [2022-07-11 23:19:27,608 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 9 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:19:27,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 188 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 925 Invalid, 0 Unknown, 170 Unchecked, 1.7s Time] [2022-07-11 23:19:27,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-11 23:19:27,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2022-07-11 23:19:27,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.1333333333333333) internal successors, (119), 105 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:19:27,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2022-07-11 23:19:27,625 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 42 [2022-07-11 23:19:27,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:19:27,626 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2022-07-11 23:19:27,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 1.35) internal successors, (81), 60 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:19:27,626 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2022-07-11 23:19:27,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-11 23:19:27,627 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:19:27,627 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:19:27,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-07-11 23:19:27,843 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 [2022-07-11 23:19:27,843 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:19:27,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:19:27,844 INFO L85 PathProgramCache]: Analyzing trace with hash 2085827890, now seen corresponding path program 3 times [2022-07-11 23:19:27,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:19:27,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579448503] [2022-07-11 23:19:27,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:19:27,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:19:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:19:28,454 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:19:28,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:19:28,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579448503] [2022-07-11 23:19:28,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579448503] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:19:28,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526719249] [2022-07-11 23:19:28,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:19:28,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:19:28,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:19:28,457 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) [2022-07-11 23:19:28,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-11 23:19:28,532 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-11 23:19:28,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:19:28,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-11 23:19:28,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:19:28,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-11 23:19:28,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:28,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-11 23:19:28,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:28,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-11 23:19:28,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:19:28,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-11 23:19:28,933 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-11 23:19:28,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34 [2022-07-11 23:19:28,996 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-11 23:19:28,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 47 [2022-07-11 23:19:29,155 INFO L356 Elim1Store]: treesize reduction 34, result has 48.5 percent of original size [2022-07-11 23:19:29,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 61 [2022-07-11 23:19:29,562 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-07-11 23:19:29,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 36 [2022-07-11 23:19:29,592 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:19:29,592 INFO L328 TraceCheckSpWp]: Computing backward predicates...