./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/hash_fun.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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/hash_fun.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 0abab60f5c601fd8191c1a2aa712d4ab55460e987c7d41ca7527c2934792cc0b --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 14:59:22,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 14:59:22,340 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 14:59:22,383 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 14:59:22,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 14:59:22,385 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 14:59:22,387 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 14:59:22,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 14:59:22,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 14:59:22,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 14:59:22,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 14:59:22,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 14:59:22,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 14:59:22,402 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 14:59:22,403 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 14:59:22,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 14:59:22,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 14:59:22,407 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 14:59:22,409 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 14:59:22,416 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 14:59:22,418 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 14:59:22,419 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 14:59:22,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 14:59:22,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 14:59:22,422 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 14:59:22,429 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 14:59:22,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 14:59:22,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 14:59:22,430 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 14:59:22,431 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 14:59:22,432 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 14:59:22,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 14:59:22,434 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 14:59:22,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 14:59:22,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 14:59:22,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 14:59:22,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 14:59:22,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 14:59:22,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 14:59:22,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 14:59:22,438 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 14:59:22,439 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 14:59:22,440 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 14:59:22,470 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 14:59:22,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 14:59:22,471 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 14:59:22,471 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 14:59:22,472 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 14:59:22,472 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 14:59:22,473 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 14:59:22,473 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 14:59:22,473 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 14:59:22,474 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 14:59:22,474 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 14:59:22,475 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 14:59:22,475 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 14:59:22,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 14:59:22,475 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 14:59:22,475 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 14:59:22,476 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 14:59:22,476 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 14:59:22,476 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 14:59:22,478 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 14:59:22,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 14:59:22,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 14:59:22,478 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 14:59:22,478 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 14:59:22,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:59:22,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 14:59:22,479 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 14:59:22,479 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 14:59:22,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 14:59:22,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 14:59:22,480 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 14:59:22,480 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 14:59:22,480 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 14:59:22,481 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 -> 0abab60f5c601fd8191c1a2aa712d4ab55460e987c7d41ca7527c2934792cc0b [2022-07-22 14:59:22,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 14:59:22,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 14:59:22,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 14:59:22,716 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 14:59:22,717 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 14:59:22,718 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/hash_fun.i [2022-07-22 14:59:22,776 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f04374230/df9baa90fa3b4ee3924543229de50a1a/FLAGc47980024 [2022-07-22 14:59:23,303 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 14:59:23,303 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/hash_fun.i [2022-07-22 14:59:23,314 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f04374230/df9baa90fa3b4ee3924543229de50a1a/FLAGc47980024 [2022-07-22 14:59:23,646 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f04374230/df9baa90fa3b4ee3924543229de50a1a [2022-07-22 14:59:23,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 14:59:23,650 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 14:59:23,652 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 14:59:23,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 14:59:23,657 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 14:59:23,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:59:23" (1/1) ... [2022-07-22 14:59:23,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f4b79ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:59:23, skipping insertion in model container [2022-07-22 14:59:23,659 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:59:23" (1/1) ... [2022-07-22 14:59:23,664 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 14:59:23,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:59:24,034 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/hash_fun.i[23732,23745] [2022-07-22 14:59:24,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:59:24,048 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 14:59:24,096 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/hash_fun.i[23732,23745] [2022-07-22 14:59:24,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:59:24,129 INFO L208 MainTranslator]: Completed translation [2022-07-22 14:59:24,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:59:24 WrapperNode [2022-07-22 14:59:24,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 14:59:24,132 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 14:59:24,132 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 14:59:24,132 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 14:59:24,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:59:24" (1/1) ... [2022-07-22 14:59:24,166 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:59:24" (1/1) ... [2022-07-22 14:59:24,190 INFO L137 Inliner]: procedures = 125, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2022-07-22 14:59:24,191 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 14:59:24,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 14:59:24,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 14:59:24,192 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 14:59:24,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:59:24" (1/1) ... [2022-07-22 14:59:24,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:59:24" (1/1) ... [2022-07-22 14:59:24,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:59:24" (1/1) ... [2022-07-22 14:59:24,207 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:59:24" (1/1) ... [2022-07-22 14:59:24,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:59:24" (1/1) ... [2022-07-22 14:59:24,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:59:24" (1/1) ... [2022-07-22 14:59:24,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:59:24" (1/1) ... [2022-07-22 14:59:24,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 14:59:24,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 14:59:24,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 14:59:24,243 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 14:59:24,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:59:24" (1/1) ... [2022-07-22 14:59:24,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:59:24,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:59:24,276 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-22 14:59:24,301 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-22 14:59:24,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 14:59:24,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 14:59:24,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 14:59:24,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 14:59:24,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 14:59:24,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 14:59:24,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 14:59:24,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 14:59:24,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 14:59:24,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 14:59:24,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 14:59:24,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 14:59:24,488 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 14:59:24,490 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 14:59:24,616 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 14:59:24,621 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 14:59:24,621 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 14:59:24,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:59:24 BoogieIcfgContainer [2022-07-22 14:59:24,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 14:59:24,624 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 14:59:24,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 14:59:24,627 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 14:59:24,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 02:59:23" (1/3) ... [2022-07-22 14:59:24,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@293170b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:59:24, skipping insertion in model container [2022-07-22 14:59:24,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:59:24" (2/3) ... [2022-07-22 14:59:24,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@293170b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:59:24, skipping insertion in model container [2022-07-22 14:59:24,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:59:24" (3/3) ... [2022-07-22 14:59:24,630 INFO L111 eAbstractionObserver]: Analyzing ICFG hash_fun.i [2022-07-22 14:59:24,643 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 14:59:24,644 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 14:59:24,713 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 14:59:24,720 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@5cb5cb7c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6c3bbad7 [2022-07-22 14:59:24,721 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 14:59:24,733 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:24,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-22 14:59:24,740 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:59:24,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:59:24,742 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:59:24,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:59:24,747 INFO L85 PathProgramCache]: Analyzing trace with hash 859985196, now seen corresponding path program 1 times [2022-07-22 14:59:24,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:59:24,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869052479] [2022-07-22 14:59:24,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:59:24,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:59:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:59:24,910 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-22 14:59:24,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:59:24,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869052479] [2022-07-22 14:59:24,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869052479] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:59:24,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:59:24,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 14:59:24,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678614265] [2022-07-22 14:59:24,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:59:24,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 14:59:24,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:59:24,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 14:59:24,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:59:24,954 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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-22 14:59:24,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:59:24,966 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-07-22 14:59:24,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 14:59:24,969 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-07-22 14:59:24,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:59:24,976 INFO L225 Difference]: With dead ends: 30 [2022-07-22 14:59:24,976 INFO L226 Difference]: Without dead ends: 15 [2022-07-22 14:59:24,979 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-22 14:59:24,983 INFO L413 NwaCegarLoop]: 23 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, 23 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-22 14:59:24,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:59:25,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-22 14:59:25,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-22 14:59:25,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:25,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2022-07-22 14:59:25,016 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 8 [2022-07-22 14:59:25,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:59:25,017 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-07-22 14:59:25,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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-22 14:59:25,018 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2022-07-22 14:59:25,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 14:59:25,019 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:59:25,019 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:59:25,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 14:59:25,020 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:59:25,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:59:25,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1231547617, now seen corresponding path program 1 times [2022-07-22 14:59:25,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:59:25,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80181316] [2022-07-22 14:59:25,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:59:25,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:59:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:59:25,133 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-22 14:59:25,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:59:25,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80181316] [2022-07-22 14:59:25,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80181316] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:59:25,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:59:25,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:59:25,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521092347] [2022-07-22 14:59:25,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:59:25,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:59:25,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:59:25,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:59:25,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:59:25,140 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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-22 14:59:25,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:59:25,182 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-07-22 14:59:25,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 14:59:25,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-07-22 14:59:25,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:59:25,183 INFO L225 Difference]: With dead ends: 29 [2022-07-22 14:59:25,184 INFO L226 Difference]: Without dead ends: 20 [2022-07-22 14:59:25,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:59:25,191 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:59:25,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:59:25,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-22 14:59:25,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-22 14:59:25,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 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-22 14:59:25,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-07-22 14:59:25,196 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 9 [2022-07-22 14:59:25,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:59:25,196 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-22 14:59:25,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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-22 14:59:25,197 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-07-22 14:59:25,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-22 14:59:25,197 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:59:25,198 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:59:25,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 14:59:25,198 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:59:25,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:59:25,199 INFO L85 PathProgramCache]: Analyzing trace with hash -2121530184, now seen corresponding path program 1 times [2022-07-22 14:59:25,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:59:25,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152030549] [2022-07-22 14:59:25,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:59:25,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:59:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:59:25,336 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-22 14:59:25,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:59:25,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152030549] [2022-07-22 14:59:25,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152030549] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:59:25,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518513013] [2022-07-22 14:59:25,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:59:25,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:59:25,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:59:25,339 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-22 14:59:25,351 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-22 14:59:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:59:25,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-22 14:59:25,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:59:25,550 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 6 treesize of output 5 [2022-07-22 14:59:25,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-22 14:59:25,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:59:25,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:59:25,723 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 20 treesize of output 22 [2022-07-22 14:59:25,750 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-22 14:59:25,751 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 15 treesize of output 15 [2022-07-22 14:59:25,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:59:25,881 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 37 treesize of output 25 [2022-07-22 14:59:25,889 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-22 14:59:25,904 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-22 14:59:25,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:59:25,961 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:59:25,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-22 14:59:25,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-22 14:59:25,983 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-22 14:59:25,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518513013] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:59:25,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:59:25,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-07-22 14:59:25,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358458328] [2022-07-22 14:59:25,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:59:25,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 14:59:25,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:59:25,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 14:59:25,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-22 14:59:25,986 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:26,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:59:26,061 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-07-22 14:59:26,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 14:59:26,061 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-22 14:59:26,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:59:26,062 INFO L225 Difference]: With dead ends: 30 [2022-07-22 14:59:26,062 INFO L226 Difference]: Without dead ends: 28 [2022-07-22 14:59:26,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-22 14:59:26,064 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 37 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:59:26,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 36 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:59:26,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-22 14:59:26,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-07-22 14:59:26,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:26,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2022-07-22 14:59:26,069 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 15 [2022-07-22 14:59:26,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:59:26,069 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-07-22 14:59:26,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:26,069 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2022-07-22 14:59:26,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-22 14:59:26,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:59:26,070 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:59:26,102 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-22 14:59:26,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:59:26,283 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:59:26,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:59:26,284 INFO L85 PathProgramCache]: Analyzing trace with hash -2121528262, now seen corresponding path program 1 times [2022-07-22 14:59:26,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:59:26,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445406694] [2022-07-22 14:59:26,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:59:26,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:59:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:59:26,409 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-22 14:59:26,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:59:26,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445406694] [2022-07-22 14:59:26,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445406694] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:59:26,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019325754] [2022-07-22 14:59:26,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:59:26,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:59:26,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:59:26,412 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-22 14:59:26,414 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-22 14:59:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:59:26,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-22 14:59:26,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:59:26,501 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 6 treesize of output 5 [2022-07-22 14:59:26,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:59:26,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-22 14:59:26,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:59:26,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:59:26,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-22 14:59:26,580 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-22 14:59:26,581 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 15 treesize of output 15 [2022-07-22 14:59:26,660 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 35 treesize of output 23 [2022-07-22 14:59:26,666 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-22 14:59:26,677 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-22 14:59:26,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:59:26,718 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:59:26,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-22 14:59:26,723 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 20 treesize of output 16 [2022-07-22 14:59:26,739 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-22 14:59:26,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019325754] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:59:26,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:59:26,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-07-22 14:59:26,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308520104] [2022-07-22 14:59:26,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:59:26,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 14:59:26,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:59:26,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 14:59:26,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-22 14:59:26,744 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 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-22 14:59:26,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:59:26,832 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-07-22 14:59:26,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 14:59:26,833 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-22 14:59:26,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:59:26,834 INFO L225 Difference]: With dead ends: 32 [2022-07-22 14:59:26,834 INFO L226 Difference]: Without dead ends: 25 [2022-07-22 14:59:26,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-22 14:59:26,837 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 42 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:59:26,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 44 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:59:26,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-22 14:59:26,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-07-22 14:59:26,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 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-22 14:59:26,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-07-22 14:59:26,846 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 15 [2022-07-22 14:59:26,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:59:26,847 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-07-22 14:59:26,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 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-22 14:59:26,847 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-07-22 14:59:26,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 14:59:26,847 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:59:26,848 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:59:26,868 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-22 14:59:27,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-22 14:59:27,060 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:59:27,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:59:27,060 INFO L85 PathProgramCache]: Analyzing trace with hash -2123144338, now seen corresponding path program 1 times [2022-07-22 14:59:27,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:59:27,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479776034] [2022-07-22 14:59:27,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:59:27,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:59:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:59:27,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:59:27,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:59:27,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479776034] [2022-07-22 14:59:27,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479776034] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:59:27,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151337206] [2022-07-22 14:59:27,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:59:27,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:59:27,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:59:27,244 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-22 14:59:27,246 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-22 14:59:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:59:27,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-22 14:59:27,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:59:27,359 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 6 treesize of output 5 [2022-07-22 14:59:27,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:59:27,436 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 49 treesize of output 25 [2022-07-22 14:59:27,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:59:27,446 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 65 treesize of output 33 [2022-07-22 14:59:27,455 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-22 14:59:27,456 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 15 treesize of output 15 [2022-07-22 14:59:27,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:59:27,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:59:27,562 INFO L356 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2022-07-22 14:59:27,562 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 66 [2022-07-22 14:59:27,570 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 14:59:27,570 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 46 [2022-07-22 14:59:27,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-07-22 14:59:27,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-07-22 14:59:27,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:59:27,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:59:27,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:59:27,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151337206] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:59:27,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:59:27,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-07-22 14:59:27,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875171042] [2022-07-22 14:59:27,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:59:27,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 14:59:27,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:59:27,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 14:59:27,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-22 14:59:27,824 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 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-22 14:59:27,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:59:27,866 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-07-22 14:59:27,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 14:59:27,867 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-22 14:59:27,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:59:27,868 INFO L225 Difference]: With dead ends: 44 [2022-07-22 14:59:27,868 INFO L226 Difference]: Without dead ends: 30 [2022-07-22 14:59:27,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-22 14:59:27,869 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:59:27,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 95 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 9 Unchecked, 0.0s Time] [2022-07-22 14:59:27,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-22 14:59:27,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-22 14:59:27,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:59:27,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-07-22 14:59:27,874 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 20 [2022-07-22 14:59:27,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:59:27,874 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-07-22 14:59:27,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 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-22 14:59:27,874 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-07-22 14:59:27,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-22 14:59:27,875 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:59:27,875 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:59:27,899 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-22 14:59:28,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:59:28,092 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:59:28,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:59:28,092 INFO L85 PathProgramCache]: Analyzing trace with hash -153301193, now seen corresponding path program 2 times [2022-07-22 14:59:28,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:59:28,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130430354] [2022-07-22 14:59:28,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:59:28,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:59:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:59:28,257 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:59:28,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:59:28,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130430354] [2022-07-22 14:59:28,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130430354] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:59:28,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780934636] [2022-07-22 14:59:28,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 14:59:28,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:59:28,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:59:28,260 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-22 14:59:28,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 14:59:28,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 14:59:28,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 14:59:28,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-22 14:59:28,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:59:28,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-22 14:59:28,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:59:28,410 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 10 treesize of output 9 [2022-07-22 14:59:28,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:59:28,414 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 20 treesize of output 22 [2022-07-22 14:59:28,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 14:59:28,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:59:28,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:59:28,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:59:28,538 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 23 treesize of output 27 [2022-07-22 14:59:28,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:59:28,546 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 73 treesize of output 41 [2022-07-22 14:59:28,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:59:28,553 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 65 treesize of output 33 [2022-07-22 14:59:28,562 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-07-22 14:59:28,563 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 23 treesize of output 23 [2022-07-22 14:59:28,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:59:28,725 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:59:28,728 INFO L356 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2022-07-22 14:59:28,728 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 82 [2022-07-22 14:59:28,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:59:28,738 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 14:59:28,738 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 46 [2022-07-22 14:59:28,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:59:28,745 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 20 treesize of output 22 [2022-07-22 14:59:28,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:59:28,849 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 57 treesize of output 33 [2022-07-22 14:59:28,856 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:59:28,857 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-22 14:59:28,864 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:59:28,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:59:28,889 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_299 (Array Int Int))) (<= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_299) (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) (+ |c_ULTIMATE.start_main_~base~0#1| 99))) is different from false [2022-07-22 14:59:29,186 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:59:29,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 156 treesize of output 157 [2022-07-22 14:59:29,216 INFO L356 Elim1Store]: treesize reduction 69, result has 51.7 percent of original size [2022-07-22 14:59:29,216 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 14290 treesize of output 13020 [2022-07-22 14:59:29,410 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 2509 treesize of output 2477 [2022-07-22 14:59:29,438 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 1251 treesize of output 1235 [2022-07-22 14:59:29,461 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 2461 treesize of output 2397 [2022-07-22 14:59:29,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-22 14:59:38,783 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-22 14:59:38,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780934636] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:59:38,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:59:38,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-07-22 14:59:38,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485798476] [2022-07-22 14:59:38,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:59:38,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 14:59:38,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:59:38,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 14:59:38,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2022-07-22 14:59:38,786 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 0 states have call successors, (0), 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-22 15:00:17,332 WARN L233 SmtUtils]: Spent 30.61s on a formula simplification. DAG size of input: 84 DAG size of output: 74 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 15:00:17,428 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (< (+ .cse0 1) |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (< (+ .cse1 1) |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (< (select (select |c_#memory_int| .cse1) 0) (+ |c_ULTIMATE.start_main_~base~0#1| 100)) (forall ((v_ArrVal_295 Int) (v_ArrVal_294 Int) (v_ArrVal_292 Int) (v_ArrVal_288 (Array Int Int)) (v_ArrVal_299 (Array Int Int))) (or (<= (select (select (store (store |c_#memory_int| v_ArrVal_295 v_ArrVal_288) |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_299) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| v_ArrVal_295 (store (store (select |c_#memory_$Pointer$.base| v_ArrVal_295) 4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_294)))) (store .cse2 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_295))) v_ArrVal_295) 4)) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| v_ArrVal_295 (store (store (select |c_#memory_$Pointer$.offset| v_ArrVal_295) 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_292)))) (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0))) v_ArrVal_295) 4)) (+ |c_ULTIMATE.start_main_~base~0#1| 99)) (not (= (select |c_#valid| v_ArrVal_295) 0)) (not (< v_ArrVal_295 |c_#StackHeapBarrier|)))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#list~0#1.base|) (not (= .cse0 .cse1))))) is different from false [2022-07-22 15:00:19,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:00:19,133 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2022-07-22 15:00:19,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 15:00:19,134 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-22 15:00:19,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:00:19,135 INFO L225 Difference]: With dead ends: 77 [2022-07-22 15:00:19,135 INFO L226 Difference]: Without dead ends: 75 [2022-07-22 15:00:19,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 40.5s TimeCoverageRelationStatistics Valid=114, Invalid=301, Unknown=13, NotChecked=78, Total=506 [2022-07-22 15:00:19,136 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 40 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 15:00:19,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 100 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 115 Unchecked, 0.1s Time] [2022-07-22 15:00:19,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-22 15:00:19,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 56. [2022-07-22 15:00:19,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:00:19,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 74 transitions. [2022-07-22 15:00:19,144 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 74 transitions. Word has length 26 [2022-07-22 15:00:19,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:00:19,144 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 74 transitions. [2022-07-22 15:00:19,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 0 states have call successors, (0), 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-22 15:00:19,145 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-07-22 15:00:19,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-22 15:00:19,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:00:19,145 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:00:19,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 15:00:19,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:00:19,357 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:00:19,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:00:19,357 INFO L85 PathProgramCache]: Analyzing trace with hash -153299271, now seen corresponding path program 1 times [2022-07-22 15:00:19,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:00:19,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289759225] [2022-07-22 15:00:19,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:00:19,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:00:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:00:19,523 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:00:19,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:00:19,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289759225] [2022-07-22 15:00:19,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289759225] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:00:19,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915596403] [2022-07-22 15:00:19,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:00:19,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:00:19,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:00:19,526 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-22 15:00:19,527 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-22 15:00:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:00:19,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-22 15:00:19,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:00:19,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-22 15:00:19,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 15:00:19,690 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 10 treesize of output 9 [2022-07-22 15:00:19,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:19,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-22 15:00:19,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 15:00:19,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:19,813 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 49 treesize of output 25 [2022-07-22 15:00:19,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:19,820 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 71 treesize of output 39 [2022-07-22 15:00:19,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:19,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:19,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:19,827 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 29 treesize of output 33 [2022-07-22 15:00:19,836 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-07-22 15:00:19,836 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 23 treesize of output 23 [2022-07-22 15:00:19,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:19,987 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:00:19,989 INFO L356 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2022-07-22 15:00:19,990 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 80 [2022-07-22 15:00:19,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:19,999 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 15:00:20,000 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 46 [2022-07-22 15:00:20,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:20,009 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 18 treesize of output 20 [2022-07-22 15:00:20,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:20,082 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 55 treesize of output 31 [2022-07-22 15:00:20,089 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:00:20,090 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-22 15:00:20,098 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:00:20,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:00:20,119 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_421 (Array Int Int))) (<= |c_ULTIMATE.start_main_~base~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_421) (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))))) is different from false [2022-07-22 15:00:20,329 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:00:20,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 159 [2022-07-22 15:00:20,356 INFO L356 Elim1Store]: treesize reduction 69, result has 51.7 percent of original size [2022-07-22 15:00:20,357 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 3498 treesize of output 3236 [2022-07-22 15:00:20,392 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 633 treesize of output 625 [2022-07-22 15:00:20,400 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 625 treesize of output 609 [2022-07-22 15:00:20,407 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 609 treesize of output 605 [2022-07-22 15:00:20,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-22 15:00:20,607 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-07-22 15:00:20,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915596403] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:00:20,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 15:00:20,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-07-22 15:00:20,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309560148] [2022-07-22 15:00:20,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 15:00:20,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-22 15:00:20,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:00:20,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 15:00:20,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=142, Unknown=1, NotChecked=24, Total=210 [2022-07-22 15:00:20,610 INFO L87 Difference]: Start difference. First operand 56 states and 74 transitions. Second operand has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 states have internal predecessors, (70), 0 states have call successors, (0), 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-22 15:00:22,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:00:22,016 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2022-07-22 15:00:22,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 15:00:22,016 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-22 15:00:22,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:00:22,017 INFO L225 Difference]: With dead ends: 68 [2022-07-22 15:00:22,017 INFO L226 Difference]: Without dead ends: 61 [2022-07-22 15:00:22,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=98, Invalid=245, Unknown=3, NotChecked=34, Total=380 [2022-07-22 15:00:22,018 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 32 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 15:00:22,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 93 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 76 Invalid, 0 Unknown, 45 Unchecked, 0.1s Time] [2022-07-22 15:00:22,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-22 15:00:22,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-07-22 15:00:22,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:00:22,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2022-07-22 15:00:22,028 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 26 [2022-07-22 15:00:22,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:00:22,028 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2022-07-22 15:00:22,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 states have internal predecessors, (70), 0 states have call successors, (0), 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-22 15:00:22,029 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2022-07-22 15:00:22,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-22 15:00:22,030 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:00:22,030 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-07-22 15:00:22,050 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-22 15:00:22,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:00:22,240 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:00:22,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:00:22,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1774735439, now seen corresponding path program 3 times [2022-07-22 15:00:22,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:00:22,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745151387] [2022-07-22 15:00:22,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:00:22,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:00:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:00:22,406 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:00:22,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:00:22,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745151387] [2022-07-22 15:00:22,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745151387] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:00:22,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496004656] [2022-07-22 15:00:22,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 15:00:22,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:00:22,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:00:22,408 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-22 15:00:22,408 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-22 15:00:22,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-22 15:00:22,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 15:00:22,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 87 conjunts are in the unsatisfiable core [2022-07-22 15:00:22,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:00:22,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:22,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:22,586 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 53 treesize of output 27 [2022-07-22 15:00:22,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:22,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:22,592 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 69 treesize of output 35 [2022-07-22 15:00:22,596 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 10 treesize of output 9 [2022-07-22 15:00:22,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:22,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:22,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:22,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 54 [2022-07-22 15:00:22,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:22,717 INFO L356 Elim1Store]: treesize reduction 182, result has 6.7 percent of original size [2022-07-22 15:00:22,718 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 2 case distinctions, treesize of input 94 treesize of output 64 [2022-07-22 15:00:22,727 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-07-22 15:00:22,728 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 23 treesize of output 23 [2022-07-22 15:00:22,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:22,861 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:00:22,877 INFO L356 Elim1Store]: treesize reduction 70, result has 9.1 percent of original size [2022-07-22 15:00:22,878 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 7 new quantified variables, introduced 7 case distinctions, treesize of input 139 treesize of output 101 [2022-07-22 15:00:22,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:22,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:22,888 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 15:00:22,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2022-07-22 15:00:23,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:23,010 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:00:23,032 INFO L356 Elim1Store]: treesize reduction 164, result has 14.1 percent of original size [2022-07-22 15:00:23,032 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 6 new quantified variables, introduced 7 case distinctions, treesize of input 113 treesize of output 96 [2022-07-22 15:00:23,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:23,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:23,042 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 15:00:23,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 83 [2022-07-22 15:00:23,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:23,097 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-07-22 15:00:23,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 52 [2022-07-22 15:00:23,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:23,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:23,103 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 0 case distinctions, treesize of input 38 treesize of output 15 [2022-07-22 15:00:23,108 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:00:23,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:00:23,742 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:00:23,743 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 1655 treesize of output 1660 [2022-07-22 15:00:51,335 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:00:51,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496004656] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:00:51,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 15:00:51,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-07-22 15:00:51,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014216822] [2022-07-22 15:00:51,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 15:00:51,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-22 15:00:51,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:00:51,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 15:00:51,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=219, Unknown=7, NotChecked=0, Total=272 [2022-07-22 15:00:51,337 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:00:55,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:00:55,658 INFO L93 Difference]: Finished difference Result 110 states and 138 transitions. [2022-07-22 15:00:55,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 15:00:55,661 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-22 15:00:55,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:00:55,662 INFO L225 Difference]: With dead ends: 110 [2022-07-22 15:00:55,662 INFO L226 Difference]: Without dead ends: 91 [2022-07-22 15:00:55,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 31.8s TimeCoverageRelationStatistics Valid=69, Invalid=342, Unknown=9, NotChecked=0, Total=420 [2022-07-22 15:00:55,663 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 36 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 15:00:55,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 286 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 37 Unchecked, 0.1s Time] [2022-07-22 15:00:55,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-22 15:00:55,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2022-07-22 15:00:55,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 88 states have internal predecessors, (113), 0 states have call successors, (0), 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-22 15:00:55,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 113 transitions. [2022-07-22 15:00:55,676 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 113 transitions. Word has length 31 [2022-07-22 15:00:55,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:00:55,677 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 113 transitions. [2022-07-22 15:00:55,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:00:55,677 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2022-07-22 15:00:55,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 15:00:55,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:00:55,679 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:00:55,703 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-22 15:00:55,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:00:55,900 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:00:55,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:00:55,902 INFO L85 PathProgramCache]: Analyzing trace with hash 632278213, now seen corresponding path program 1 times [2022-07-22 15:00:55,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:00:55,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252879347] [2022-07-22 15:00:55,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:00:55,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:00:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:00:55,954 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 15:00:55,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:00:55,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252879347] [2022-07-22 15:00:55,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252879347] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:00:55,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:00:55,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 15:00:55,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522085667] [2022-07-22 15:00:55,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:00:55,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 15:00:55,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:00:55,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 15:00:55,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:00:55,957 INFO L87 Difference]: Start difference. First operand 89 states and 113 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-22 15:00:55,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:00:55,983 INFO L93 Difference]: Finished difference Result 225 states and 281 transitions. [2022-07-22 15:00:55,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 15:00:55,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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) Word has length 32 [2022-07-22 15:00:55,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:00:55,984 INFO L225 Difference]: With dead ends: 225 [2022-07-22 15:00:55,984 INFO L226 Difference]: Without dead ends: 132 [2022-07-22 15:00:55,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:00:55,987 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 15:00:55,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 32 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 15:00:55,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-22 15:00:56,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 99. [2022-07-22 15:00:56,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.2551020408163265) internal successors, (123), 98 states have internal predecessors, (123), 0 states have call successors, (0), 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-22 15:00:56,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 123 transitions. [2022-07-22 15:00:56,010 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 123 transitions. Word has length 32 [2022-07-22 15:00:56,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:00:56,010 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 123 transitions. [2022-07-22 15:00:56,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-22 15:00:56,011 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2022-07-22 15:00:56,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 15:00:56,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:00:56,012 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:00:56,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 15:00:56,012 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:00:56,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:00:56,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1727239095, now seen corresponding path program 2 times [2022-07-22 15:00:56,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:00:56,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831329990] [2022-07-22 15:00:56,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:00:56,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:00:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:00:56,055 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 15:00:56,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:00:56,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831329990] [2022-07-22 15:00:56,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831329990] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:00:56,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:00:56,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 15:00:56,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933924249] [2022-07-22 15:00:56,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:00:56,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 15:00:56,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:00:56,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 15:00:56,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:00:56,060 INFO L87 Difference]: Start difference. First operand 99 states and 123 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-22 15:00:56,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:00:56,078 INFO L93 Difference]: Finished difference Result 135 states and 160 transitions. [2022-07-22 15:00:56,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 15:00:56,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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) Word has length 32 [2022-07-22 15:00:56,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:00:56,080 INFO L225 Difference]: With dead ends: 135 [2022-07-22 15:00:56,080 INFO L226 Difference]: Without dead ends: 92 [2022-07-22 15:00:56,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:00:56,081 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 15:00:56,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 15:00:56,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-22 15:00:56,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2022-07-22 15:00:56,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.1818181818181819) internal successors, (104), 88 states have internal predecessors, (104), 0 states have call successors, (0), 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-22 15:00:56,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2022-07-22 15:00:56,099 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 32 [2022-07-22 15:00:56,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:00:56,100 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2022-07-22 15:00:56,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-22 15:00:56,100 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2022-07-22 15:00:56,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-22 15:00:56,103 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:00:56,103 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:00:56,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 15:00:56,103 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:00:56,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:00:56,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1465132951, now seen corresponding path program 1 times [2022-07-22 15:00:56,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:00:56,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020727455] [2022-07-22 15:00:56,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:00:56,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:00:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:00:56,319 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 15:00:56,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:00:56,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020727455] [2022-07-22 15:00:56,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020727455] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:00:56,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901039257] [2022-07-22 15:00:56,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:00:56,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:00:56,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:00:56,321 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-22 15:00:56,322 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-22 15:00:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:00:56,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 91 conjunts are in the unsatisfiable core [2022-07-22 15:00:56,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:00:56,440 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 6 treesize of output 5 [2022-07-22 15:00:56,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 15:00:56,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-22 15:00:56,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 15:00:56,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:56,501 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 20 treesize of output 22 [2022-07-22 15:00:56,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:56,506 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 18 [2022-07-22 15:00:56,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:56,604 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 73 treesize of output 41 [2022-07-22 15:00:56,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:56,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:56,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:56,610 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 31 treesize of output 35 [2022-07-22 15:00:56,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:56,615 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 65 treesize of output 33 [2022-07-22 15:00:56,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:56,629 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-07-22 15:00:56,629 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 34 [2022-07-22 15:00:56,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:56,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:00:56,903 INFO L356 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2022-07-22 15:00:56,904 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 81 [2022-07-22 15:00:56,911 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 15:00:56,912 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 46 [2022-07-22 15:00:56,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:00:56,917 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-22 15:00:57,005 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 57 treesize of output 33 [2022-07-22 15:00:57,011 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:00:57,011 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-22 15:00:57,018 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 15:00:57,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:00:57,052 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_778 (Array Int Int))) (<= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_778) (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) (+ |c_ULTIMATE.start_main_~base~0#1| 99))) is different from false [2022-07-22 15:00:57,236 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:00:57,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 156 treesize of output 157 [2022-07-22 15:00:57,266 INFO L356 Elim1Store]: treesize reduction 69, result has 51.7 percent of original size [2022-07-22 15:00:57,267 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 14290 treesize of output 13020 [2022-07-22 15:00:57,416 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 2509 treesize of output 2493 [2022-07-22 15:00:57,432 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 2493 treesize of output 2429 [2022-07-22 15:00:57,448 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 2429 treesize of output 2397 [2022-07-22 15:01:02,184 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 29 not checked. [2022-07-22 15:01:02,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901039257] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:01:02,184 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 15:01:02,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 16 [2022-07-22 15:01:02,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674421205] [2022-07-22 15:01:02,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 15:01:02,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-22 15:01:02,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:01:02,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-22 15:01:02,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=171, Unknown=1, NotChecked=26, Total=240 [2022-07-22 15:01:02,186 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand has 16 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:03,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:01:03,716 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2022-07-22 15:01:03,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 15:01:03,723 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-22 15:01:03,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:01:03,725 INFO L225 Difference]: With dead ends: 92 [2022-07-22 15:01:03,725 INFO L226 Difference]: Without dead ends: 81 [2022-07-22 15:01:03,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=91, Invalid=331, Unknown=2, NotChecked=38, Total=462 [2022-07-22 15:01:03,727 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 17 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 15:01:03,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 98 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 49 Unchecked, 0.1s Time] [2022-07-22 15:01:03,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-22 15:01:03,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 41. [2022-07-22 15:01:03,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:03,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-07-22 15:01:03,741 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 36 [2022-07-22 15:01:03,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:01:03,741 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-07-22 15:01:03,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:03,741 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-07-22 15:01:03,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-22 15:01:03,746 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:01:03,746 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2022-07-22 15:01:03,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-22 15:01:03,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:01:03,968 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:01:03,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:01:03,968 INFO L85 PathProgramCache]: Analyzing trace with hash -212280090, now seen corresponding path program 4 times [2022-07-22 15:01:03,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:01:03,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490444384] [2022-07-22 15:01:03,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:03,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:01:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:04,325 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:01:04,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:01:04,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490444384] [2022-07-22 15:01:04,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490444384] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:01:04,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153783641] [2022-07-22 15:01:04,326 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 15:01:04,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:01:04,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:01:04,328 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 15:01:04,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-22 15:01:04,485 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 15:01:04,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 15:01:04,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 137 conjunts are in the unsatisfiable core [2022-07-22 15:01:04,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:01:04,508 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 6 treesize of output 5 [2022-07-22 15:01:04,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 15:01:04,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-22 15:01:04,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 15:01:04,573 INFO L356 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-07-22 15:01:04,573 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 25 treesize of output 29 [2022-07-22 15:01:04,577 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 20 treesize of output 22 [2022-07-22 15:01:04,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:04,693 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 72 treesize of output 40 [2022-07-22 15:01:04,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:04,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:04,701 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 31 treesize of output 35 [2022-07-22 15:01:04,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:04,706 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 65 treesize of output 33 [2022-07-22 15:01:04,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:04,724 INFO L356 Elim1Store]: treesize reduction 50, result has 37.5 percent of original size [2022-07-22 15:01:04,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 53 [2022-07-22 15:01:04,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:04,891 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-22 15:01:04,891 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 2 case distinctions, treesize of input 129 treesize of output 71 [2022-07-22 15:01:04,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:04,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:04,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2022-07-22 15:01:04,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:04,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:04,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:04,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 51 [2022-07-22 15:01:04,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:04,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:04,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:04,925 INFO L356 Elim1Store]: treesize reduction 4, result has 83.3 percent of original size [2022-07-22 15:01:04,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 33 [2022-07-22 15:01:05,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:05,105 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:05,108 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-22 15:01:05,108 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 180 treesize of output 107 [2022-07-22 15:01:05,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:05,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:05,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:05,130 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 15:01:05,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 60 [2022-07-22 15:01:05,137 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 24 treesize of output 26 [2022-07-22 15:01:05,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:05,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:05,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:05,341 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-22 15:01:05,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 139 treesize of output 98 [2022-07-22 15:01:05,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:05,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:05,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:05,357 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 15:01:05,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 68 [2022-07-22 15:01:05,367 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 24 treesize of output 26 [2022-07-22 15:01:05,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:05,520 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 15:01:05,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 66 [2022-07-22 15:01:05,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:05,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-22 15:01:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:01:05,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:01:05,557 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_970 (Array Int Int))) (<= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_970) (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) (+ |c_ULTIMATE.start_main_~base~0#1| 99))) is different from false [2022-07-22 15:01:05,572 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_970 (Array Int Int))) (<= (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse5 (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse6 (+ (select .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6)) (.cse2 (+ 4 .cse4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_970) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse1)) .cse1) .cse2)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse4)) .cse1) .cse2)))))) (+ |c_ULTIMATE.start_main_~base~0#1| 99))) is different from false [2022-07-22 15:01:20,614 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 Int) (v_ArrVal_945 (Array Int Int)) (v_ArrVal_937 Int) (v_ArrVal_939 (Array Int Int)) (v_ArrVal_955 Int) (v_ArrVal_943 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_942 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_952 Int)) (or (not (< v_ArrVal_943 |c_#StackHeapBarrier|)) (not (< v_ArrVal_951 |c_#StackHeapBarrier|)) (<= (let ((.cse4 (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.offset| v_ArrVal_943 (store (store (select |c_#memory_$Pointer$.offset| v_ArrVal_943) 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_937)))) (store .cse10 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0))))) (store .cse9 v_ArrVal_951 (store (store (select .cse9 v_ArrVal_951) 4 0) 0 v_ArrVal_955))))) (let ((.cse0 (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.base| v_ArrVal_943 (store (store (select |c_#memory_$Pointer$.base| v_ArrVal_943) 4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_942)))) (store .cse8 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_943))))) (store .cse7 v_ArrVal_951 (store (store (select .cse7 v_ArrVal_951) 4 v_ArrVal_943) 0 v_ArrVal_952)))) (.cse5 (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) v_ArrVal_951) 4)) (.cse1 (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_951)) v_ArrVal_951) 4)) (.cse3 (+ .cse6 4))) (select (select (store (store (store (store |c_#memory_int| v_ArrVal_943 v_ArrVal_939) |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_945) v_ArrVal_951 v_ArrVal_962) |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_970) (select (select (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse2)) .cse2) .cse3)) (select (select (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse6)) .cse2) .cse3)))))) (+ |c_ULTIMATE.start_main_~base~0#1| 99)) (not (= (select |c_#valid| v_ArrVal_943) 0)) (not (= (select (store |c_#valid| v_ArrVal_943 1) v_ArrVal_951) 0)))) is different from false [2022-07-22 15:01:20,877 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:01:20,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2290 treesize of output 2291 [2022-07-22 15:01:20,882 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:20,891 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:20,892 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 561598 treesize of output 558142 [2022-07-22 15:01:20,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:20,942 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:20,943 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:21,548 INFO L356 Elim1Store]: treesize reduction 20468, result has 0.4 percent of original size [2022-07-22 15:01:21,550 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 119138094 treesize of output 114915750 [2022-07-22 15:01:28,589 WARN L233 SmtUtils]: Spent 7.04s on a formula simplification that was a NOOP. DAG size: 1220 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-22 15:02:12,889 WARN L233 SmtUtils]: Spent 44.29s on a formula simplification. DAG size of input: 1210 DAG size of output: 1116 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-22 15:02:12,942 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:02:12,984 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 5934 treesize of output 5774 [2022-07-22 15:02:13,027 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 5774 treesize of output 5614 [2022-07-22 15:02:13,055 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 5614 treesize of output 5246 [2022-07-22 15:02:13,086 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 2357 treesize of output 2325 [2022-07-22 15:02:18,620 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 32 not checked. [2022-07-22 15:02:18,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153783641] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:02:18,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 15:02:18,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2022-07-22 15:02:18,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895517007] [2022-07-22 15:02:18,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 15:02:18,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-22 15:02:18,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:02:18,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-22 15:02:18,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=285, Unknown=3, NotChecked=108, Total=462 [2022-07-22 15:02:18,623 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 22 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 22 states have internal predecessors, (104), 0 states have call successors, (0), 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-22 15:02:33,407 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (and (= (select |c_#valid| .cse0) 1) (< (select (select |c_#memory_int| .cse0) 0) (+ |c_ULTIMATE.start_main_~base~0#1| 100)) (= (select |c_#valid| |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (forall ((v_ArrVal_951 Int) (v_ArrVal_945 (Array Int Int)) (v_ArrVal_937 Int) (v_ArrVal_939 (Array Int Int)) (v_ArrVal_955 Int) (v_ArrVal_943 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_942 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_952 Int)) (or (not (< v_ArrVal_943 |c_#StackHeapBarrier|)) (not (< v_ArrVal_951 |c_#StackHeapBarrier|)) (<= (let ((.cse5 (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.offset| v_ArrVal_943 (store (store (select |c_#memory_$Pointer$.offset| v_ArrVal_943) 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_937)))) (store .cse11 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0))))) (store .cse10 v_ArrVal_951 (store (store (select .cse10 v_ArrVal_951) 4 0) 0 v_ArrVal_955))))) (let ((.cse1 (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$.base| v_ArrVal_943 (store (store (select |c_#memory_$Pointer$.base| v_ArrVal_943) 4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_942)))) (store .cse9 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_943))))) (store .cse8 v_ArrVal_951 (store (store (select .cse8 v_ArrVal_951) 4 v_ArrVal_943) 0 v_ArrVal_952)))) (.cse6 (select .cse5 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse7 (select (select (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) v_ArrVal_951) 4)) (.cse2 (select .cse1 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_951)) v_ArrVal_951) 4)) (.cse4 (+ .cse7 4))) (select (select (store (store (store (store |c_#memory_int| v_ArrVal_943 v_ArrVal_939) |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_945) v_ArrVal_951 v_ArrVal_962) |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_970) (select (select (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse3)) .cse3) .cse4)) (select (select (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse7)) .cse3) .cse4)))))) (+ |c_ULTIMATE.start_main_~base~0#1| 99)) (not (= (select |c_#valid| v_ArrVal_943) 0)) (not (= (select (store |c_#valid| v_ArrVal_943 1) v_ArrVal_951) 0)))) (not (= .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|)))) is different from false [2022-07-22 15:02:48,372 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~base~0#1| 100)) (.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 4))) (and (not (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse0)) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| .cse1) 1) (< (select (select |c_#memory_int| .cse1) 0) .cse2) (= (select |c_#valid| |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 4) 0) (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (< (select (select |c_#memory_int| .cse0) 0) .cse2) (forall ((v_ArrVal_951 Int) (v_ArrVal_945 (Array Int Int)) (v_ArrVal_937 Int) (v_ArrVal_939 (Array Int Int)) (v_ArrVal_955 Int) (v_ArrVal_943 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_942 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_952 Int)) (or (not (< v_ArrVal_943 |c_#StackHeapBarrier|)) (not (< v_ArrVal_951 |c_#StackHeapBarrier|)) (<= (let ((.cse7 (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$.offset| v_ArrVal_943 (store (store (select |c_#memory_$Pointer$.offset| v_ArrVal_943) 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_937)))) (store .cse13 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0))))) (store .cse12 v_ArrVal_951 (store (store (select .cse12 v_ArrVal_951) 4 0) 0 v_ArrVal_955))))) (let ((.cse3 (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.base| v_ArrVal_943 (store (store (select |c_#memory_$Pointer$.base| v_ArrVal_943) 4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_942)))) (store .cse11 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_943))))) (store .cse10 v_ArrVal_951 (store (store (select .cse10 v_ArrVal_951) 4 v_ArrVal_943) 0 v_ArrVal_952)))) (.cse8 (select .cse7 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse9 (select (select (store .cse7 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) v_ArrVal_951) 4)) (.cse4 (select .cse3 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse5 (select (select (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_951)) v_ArrVal_951) 4)) (.cse6 (+ .cse9 4))) (select (select (store (store (store (store |c_#memory_int| v_ArrVal_943 v_ArrVal_939) |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_945) v_ArrVal_951 v_ArrVal_962) |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_970) (select (select (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse5)) .cse5) .cse6)) (select (select (store .cse7 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse9)) .cse5) .cse6)))))) (+ |c_ULTIMATE.start_main_~base~0#1| 99)) (not (= (select |c_#valid| v_ArrVal_943) 0)) (not (= (select (store |c_#valid| v_ArrVal_943 1) v_ArrVal_951) 0)))) (not (= .cse1 .cse0)) (< .cse1 |c_#StackHeapBarrier|) (not (= .cse1 |c_ULTIMATE.start_main_~#list~0#1.base|))))) is different from false [2022-07-22 15:03:03,590 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse1 (+ |c_ULTIMATE.start_main_~base~0#1| 100))) (and (< (+ .cse0 1) |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select |c_#valid| .cse0) 1) (< (select (select |c_#memory_int| .cse0) 0) .cse1) (= (select |c_#valid| |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse3) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (< (+ .cse3 1) |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (not (= .cse2 .cse3)) (forall ((v_ArrVal_951 Int) (v_ArrVal_945 (Array Int Int)) (v_ArrVal_937 Int) (v_ArrVal_939 (Array Int Int)) (v_ArrVal_955 Int) (v_ArrVal_943 Int) (v_ArrVal_970 (Array Int Int)) (v_ArrVal_942 Int) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_952 Int)) (or (not (< v_ArrVal_943 |c_#StackHeapBarrier|)) (not (< v_ArrVal_951 |c_#StackHeapBarrier|)) (<= (let ((.cse8 (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$.offset| v_ArrVal_943 (store (store (select |c_#memory_$Pointer$.offset| v_ArrVal_943) 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_937)))) (store .cse14 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0))))) (store .cse13 v_ArrVal_951 (store (store (select .cse13 v_ArrVal_951) 4 0) 0 v_ArrVal_955))))) (let ((.cse4 (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$.base| v_ArrVal_943 (store (store (select |c_#memory_$Pointer$.base| v_ArrVal_943) 4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_942)))) (store .cse12 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_943))))) (store .cse11 v_ArrVal_951 (store (store (select .cse11 v_ArrVal_951) 4 v_ArrVal_943) 0 v_ArrVal_952)))) (.cse9 (select .cse8 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse10 (select (select (store .cse8 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) v_ArrVal_951) 4)) (.cse5 (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_951)) v_ArrVal_951) 4)) (.cse7 (+ .cse10 4))) (select (select (store (store (store (store |c_#memory_int| v_ArrVal_943 v_ArrVal_939) |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_945) v_ArrVal_951 v_ArrVal_962) |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_970) (select (select (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse6)) .cse6) .cse7)) (select (select (store .cse8 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse10)) .cse6) .cse7)))))) (+ |c_ULTIMATE.start_main_~base~0#1| 99)) (not (= (select |c_#valid| v_ArrVal_943) 0)) (not (= (select (store |c_#valid| v_ArrVal_943 1) v_ArrVal_951) 0)))) (not (= .cse2 .cse0)) (forall ((v_ArrVal_970 (Array Int Int))) (<= (let ((.cse18 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse15 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse20 (select .cse15 |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse21 (+ (select .cse18 |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (let ((.cse19 (select (select |c_#memory_$Pointer$.offset| .cse20) .cse21))) (let ((.cse16 (select (select |c_#memory_$Pointer$.base| .cse20) .cse21)) (.cse17 (+ 4 .cse19))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_970) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse16)) .cse16) .cse17)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse19)) .cse16) .cse17)))))) (+ |c_ULTIMATE.start_main_~base~0#1| 99))) (< (select (select |c_#memory_int| .cse2) 0) .cse1) (not (= .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) is different from false [2022-07-22 15:03:09,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:03:09,164 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2022-07-22 15:03:09,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-22 15:03:09,165 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 22 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-22 15:03:09,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:03:09,166 INFO L225 Difference]: With dead ends: 107 [2022-07-22 15:03:09,166 INFO L226 Difference]: Without dead ends: 105 [2022-07-22 15:03:09,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 6 IntricatePredicates, 4 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 65.6s TimeCoverageRelationStatistics Valid=155, Invalid=668, Unknown=13, NotChecked=354, Total=1190 [2022-07-22 15:03:09,167 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 15:03:09,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 168 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 165 Unchecked, 0.1s Time] [2022-07-22 15:03:09,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-22 15:03:09,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 83. [2022-07-22 15:03:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 82 states have internal predecessors, (98), 0 states have call successors, (0), 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-22 15:03:09,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2022-07-22 15:03:09,179 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 98 transitions. Word has length 37 [2022-07-22 15:03:09,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:03:09,180 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 98 transitions. [2022-07-22 15:03:09,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 22 states have internal predecessors, (104), 0 states have call successors, (0), 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-22 15:03:09,180 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2022-07-22 15:03:09,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-22 15:03:09,181 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:03:09,181 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-22 15:03:09,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-22 15:03:09,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-22 15:03:09,396 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:03:09,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:03:09,396 INFO L85 PathProgramCache]: Analyzing trace with hash -212278168, now seen corresponding path program 2 times [2022-07-22 15:03:09,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:03:09,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167327573] [2022-07-22 15:03:09,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:03:09,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:03:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:03:09,650 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:03:09,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:03:09,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167327573] [2022-07-22 15:03:09,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167327573] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:03:09,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691150645] [2022-07-22 15:03:09,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 15:03:09,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:03:09,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:03:09,656 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 15:03:09,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-22 15:03:09,819 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 15:03:09,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 15:03:09,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 136 conjunts are in the unsatisfiable core [2022-07-22 15:03:09,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:03:09,836 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 6 treesize of output 5 [2022-07-22 15:03:09,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 15:03:09,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-22 15:03:09,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 15:03:09,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:09,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-22 15:03:09,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:09,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 25 treesize of output 21 [2022-07-22 15:03:09,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:09,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:09,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:09,981 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 21 treesize of output 25 [2022-07-22 15:03:09,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:09,990 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 69 treesize of output 37 [2022-07-22 15:03:09,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:09,995 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 65 treesize of output 33 [2022-07-22 15:03:10,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:10,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:10,025 INFO L356 Elim1Store]: treesize reduction 50, result has 37.5 percent of original size [2022-07-22 15:03:10,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 53 [2022-07-22 15:03:10,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:10,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:10,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:10,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2022-07-22 15:03:10,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:10,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:10,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:10,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 39 [2022-07-22 15:03:10,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:10,271 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-22 15:03:10,272 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 2 case distinctions, treesize of input 128 treesize of output 70 [2022-07-22 15:03:10,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:10,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:10,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:10,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:10,289 INFO L356 Elim1Store]: treesize reduction 4, result has 83.3 percent of original size [2022-07-22 15:03:10,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 33 [2022-07-22 15:03:10,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:10,497 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:03:10,500 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-22 15:03:10,501 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 179 treesize of output 106 [2022-07-22 15:03:10,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:10,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:10,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:10,510 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 15:03:10,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 64 treesize of output 60 [2022-07-22 15:03:10,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:10,515 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 22 treesize of output 24 [2022-07-22 15:03:10,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:10,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:10,669 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:03:10,672 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-22 15:03:10,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 138 treesize of output 97 [2022-07-22 15:03:10,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:10,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:10,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:10,682 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 15:03:10,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 76 treesize of output 68 [2022-07-22 15:03:10,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:10,688 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 22 treesize of output 24 [2022-07-22 15:03:10,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:10,775 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:03:10,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:03:10,785 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-22 15:03:10,786 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 134 treesize of output 74 [2022-07-22 15:03:10,792 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:03:10,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-22 15:03:10,797 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:03:10,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:03:10,815 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1163 (Array Int Int))) (<= |c_ULTIMATE.start_main_~base~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_1163) (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))))) is different from false [2022-07-22 15:03:10,827 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1163 (Array Int Int))) (<= |c_ULTIMATE.start_main_~base~0#1| (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse5 (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse6 (+ (select .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset|) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6)) (.cse2 (+ 4 .cse4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_1163) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse1)) .cse1) .cse2)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse4)) .cse1) .cse2)))))))) is different from false [2022-07-22 15:03:25,970 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1151 Int) (v_ArrVal_1143 Int) (v_ArrVal_1154 Int) (v_ArrVal_1134 (Array Int Int)) (v_ArrVal_1157 Int) (v_ArrVal_1138 Int) (v_ArrVal_1137 Int) (v_ArrVal_1131 (Array Int Int)) (v_ArrVal_1163 (Array Int Int)) (v_ArrVal_1150 (Array Int Int))) (or (not (< v_ArrVal_1137 |c_#StackHeapBarrier|)) (<= |c_ULTIMATE.start_main_~base~0#1| (let ((.cse4 (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.offset| v_ArrVal_1137 (store (store (select |c_#memory_$Pointer$.offset| v_ArrVal_1137) 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_1143)))) (store .cse10 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0))))) (store .cse9 v_ArrVal_1151 (store (store (select .cse9 v_ArrVal_1151) 4 0) 0 v_ArrVal_1154))))) (let ((.cse0 (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.base| v_ArrVal_1137 (store (store (select |c_#memory_$Pointer$.base| v_ArrVal_1137) 4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 0 v_ArrVal_1138)))) (store .cse8 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_1137))))) (store .cse7 v_ArrVal_1151 (store (store (select .cse7 v_ArrVal_1151) 4 v_ArrVal_1137) 0 v_ArrVal_1157)))) (.cse5 (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) v_ArrVal_1151) 4)) (.cse1 (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_1151)) v_ArrVal_1151) 4)) (.cse3 (+ .cse6 4))) (select (select (store (store (store (store |c_#memory_int| v_ArrVal_1137 v_ArrVal_1134) |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_1131) v_ArrVal_1151 v_ArrVal_1150) |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_1163) (select (select (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse2)) .cse2) .cse3)) (select (select (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse6)) .cse2) .cse3))))))) (not (= (select (store |c_#valid| v_ArrVal_1137 1) v_ArrVal_1151) 0)) (not (< v_ArrVal_1151 |c_#StackHeapBarrier|)) (not (= (select |c_#valid| v_ArrVal_1137) 0)))) is different from false [2022-07-22 15:03:26,230 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:03:26,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2292 treesize of output 2293 [2022-07-22 15:03:26,236 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:03:26,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:03:26,245 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 468390 treesize of output 465510 [2022-07-22 15:03:26,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:03:26,323 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:03:26,323 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:03:27,061 INFO L356 Elim1Store]: treesize reduction 20468, result has 0.4 percent of original size [2022-07-22 15:03:27,064 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 140288790 treesize of output 135343118 [2022-07-22 15:03:34,810 WARN L233 SmtUtils]: Spent 7.74s on a formula simplification that was a NOOP. DAG size: 2028 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)