./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/shared_mem1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-data/shared_mem1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 47cb7cab177485da5df0f1af4a3f61fd7eb970990493dd3ac764f888774cbf0f --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 15:19:41,017 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:19:41,019 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:19:41,059 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:19:41,060 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:19:41,061 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:19:41,063 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:19:41,064 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:19:41,066 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:19:41,069 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:19:41,070 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:19:41,072 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:19:41,072 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:19:41,074 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:19:41,074 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:19:41,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:19:41,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:19:41,078 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:19:41,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:19:41,084 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:19:41,086 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:19:41,087 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:19:41,087 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:19:41,088 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:19:41,089 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:19:41,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:19:41,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:19:41,094 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:19:41,095 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:19:41,096 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:19:41,097 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:19:41,097 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:19:41,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:19:41,099 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:19:41,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:19:41,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:19:41,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:19:41,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:19:41,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:19:41,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:19:41,101 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:19:41,103 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:19:41,104 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 15:19:41,126 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:19:41,126 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:19:41,127 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:19:41,127 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:19:41,127 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:19:41,127 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:19:41,128 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:19:41,128 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:19:41,128 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:19:41,129 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:19:41,129 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:19:41,129 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 15:19:41,129 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:19:41,129 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:19:41,130 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:19:41,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:19:41,130 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:19:41,130 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:19:41,130 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:19:41,131 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:19:41,131 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:19:41,131 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:19:41,131 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:19:41,132 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:19:41,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:19:41,132 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:19:41,132 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:19:41,132 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:19:41,132 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 15:19:41,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 15:19:41,133 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:19:41,133 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:19:41,133 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:19:41,133 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 -> 47cb7cab177485da5df0f1af4a3f61fd7eb970990493dd3ac764f888774cbf0f [2022-07-13 15:19:41,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:19:41,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:19:41,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:19:41,377 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:19:41,377 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:19:41,378 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/shared_mem1.i [2022-07-13 15:19:41,432 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/748227db0/f3ac92fa1d7641bd9a1362af6bf961ff/FLAG8c970febe [2022-07-13 15:19:41,798 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:19:41,799 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem1.i [2022-07-13 15:19:41,812 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/748227db0/f3ac92fa1d7641bd9a1362af6bf961ff/FLAG8c970febe [2022-07-13 15:19:42,207 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/748227db0/f3ac92fa1d7641bd9a1362af6bf961ff [2022-07-13 15:19:42,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:19:42,215 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:19:42,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:19:42,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:19:42,221 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:19:42,221 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:19:42" (1/1) ... [2022-07-13 15:19:42,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b8e1c62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:42, skipping insertion in model container [2022-07-13 15:19:42,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:19:42" (1/1) ... [2022-07-13 15:19:42,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:19:42,256 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:19:42,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem1.i[23879,23892] [2022-07-13 15:19:42,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:19:42,452 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:19:42,477 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem1.i[23879,23892] [2022-07-13 15:19:42,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:19:42,494 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:19:42,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:42 WrapperNode [2022-07-13 15:19:42,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:19:42,498 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:19:42,498 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:19:42,499 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:19:42,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:42" (1/1) ... [2022-07-13 15:19:42,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:42" (1/1) ... [2022-07-13 15:19:42,546 INFO L137 Inliner]: procedures = 121, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2022-07-13 15:19:42,546 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:19:42,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:19:42,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:19:42,548 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:19:42,553 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:42" (1/1) ... [2022-07-13 15:19:42,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:42" (1/1) ... [2022-07-13 15:19:42,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:42" (1/1) ... [2022-07-13 15:19:42,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:42" (1/1) ... [2022-07-13 15:19:42,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:42" (1/1) ... [2022-07-13 15:19:42,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:42" (1/1) ... [2022-07-13 15:19:42,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:42" (1/1) ... [2022-07-13 15:19:42,589 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:19:42,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:19:42,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:19:42,590 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:19:42,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:42" (1/1) ... [2022-07-13 15:19:42,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:19:42,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:19:42,630 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-13 15:19:42,648 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-13 15:19:42,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 15:19:42,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 15:19:42,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 15:19:42,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:19:42,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 15:19:42,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 15:19:42,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 15:19:42,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:19:42,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:19:42,755 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:19:42,761 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:19:42,926 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:19:42,930 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:19:42,931 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 15:19:42,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:19:42 BoogieIcfgContainer [2022-07-13 15:19:42,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:19:42,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:19:42,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:19:42,950 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:19:42,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:19:42" (1/3) ... [2022-07-13 15:19:42,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77acb097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:19:42, skipping insertion in model container [2022-07-13 15:19:42,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:19:42" (2/3) ... [2022-07-13 15:19:42,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77acb097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:19:42, skipping insertion in model container [2022-07-13 15:19:42,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:19:42" (3/3) ... [2022-07-13 15:19:42,952 INFO L111 eAbstractionObserver]: Analyzing ICFG shared_mem1.i [2022-07-13 15:19:42,962 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:19:42,963 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 15:19:42,998 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:19:43,005 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@129e4c19, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@20efadd2 [2022-07-13 15:19:43,005 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 15:19:43,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:43,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 15:19:43,028 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:19:43,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:19:43,029 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:19:43,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:19:43,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1650103796, now seen corresponding path program 1 times [2022-07-13 15:19:43,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:19:43,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878076644] [2022-07-13 15:19:43,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:43,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:19:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:43,206 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-13 15:19:43,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:19:43,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878076644] [2022-07-13 15:19:43,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878076644] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:19:43,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:19:43,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 15:19:43,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992613037] [2022-07-13 15:19:43,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:19:43,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 15:19:43,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:19:43,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 15:19:43,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 15:19:43,238 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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-13 15:19:43,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:19:43,248 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-07-13 15:19:43,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 15:19:43,250 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-07-13 15:19:43,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:19:43,256 INFO L225 Difference]: With dead ends: 27 [2022-07-13 15:19:43,256 INFO L226 Difference]: Without dead ends: 13 [2022-07-13 15:19:43,259 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-13 15:19:43,262 INFO L413 NwaCegarLoop]: 20 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, 20 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-13 15:19:43,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:19:43,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-07-13 15:19:43,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-07-13 15:19:43,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:43,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2022-07-13 15:19:43,307 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 10 [2022-07-13 15:19:43,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:19:43,308 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-07-13 15:19:43,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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-13 15:19:43,308 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-07-13 15:19:43,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 15:19:43,309 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:19:43,309 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:19:43,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 15:19:43,310 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:19:43,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:19:43,310 INFO L85 PathProgramCache]: Analyzing trace with hash -812668617, now seen corresponding path program 1 times [2022-07-13 15:19:43,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:19:43,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027939918] [2022-07-13 15:19:43,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:43,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:19:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:43,659 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-13 15:19:43,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:19:43,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027939918] [2022-07-13 15:19:43,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027939918] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:19:43,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:19:43,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 15:19:43,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487233404] [2022-07-13 15:19:43,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:19:43,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 15:19:43,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:19:43,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 15:19:43,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-13 15:19:43,663 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:43,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:19:43,842 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-07-13 15:19:43,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:19:43,842 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-13 15:19:43,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:19:43,843 INFO L225 Difference]: With dead ends: 29 [2022-07-13 15:19:43,844 INFO L226 Difference]: Without dead ends: 27 [2022-07-13 15:19:43,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-13 15:19:43,845 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 31 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:19:43,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 38 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:19:43,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-13 15:19:43,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-07-13 15:19:43,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:43,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2022-07-13 15:19:43,850 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 11 [2022-07-13 15:19:43,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:19:43,850 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-07-13 15:19:43,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:43,850 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-07-13 15:19:43,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 15:19:43,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:19:43,850 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:19:43,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 15:19:43,851 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:19:43,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:19:43,851 INFO L85 PathProgramCache]: Analyzing trace with hash -812666695, now seen corresponding path program 1 times [2022-07-13 15:19:43,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:19:43,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804506618] [2022-07-13 15:19:43,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:43,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:19:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:44,036 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-13 15:19:44,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:19:44,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804506618] [2022-07-13 15:19:44,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804506618] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:19:44,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:19:44,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 15:19:44,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406408408] [2022-07-13 15:19:44,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:19:44,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 15:19:44,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:19:44,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 15:19:44,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:19:44,041 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:44,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:19:44,179 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2022-07-13 15:19:44,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:19:44,180 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-13 15:19:44,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:19:44,181 INFO L225 Difference]: With dead ends: 31 [2022-07-13 15:19:44,181 INFO L226 Difference]: Without dead ends: 24 [2022-07-13 15:19:44,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-13 15:19:44,182 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:19:44,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 38 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:19:44,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-13 15:19:44,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2022-07-13 15:19:44,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:44,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2022-07-13 15:19:44,185 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 11 [2022-07-13 15:19:44,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:19:44,186 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2022-07-13 15:19:44,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:44,186 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2022-07-13 15:19:44,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 15:19:44,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:19:44,186 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:19:44,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 15:19:44,187 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:19:44,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:19:44,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1760681901, now seen corresponding path program 1 times [2022-07-13 15:19:44,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:19:44,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728273175] [2022-07-13 15:19:44,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:44,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:19:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:44,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:19:44,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:19:44,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728273175] [2022-07-13 15:19:44,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728273175] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:19:44,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324941856] [2022-07-13 15:19:44,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:44,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:44,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:19:44,507 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-13 15:19:44,508 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-13 15:19:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:44,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-13 15:19:44,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:19:44,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:44,685 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 19 [2022-07-13 15:19:44,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:44,690 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 19 [2022-07-13 15:19:44,701 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 15:19:44,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-13 15:19:44,745 INFO L356 Elim1Store]: treesize reduction 46, result has 29.2 percent of original size [2022-07-13 15:19:44,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 94 [2022-07-13 15:19:44,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:44,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:44,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:44,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-07-13 15:19:44,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:44,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:44,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:44,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2022-07-13 15:19:44,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:44,862 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 72 treesize of output 41 [2022-07-13 15:19:44,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:44,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:44,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:44,879 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 36 treesize of output 26 [2022-07-13 15:19:45,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:45,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:45,066 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 26 treesize of output 23 [2022-07-13 15:19:45,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:45,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:45,080 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 26 treesize of output 23 [2022-07-13 15:19:45,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:45,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:45,093 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 24 treesize of output 21 [2022-07-13 15:19:45,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:45,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-07-13 15:19:45,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:45,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-07-13 15:19:45,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:45,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-07-13 15:19:45,129 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:19:45,129 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 11 treesize of output 11 [2022-07-13 15:19:45,236 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 67 treesize of output 47 [2022-07-13 15:19:45,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:45,257 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-07-13 15:19:45,258 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 51 treesize of output 42 [2022-07-13 15:19:45,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-13 15:19:45,439 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:45,439 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 41 treesize of output 29 [2022-07-13 15:19:45,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:19:45,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:19:45,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:19:45,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324941856] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:19:45,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:19:45,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-07-13 15:19:45,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004906775] [2022-07-13 15:19:45,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:19:45,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 15:19:45,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:19:45,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 15:19:45,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-07-13 15:19:45,750 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:46,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:19:46,043 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-07-13 15:19:46,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 15:19:46,044 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-13 15:19:46,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:19:46,044 INFO L225 Difference]: With dead ends: 47 [2022-07-13 15:19:46,045 INFO L226 Difference]: Without dead ends: 45 [2022-07-13 15:19:46,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2022-07-13 15:19:46,046 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 62 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:19:46,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 92 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 25 Invalid, 0 Unknown, 70 Unchecked, 0.1s Time] [2022-07-13 15:19:46,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-13 15:19:46,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2022-07-13 15:19:46,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 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-13 15:19:46,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2022-07-13 15:19:46,050 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 14 [2022-07-13 15:19:46,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:19:46,050 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2022-07-13 15:19:46,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:46,051 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2022-07-13 15:19:46,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 15:19:46,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:19:46,051 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:19:46,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 15:19:46,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:46,267 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:19:46,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:19:46,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1760679979, now seen corresponding path program 1 times [2022-07-13 15:19:46,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:19:46,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279358702] [2022-07-13 15:19:46,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:46,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:19:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:46,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:19:46,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:19:46,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279358702] [2022-07-13 15:19:46,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279358702] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:19:46,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456113587] [2022-07-13 15:19:46,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:46,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:46,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:19:46,456 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-13 15:19:46,459 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-13 15:19:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:46,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-13 15:19:46,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:19:46,566 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-07-13 15:19:46,566 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 74 [2022-07-13 15:19:46,589 INFO L356 Elim1Store]: treesize reduction 55, result has 24.7 percent of original size [2022-07-13 15:19:46,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 91 [2022-07-13 15:19:46,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:46,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:46,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:46,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-07-13 15:19:46,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-07-13 15:19:46,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:46,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:46,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:46,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 62 [2022-07-13 15:19:46,711 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 57 treesize of output 41 [2022-07-13 15:19:46,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:46,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:46,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:46,717 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 41 treesize of output 29 [2022-07-13 15:19:46,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:46,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:46,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:46,754 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 36 treesize of output 26 [2022-07-13 15:19:46,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:46,771 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 19 [2022-07-13 15:19:46,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:46,776 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 19 [2022-07-13 15:19:46,796 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:19:46,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-13 15:19:46,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:46,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:46,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-07-13 15:19:46,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:46,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:46,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-07-13 15:19:46,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:46,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:46,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:46,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-07-13 15:19:46,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:46,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-07-13 15:19:46,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:46,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-07-13 15:19:46,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:46,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-07-13 15:19:46,959 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-13 15:19:46,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 15:19:47,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2022-07-13 15:19:47,057 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 30 [2022-07-13 15:19:47,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-07-13 15:19:47,088 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:19:47,089 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 28 treesize of output 16 [2022-07-13 15:19:47,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:19:47,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:19:47,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:19:47,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456113587] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:19:47,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:19:47,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2022-07-13 15:19:47,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955923778] [2022-07-13 15:19:47,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:19:47,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 15:19:47,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:19:47,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 15:19:47,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=180, Unknown=2, NotChecked=0, Total=240 [2022-07-13 15:19:47,375 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:47,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:19:47,542 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2022-07-13 15:19:47,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:19:47,543 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-13 15:19:47,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:19:47,543 INFO L225 Difference]: With dead ends: 44 [2022-07-13 15:19:47,543 INFO L226 Difference]: Without dead ends: 34 [2022-07-13 15:19:47,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=245, Unknown=2, NotChecked=0, Total=342 [2022-07-13 15:19:47,544 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:19:47,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 46 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 28 Invalid, 0 Unknown, 20 Unchecked, 0.0s Time] [2022-07-13 15:19:47,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-13 15:19:47,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-07-13 15:19:47,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:47,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-07-13 15:19:47,547 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 14 [2022-07-13 15:19:47,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:19:47,547 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-07-13 15:19:47,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:47,548 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-07-13 15:19:47,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 15:19:47,549 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:19:47,549 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:19:47,566 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-13 15:19:47,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:47,756 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:19:47,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:19:47,756 INFO L85 PathProgramCache]: Analyzing trace with hash 187961508, now seen corresponding path program 1 times [2022-07-13 15:19:47,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:19:47,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365793830] [2022-07-13 15:19:47,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:47,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:19:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:47,941 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:19:47,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:19:47,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365793830] [2022-07-13 15:19:47,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365793830] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:19:47,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372293721] [2022-07-13 15:19:47,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:47,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:47,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:19:47,944 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-13 15:19:47,945 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-13 15:19:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:48,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-13 15:19:48,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:19:48,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:48,027 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 19 [2022-07-13 15:19:48,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:48,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:48,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-07-13 15:19:48,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:48,039 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 30 treesize of output 30 [2022-07-13 15:19:48,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:48,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:48,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:48,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-07-13 15:19:48,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:48,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:48,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-07-13 15:19:48,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-07-13 15:19:48,059 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 16 treesize of output 14 [2022-07-13 15:19:48,165 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:19:48,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 102 [2022-07-13 15:19:48,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 38 [2022-07-13 15:19:48,174 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 56 treesize of output 54 [2022-07-13 15:19:48,288 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 44 treesize of output 32 [2022-07-13 15:19:48,294 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:19:48,295 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 36 treesize of output 16 [2022-07-13 15:19:48,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:19:48,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:19:48,357 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_515 (Array Int Int)) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_514 Int)) (let ((.cse8 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse8))) (let ((.cse0 (select |c_#memory_int| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse8))) (or (not (<= (+ (select .cse0 .cse1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_514)) (<= 101 (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_516)) (.cse3 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_515)) (.cse7 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse5 (+ 4 (select (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)))) (select (select (store |c_#memory_int| .cse2 (store .cse0 .cse1 v_ArrVal_514)) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5)))))))))) is different from false [2022-07-13 15:19:48,373 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_515 (Array Int Int)) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_514 Int)) (let ((.cse8 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse8))) (let ((.cse1 (select |c_#memory_int| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse8))) (or (<= 101 (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_516)) (.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_515)) (.cse7 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse5 (+ 4 (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)))) (select (select (store |c_#memory_int| .cse0 (store .cse1 .cse2 v_ArrVal_514)) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))) (not (<= (+ (select .cse1 .cse2) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) v_ArrVal_514))))))) is different from false [2022-07-13 15:19:48,398 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-13 15:19:48,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372293721] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:19:48,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:19:48,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 7] total 18 [2022-07-13 15:19:48,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974539792] [2022-07-13 15:19:48,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:19:48,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 15:19:48,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:19:48,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 15:19:48,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=206, Unknown=2, NotChecked=58, Total=306 [2022-07-13 15:19:48,400 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:49,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:19:49,062 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2022-07-13 15:19:49,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 15:19:49,062 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-13 15:19:49,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:19:49,063 INFO L225 Difference]: With dead ends: 52 [2022-07-13 15:19:49,063 INFO L226 Difference]: Without dead ends: 29 [2022-07-13 15:19:49,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=356, Unknown=2, NotChecked=82, Total=552 [2022-07-13 15:19:49,063 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 30 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:19:49,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 115 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 125 Invalid, 0 Unknown, 49 Unchecked, 0.2s Time] [2022-07-13 15:19:49,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-13 15:19:49,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-13 15:19:49,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 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-13 15:19:49,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-07-13 15:19:49,066 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 16 [2022-07-13 15:19:49,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:19:49,066 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-07-13 15:19:49,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:49,067 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-07-13 15:19:49,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 15:19:49,067 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:19:49,067 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:19:49,100 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-13 15:19:49,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:49,268 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:19:49,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:19:49,268 INFO L85 PathProgramCache]: Analyzing trace with hash -319487049, now seen corresponding path program 2 times [2022-07-13 15:19:49,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:19:49,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114542471] [2022-07-13 15:19:49,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:49,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:19:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:49,458 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 15:19:49,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:19:49,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114542471] [2022-07-13 15:19:49,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114542471] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:19:49,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433587178] [2022-07-13 15:19:49,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:19:49,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:49,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:19:49,460 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-13 15:19:49,494 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-13 15:19:49,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:19:49,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:19:49,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-13 15:19:49,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:19:49,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:49,592 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 19 [2022-07-13 15:19:49,601 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 15:19:49,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-13 15:19:49,625 INFO L356 Elim1Store]: treesize reduction 46, result has 29.2 percent of original size [2022-07-13 15:19:49,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 94 [2022-07-13 15:19:49,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:49,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:49,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:49,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-07-13 15:19:49,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:49,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:49,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:49,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2022-07-13 15:19:49,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:49,680 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 72 treesize of output 41 [2022-07-13 15:19:49,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:49,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:49,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:49,687 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 36 treesize of output 26 [2022-07-13 15:19:49,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:49,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 19 [2022-07-13 15:19:49,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:49,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:49,811 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-07-13 15:19:49,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:49,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:49,818 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-07-13 15:19:49,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:49,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:49,824 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2022-07-13 15:19:49,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:49,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-07-13 15:19:49,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:49,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-07-13 15:19:49,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:49,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-07-13 15:19:49,848 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 15:19:49,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-13 15:19:49,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:49,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:49,904 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 26 treesize of output 23 [2022-07-13 15:19:49,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:49,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:49,910 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 26 treesize of output 23 [2022-07-13 15:19:49,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:49,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:49,916 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 24 treesize of output 21 [2022-07-13 15:19:49,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:49,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-07-13 15:19:49,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:49,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-07-13 15:19:49,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:49,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-07-13 15:19:49,941 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:19:49,941 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 11 treesize of output 11 [2022-07-13 15:19:50,026 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 67 treesize of output 47 [2022-07-13 15:19:50,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:50,041 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-07-13 15:19:50,041 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 51 treesize of output 42 [2022-07-13 15:19:50,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-13 15:19:50,133 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:50,133 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 41 treesize of output 29 [2022-07-13 15:19:50,148 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 15:19:50,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:19:50,432 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_729 Int) (v_ArrVal_738 Int) (v_ArrVal_740 (Array Int Int)) (v_ArrVal_746 Int) (v_ArrVal_723 Int) (v_ArrVal_745 Int) (v_ArrVal_744 Int) (v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int)) (v_ArrVal_721 Int) (v_ArrVal_722 (Array Int Int)) (v_ArrVal_731 Int) (v_ArrVal_732 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.base_8| Int) (v_ArrVal_719 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.base_9| Int)) (let ((.cse7 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) (.cse6 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse0 (let ((.cse9 (store (let ((.cse10 (store |c_#memory_int| |v_ULTIMATE.start_main_~n~0#1.base_9| v_ArrVal_724))) (store .cse10 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6 v_ArrVal_729))) |v_ULTIMATE.start_main_~n~0#1.base_8| v_ArrVal_734))) (store .cse9 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6 v_ArrVal_744)))) (.cse2 (select (select (let ((.cse8 (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_9| v_ArrVal_717) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_9| v_ArrVal_722) |c_ULTIMATE.start_main_~list~0#1.base|) .cse6 v_ArrVal_723)))) (store (store .cse8 |v_ULTIMATE.start_main_~n~0#1.base_8| v_ArrVal_740) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store .cse8 |v_ULTIMATE.start_main_~n~0#1.base_8| v_ArrVal_741) |c_ULTIMATE.start_main_~list~0#1.base|) .cse6 v_ArrVal_738))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse7))) (let ((.cse3 (select .cse0 .cse2)) (.cse4 (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_9| v_ArrVal_719) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_9| v_ArrVal_725) |c_ULTIMATE.start_main_~list~0#1.base|) .cse6 v_ArrVal_721)))) (store (store .cse5 |v_ULTIMATE.start_main_~n~0#1.base_8| v_ArrVal_742) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store .cse5 |v_ULTIMATE.start_main_~n~0#1.base_8| v_ArrVal_732) |c_ULTIMATE.start_main_~list~0#1.base|) .cse6 v_ArrVal_745))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse7))) (let ((.cse1 (select .cse3 .cse4))) (or (not (<= v_ArrVal_746 (+ (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse1))) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_9| v_ArrVal_731) |v_ULTIMATE.start_main_~n~0#1.base_8|) 0)) (<= (select (select (store .cse0 .cse2 (store .cse3 .cse4 v_ArrVal_746)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_9|) 0)) (< 100 .cse1))))))) is different from false [2022-07-13 15:19:50,556 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-07-13 15:19:50,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433587178] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:19:50,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:19:50,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 19 [2022-07-13 15:19:50,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579811918] [2022-07-13 15:19:50,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:19:50,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 15:19:50,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:19:50,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 15:19:50,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=251, Unknown=1, NotChecked=32, Total=342 [2022-07-13 15:19:50,558 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:50,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:19:50,848 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-07-13 15:19:50,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 15:19:50,849 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-13 15:19:50,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:19:50,849 INFO L225 Difference]: With dead ends: 32 [2022-07-13 15:19:50,849 INFO L226 Difference]: Without dead ends: 30 [2022-07-13 15:19:50,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=317, Unknown=1, NotChecked=38, Total=462 [2022-07-13 15:19:50,850 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 32 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:19:50,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 54 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 30 Invalid, 0 Unknown, 42 Unchecked, 0.0s Time] [2022-07-13 15:19:50,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-13 15:19:50,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 21. [2022-07-13 15:19:50,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:50,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-07-13 15:19:50,852 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 17 [2022-07-13 15:19:50,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:19:50,852 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-07-13 15:19:50,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:19:50,852 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-07-13 15:19:50,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 15:19:50,853 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:19:50,853 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:19:50,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-13 15:19:51,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:51,067 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:19:51,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:19:51,068 INFO L85 PathProgramCache]: Analyzing trace with hash -2098222328, now seen corresponding path program 1 times [2022-07-13 15:19:51,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:19:51,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074114741] [2022-07-13 15:19:51,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:51,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:19:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:51,325 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:19:51,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:19:51,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074114741] [2022-07-13 15:19:51,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074114741] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:19:51,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317505334] [2022-07-13 15:19:51,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:51,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:51,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:19:51,326 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-13 15:19:51,328 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-13 15:19:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:51,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-13 15:19:51,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:19:51,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:51,457 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 19 [2022-07-13 15:19:51,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:51,462 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 19 [2022-07-13 15:19:51,489 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-07-13 15:19:51,489 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 74 [2022-07-13 15:19:51,515 INFO L356 Elim1Store]: treesize reduction 55, result has 24.7 percent of original size [2022-07-13 15:19:51,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 91 [2022-07-13 15:19:51,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:51,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:51,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:51,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-07-13 15:19:51,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-07-13 15:19:51,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:51,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:51,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:51,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 62 [2022-07-13 15:19:51,673 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 50 treesize of output 36 [2022-07-13 15:19:51,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:51,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:51,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:51,680 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 36 treesize of output 26 [2022-07-13 15:19:51,757 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:19:51,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-13 15:19:51,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:51,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:51,885 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 32 treesize of output 29 [2022-07-13 15:19:51,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:51,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:51,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:51,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2022-07-13 15:19:51,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:51,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:51,920 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 63 treesize of output 54 [2022-07-13 15:19:51,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:51,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 54 treesize of output 46 [2022-07-13 15:19:51,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 27 [2022-07-13 15:19:51,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:51,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-07-13 15:19:51,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:51,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-07-13 15:19:51,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2022-07-13 15:19:51,952 INFO L356 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-07-13 15:19:51,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 36 [2022-07-13 15:19:52,116 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-13 15:19:52,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 173 treesize of output 152 [2022-07-13 15:19:52,121 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 38 [2022-07-13 15:19:52,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 70 [2022-07-13 15:19:52,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:52,288 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:52,293 INFO L356 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2022-07-13 15:19:52,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 114 treesize of output 62 [2022-07-13 15:19:52,301 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-13 15:19:52,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2022-07-13 15:19:52,311 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:19:52,312 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 28 treesize of output 16 [2022-07-13 15:19:52,325 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:19:52,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:19:52,384 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_926 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_924 Int)) (let ((.cse8 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse8))) (let ((.cse1 (select |c_#memory_int| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse8))) (or (<= 101 (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_927)) (.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_926)) (.cse7 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7) 4))) (select (select (store |c_#memory_int| .cse0 (store .cse1 .cse2 v_ArrVal_924)) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))) (not (<= (+ (select .cse1 .cse2) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) v_ArrVal_924))))))) is different from false [2022-07-13 15:19:52,400 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_926 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_924 Int)) (let ((.cse8 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse8))) (let ((.cse0 (select |c_#memory_int| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse8))) (or (not (<= (+ (select .cse0 .cse1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) v_ArrVal_924)) (<= 101 (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_927)) (.cse3 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_926)) (.cse7 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7) 4))) (select (select (store |c_#memory_int| .cse2 (store .cse0 .cse1 v_ArrVal_924)) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5)))))))))) is different from false [2022-07-13 15:19:52,435 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:52,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 660 treesize of output 528 [2022-07-13 15:19:52,448 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:52,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 516 treesize of output 498 [2022-07-13 15:19:52,700 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-13 15:19:52,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317505334] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:19:52,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:19:52,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 23 [2022-07-13 15:19:52,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631328795] [2022-07-13 15:19:52,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:19:52,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-13 15:19:52,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:19:52,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-13 15:19:52,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=368, Unknown=2, NotChecked=78, Total=506 [2022-07-13 15:19:52,702 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:20:00,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:20:00,951 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-07-13 15:20:00,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 15:20:00,952 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-13 15:20:00,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:20:00,952 INFO L225 Difference]: With dead ends: 31 [2022-07-13 15:20:00,953 INFO L226 Difference]: Without dead ends: 24 [2022-07-13 15:20:00,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=161, Invalid=657, Unknown=2, NotChecked=110, Total=930 [2022-07-13 15:20:00,954 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:20:00,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 112 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 84 Invalid, 0 Unknown, 40 Unchecked, 0.1s Time] [2022-07-13 15:20:00,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-13 15:20:00,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-07-13 15:20:00,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 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-13 15:20:00,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-07-13 15:20:00,959 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 19 [2022-07-13 15:20:00,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:20:00,959 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-07-13 15:20:00,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:20:00,959 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-07-13 15:20:00,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 15:20:00,959 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:20:00,960 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:20:00,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 15:20:01,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:20:01,160 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:20:01,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:20:01,161 INFO L85 PathProgramCache]: Analyzing trace with hash -2096375286, now seen corresponding path program 1 times [2022-07-13 15:20:01,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:20:01,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442930998] [2022-07-13 15:20:01,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:20:01,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:20:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:20:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:20:01,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:20:01,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442930998] [2022-07-13 15:20:01,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442930998] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:20:01,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204780981] [2022-07-13 15:20:01,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:20:01,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:20:01,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:20:01,569 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-13 15:20:01,575 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-13 15:20:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:20:01,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 88 conjunts are in the unsatisfiable core [2022-07-13 15:20:01,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:20:01,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:01,709 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 19 [2022-07-13 15:20:01,734 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-07-13 15:20:01,734 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 74 [2022-07-13 15:20:01,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:01,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:01,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:01,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 55 [2022-07-13 15:20:01,762 INFO L356 Elim1Store]: treesize reduction 52, result has 25.7 percent of original size [2022-07-13 15:20:01,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 88 [2022-07-13 15:20:01,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-07-13 15:20:01,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:01,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:01,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:01,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 62 [2022-07-13 15:20:01,860 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 57 treesize of output 41 [2022-07-13 15:20:01,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:01,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:01,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:01,866 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 41 treesize of output 29 [2022-07-13 15:20:01,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:01,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:01,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:01,898 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 36 treesize of output 26 [2022-07-13 15:20:01,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:01,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, 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 19 [2022-07-13 15:20:01,931 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:20:01,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-13 15:20:02,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:02,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:02,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:02,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:02,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:02,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 51 [2022-07-13 15:20:02,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-13 15:20:02,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-07-13 15:20:02,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:02,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:02,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-07-13 15:20:02,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:02,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:02,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-07-13 15:20:02,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:02,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-07-13 15:20:02,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:02,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-07-13 15:20:02,095 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-13 15:20:02,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 30 [2022-07-13 15:20:02,320 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-13 15:20:02,320 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 149 [2022-07-13 15:20:02,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 54 [2022-07-13 15:20:02,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 75 [2022-07-13 15:20:02,564 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:02,570 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-07-13 15:20:02,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 191 treesize of output 107 [2022-07-13 15:20:02,580 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-07-13 15:20:02,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 58 [2022-07-13 15:20:02,584 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 0 case distinctions, treesize of input 52 treesize of output 38 [2022-07-13 15:20:02,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 41 treesize of output 17 [2022-07-13 15:20:02,650 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:20:02,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:20:10,795 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1111 Int) (v_ArrVal_1107 Int)) (let ((.cse12 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse12))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse11 v_ArrVal_1108)) (.cse13 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~list~0#1.base|) .cse13)) (.cse10 (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_1109))) (let ((.cse1 (select (select .cse10 |c_ULTIMATE.start_main_~list~0#1.base|) .cse13)) (.cse9 (+ .cse2 4)) (.cse5 (select |c_#memory_int| .cse11)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse12))) (let ((.cse0 (store |c_#memory_int| .cse11 (store .cse5 .cse6 v_ArrVal_1107))) (.cse7 (select (select .cse10 .cse1) .cse9))) (let ((.cse3 (select .cse0 .cse7)) (.cse4 (select (select .cse8 .cse1) .cse9))) (or (not (<= (+ (select (select .cse0 .cse1) .cse2) v_ArrVal_1111) (select .cse3 .cse4))) (not (<= v_ArrVal_1107 (+ (select .cse5 .cse6) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (<= (select (select (store .cse0 .cse7 (store .cse3 .cse4 v_ArrVal_1111)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109)))))))))) is different from false [2022-07-13 15:20:10,826 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1111 Int) (v_ArrVal_1107 Int)) (let ((.cse12 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse12))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse11 v_ArrVal_1108)) (.cse13 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse10 (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_1109))) (let ((.cse1 (select (select .cse10 |c_ULTIMATE.start_main_~head~0#1.base|) .cse13)) (.cse9 (+ .cse2 4)) (.cse6 (select |c_#memory_int| .cse11)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse12))) (let ((.cse0 (store |c_#memory_int| .cse11 (store .cse6 .cse7 v_ArrVal_1107))) (.cse5 (select (select .cse10 .cse1) .cse9))) (let ((.cse3 (select .cse0 .cse5)) (.cse4 (select (select .cse8 .cse1) .cse9))) (or (not (<= (+ v_ArrVal_1111 (select (select .cse0 .cse1) .cse2)) (select .cse3 .cse4))) (<= (select (select (store .cse0 .cse5 (store .cse3 .cse4 v_ArrVal_1111)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109) (not (<= v_ArrVal_1107 (+ (select .cse6 .cse7) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))))))))) is different from false [2022-07-13 15:20:10,915 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:10,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1929 treesize of output 1731 [2022-07-13 15:20:10,945 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:10,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1719 treesize of output 1575 [2022-07-13 15:20:11,570 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-13 15:20:11,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204780981] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:20:11,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:20:11,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 24 [2022-07-13 15:20:11,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320065748] [2022-07-13 15:20:11,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:20:11,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-13 15:20:11,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:20:11,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-13 15:20:11,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=370, Unknown=6, NotChecked=82, Total=552 [2022-07-13 15:20:11,572 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:20:26,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:20:26,203 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-07-13 15:20:26,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 15:20:26,204 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-13 15:20:26,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:20:26,204 INFO L225 Difference]: With dead ends: 40 [2022-07-13 15:20:26,204 INFO L226 Difference]: Without dead ends: 38 [2022-07-13 15:20:26,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=193, Invalid=675, Unknown=10, NotChecked=114, Total=992 [2022-07-13 15:20:26,205 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 61 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:20:26,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 112 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 94 Unchecked, 0.1s Time] [2022-07-13 15:20:26,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-13 15:20:26,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-07-13 15:20:26,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 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-13 15:20:26,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-07-13 15:20:26,209 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 19 [2022-07-13 15:20:26,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:20:26,209 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-07-13 15:20:26,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:20:26,209 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-07-13 15:20:26,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 15:20:26,210 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:20:26,210 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:20:26,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 15:20:26,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:20:26,420 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:20:26,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:20:26,420 INFO L85 PathProgramCache]: Analyzing trace with hash -2096373364, now seen corresponding path program 1 times [2022-07-13 15:20:26,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:20:26,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438727117] [2022-07-13 15:20:26,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:20:26,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:20:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:20:26,692 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:20:26,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:20:26,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438727117] [2022-07-13 15:20:26,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438727117] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:20:26,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709120187] [2022-07-13 15:20:26,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:20:26,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:20:26,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:20:26,694 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-13 15:20:26,695 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-13 15:20:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:20:26,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-13 15:20:26,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:20:26,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:26,816 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 19 [2022-07-13 15:20:26,825 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:20:26,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-13 15:20:26,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:26,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:26,887 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2022-07-13 15:20:26,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2022-07-13 15:20:26,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-07-13 15:20:26,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:26,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:26,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-07-13 15:20:26,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2022-07-13 15:20:26,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:26,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-07-13 15:20:26,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:20:26,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-07-13 15:20:26,936 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-13 15:20:26,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 30 [2022-07-13 15:20:26,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-13 15:20:27,104 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-13 15:20:27,105 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 105 [2022-07-13 15:20:27,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2022-07-13 15:20:27,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-07-13 15:20:29,322 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:29,328 INFO L356 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2022-07-13 15:20:29,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 205 treesize of output 103 [2022-07-13 15:20:29,337 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-13 15:20:29,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 46 [2022-07-13 15:20:29,340 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 39 treesize of output 26 [2022-07-13 15:20:29,373 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:20:29,373 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 28 treesize of output 16 [2022-07-13 15:20:29,379 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:20:29,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:20:33,588 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| .cse10 v_ArrVal_1279)) (.cse11 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~list~0#1.base|) .cse11)) (.cse9 (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_1280))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~list~0#1.base|) .cse11)) (.cse8 (+ .cse6 4))) (let ((.cse0 (store |c_#memory_int| .cse10 v_ArrVal_1281)) (.cse1 (select (select .cse9 .cse5) .cse8))) (let ((.cse2 (select .cse0 .cse1)) (.cse3 (select (select .cse7 .cse5) .cse8))) (let ((.cse4 (select .cse2 .cse3))) (or (<= 91 (select (select (store .cse0 .cse1 (store .cse2 .cse3 v_ArrVal_1283)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (<= .cse4 100) (not (<= .cse4 (+ v_ArrVal_1283 (select (select .cse0 .cse5) .cse6))))))))))))) is different from false [2022-07-13 15:20:33,618 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| .cse10 v_ArrVal_1279)) (.cse11 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse9 (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_1280))) (let ((.cse2 (select (select .cse9 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse8 (+ 4 .cse3))) (let ((.cse1 (store |c_#memory_int| .cse10 v_ArrVal_1281)) (.cse4 (select (select .cse9 .cse2) .cse8))) (let ((.cse5 (select .cse1 .cse4)) (.cse6 (select (select .cse7 .cse2) .cse8))) (let ((.cse0 (select .cse5 .cse6))) (or (not (<= .cse0 (+ (select (select .cse1 .cse2) .cse3) v_ArrVal_1283))) (<= .cse0 100) (<= 91 (select (select (store .cse1 .cse4 (store .cse5 .cse6 v_ArrVal_1283)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))))))))))) is different from false [2022-07-13 15:20:33,677 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:33,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1896 treesize of output 1428 [2022-07-13 15:20:33,696 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:33,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 1416 treesize of output 1370 [2022-07-13 15:20:33,770 INFO L356 Elim1Store]: treesize reduction 16, result has 66.7 percent of original size [2022-07-13 15:20:33,771 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 2631 treesize of output 2398 [2022-07-13 15:20:35,536 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:35,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32680 treesize of output 31561 [2022-07-13 15:20:36,384 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:36,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 601998 treesize of output 546740 [2022-07-13 15:20:37,273 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:37,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 544860 treesize of output 523338 [2022-07-13 15:20:38,753 INFO L244 Elim1Store]: Index analysis took 224 ms [2022-07-13 15:20:50,965 WARN L233 SmtUtils]: Spent 12.20s on a formula simplification that was a NOOP. DAG size: 741 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-13 15:20:50,966 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:20:50,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 171 case distinctions, treesize of input 522505 treesize of output 522268 [2022-07-13 15:20:55,422 INFO L244 Elim1Store]: Index analysis took 2215 ms [2022-07-13 15:21:11,658 WARN L233 SmtUtils]: Spent 16.22s on a formula simplification that was a NOOP. DAG size: 741 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-13 15:21:11,658 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:11,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 171 case distinctions, treesize of input 528028 treesize of output 523850 [2022-07-13 15:21:15,416 INFO L244 Elim1Store]: Index analysis took 113 ms [2022-07-13 15:21:17,602 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:17,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 358378 treesize of output 354430 [2022-07-13 15:21:26,805 WARN L233 SmtUtils]: Spent 9.19s on a formula simplification. DAG size of input: 4445 DAG size of output: 4441 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)