./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 f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-data/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-?-f4b24e3 [2022-07-13 15:18:36,665 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:18:36,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:18:36,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:18:36,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:18:36,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:18:36,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:18:36,716 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:18:36,718 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:18:36,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:18:36,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:18:36,723 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:18:36,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:18:36,725 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:18:36,726 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:18:36,727 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:18:36,728 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:18:36,729 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:18:36,730 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:18:36,733 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:18:36,735 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:18:36,736 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:18:36,737 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:18:36,737 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:18:36,738 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:18:36,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:18:36,742 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:18:36,743 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:18:36,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:18:36,744 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:18:36,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:18:36,745 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:18:36,746 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:18:36,746 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:18:36,747 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:18:36,747 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:18:36,747 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:18:36,748 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:18:36,748 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:18:36,748 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:18:36,749 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:18:36,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:18:36,751 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 15:18:36,770 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:18:36,771 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:18:36,771 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:18:36,771 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:18:36,772 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:18:36,772 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:18:36,773 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:18:36,773 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:18:36,773 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:18:36,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:18:36,774 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:18:36,774 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 15:18:36,774 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:18:36,774 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:18:36,774 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:18:36,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:18:36,775 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:18:36,775 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:18:36,775 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:18:36,775 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:18:36,775 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:18:36,775 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:18:36,776 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:18:36,776 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:18:36,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:18:36,776 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:18:36,776 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:18:36,776 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:18:36,777 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 15:18:36,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 15:18:36,777 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:18:36,777 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:18:36,777 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:18:36,777 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-13 15:18:36,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:18:36,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:18:36,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:18:36,983 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:18:36,984 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:18:36,985 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-13 15:18:37,027 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16ac0c34d/d3a6b0f567dd4787abc46caece2918ff/FLAG69eb7771e [2022-07-13 15:18:37,414 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:18:37,415 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/hash_fun.i [2022-07-13 15:18:37,423 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16ac0c34d/d3a6b0f567dd4787abc46caece2918ff/FLAG69eb7771e [2022-07-13 15:18:37,432 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16ac0c34d/d3a6b0f567dd4787abc46caece2918ff [2022-07-13 15:18:37,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:18:37,434 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:18:37,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:18:37,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:18:37,441 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:18:37,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:18:37" (1/1) ... [2022-07-13 15:18:37,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c99f2dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:37, skipping insertion in model container [2022-07-13 15:18:37,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:18:37" (1/1) ... [2022-07-13 15:18:37,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:18:37,473 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:18:37,721 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-13 15:18:37,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:18:37,730 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:18:37,764 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-13 15:18:37,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:18:37,796 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:18:37,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:37 WrapperNode [2022-07-13 15:18:37,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:18:37,797 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:18:37,798 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:18:37,798 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:18:37,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:37" (1/1) ... [2022-07-13 15:18:37,823 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:37" (1/1) ... [2022-07-13 15:18:37,842 INFO L137 Inliner]: procedures = 125, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2022-07-13 15:18:37,843 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:18:37,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:18:37,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:18:37,844 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:18:37,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:37" (1/1) ... [2022-07-13 15:18:37,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:37" (1/1) ... [2022-07-13 15:18:37,852 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:37" (1/1) ... [2022-07-13 15:18:37,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:37" (1/1) ... [2022-07-13 15:18:37,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:37" (1/1) ... [2022-07-13 15:18:37,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:37" (1/1) ... [2022-07-13 15:18:37,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:37" (1/1) ... [2022-07-13 15:18:37,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:18:37,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:18:37,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:18:37,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:18:37,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:37" (1/1) ... [2022-07-13 15:18:37,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:18:37,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:18:37,883 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 15:18:37,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 15:18:37,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 15:18:37,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 15:18:37,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 15:18:37,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:18:37,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 15:18:37,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 15:18:37,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 15:18:37,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 15:18:37,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 15:18:37,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 15:18:37,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:18:37,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:18:37,985 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:18:37,987 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:18:38,154 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:18:38,158 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:18:38,159 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 15:18:38,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:18:38 BoogieIcfgContainer [2022-07-13 15:18:38,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:18:38,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:18:38,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:18:38,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:18:38,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:18:37" (1/3) ... [2022-07-13 15:18:38,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e737820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:18:38, skipping insertion in model container [2022-07-13 15:18:38,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:18:37" (2/3) ... [2022-07-13 15:18:38,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e737820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:18:38, skipping insertion in model container [2022-07-13 15:18:38,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:18:38" (3/3) ... [2022-07-13 15:18:38,168 INFO L111 eAbstractionObserver]: Analyzing ICFG hash_fun.i [2022-07-13 15:18:38,177 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:18:38,178 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 15:18:38,223 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:18:38,230 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@6ea3934c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@337be8b7 [2022-07-13 15:18:38,230 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 15:18:38,238 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-13 15:18:38,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-13 15:18:38,247 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:38,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:38,249 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:38,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:38,253 INFO L85 PathProgramCache]: Analyzing trace with hash 859985196, now seen corresponding path program 1 times [2022-07-13 15:18:38,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:38,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372713923] [2022-07-13 15:18:38,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:38,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:38,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:18:38,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:38,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372713923] [2022-07-13 15:18:38,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372713923] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:18:38,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:18:38,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 15:18:38,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915757086] [2022-07-13 15:18:38,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:18:38,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 15:18:38,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:38,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 15:18:38,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 15:18:38,407 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-13 15:18:38,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:38,416 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-07-13 15:18:38,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 15:18:38,418 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-13 15:18:38,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:38,423 INFO L225 Difference]: With dead ends: 30 [2022-07-13 15:18:38,423 INFO L226 Difference]: Without dead ends: 15 [2022-07-13 15:18:38,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 15:18:38,428 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-13 15:18:38,428 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-13 15:18:38,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-13 15:18:38,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-13 15:18:38,444 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-13 15:18:38,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2022-07-13 15:18:38,446 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 8 [2022-07-13 15:18:38,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:38,446 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-07-13 15:18:38,447 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-13 15:18:38,447 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2022-07-13 15:18:38,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 15:18:38,448 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:38,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:38,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 15:18:38,449 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:38,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:38,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1231547617, now seen corresponding path program 1 times [2022-07-13 15:18:38,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:38,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701188475] [2022-07-13 15:18:38,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:38,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:38,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:18:38,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:38,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701188475] [2022-07-13 15:18:38,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701188475] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:18:38,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:18:38,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:18:38,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461504739] [2022-07-13 15:18:38,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:18:38,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:18:38,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:38,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:18:38,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:18:38,532 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-13 15:18:38,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:38,561 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-07-13 15:18:38,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:18:38,562 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-13 15:18:38,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:38,562 INFO L225 Difference]: With dead ends: 29 [2022-07-13 15:18:38,563 INFO L226 Difference]: Without dead ends: 20 [2022-07-13 15:18:38,566 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-13 15:18:38,567 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-13 15:18:38,567 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-13 15:18:38,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-13 15:18:38,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-13 15:18:38,573 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-13 15:18:38,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-07-13 15:18:38,575 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 9 [2022-07-13 15:18:38,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:38,575 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-13 15:18:38,576 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-13 15:18:38,576 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-07-13 15:18:38,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 15:18:38,577 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:38,577 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:38,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 15:18:38,578 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:38,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:38,581 INFO L85 PathProgramCache]: Analyzing trace with hash -2121530184, now seen corresponding path program 1 times [2022-07-13 15:18:38,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:38,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246846909] [2022-07-13 15:18:38,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:38,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:38,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:18:38,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:38,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246846909] [2022-07-13 15:18:38,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246846909] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:18:38,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640831850] [2022-07-13 15:18:38,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:38,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:18:38,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:18:38,695 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:18:38,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 15:18:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:38,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-13 15:18:38,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:18:38,819 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-13 15:18:38,934 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-13 15:18:38,941 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-13 15:18:38,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:38,954 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-13 15:18:38,964 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-13 15:18:38,965 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-13 15:18:38,971 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-13 15:18:39,058 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-13 15:18:39,063 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-13 15:18:39,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:18:39,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:18:39,159 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:18:39,160 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-13 15:18:39,164 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-13 15:18:39,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:18:39,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640831850] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:18:39,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:18:39,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-07-13 15:18:39,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377260334] [2022-07-13 15:18:39,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:18:39,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 15:18:39,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:39,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 15:18:39,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-13 15:18:39,186 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-13 15:18:39,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:39,249 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-07-13 15:18:39,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:18:39,250 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-13 15:18:39,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:39,251 INFO L225 Difference]: With dead ends: 30 [2022-07-13 15:18:39,251 INFO L226 Difference]: Without dead ends: 28 [2022-07-13 15:18:39,252 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-13 15:18:39,253 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-13 15:18:39,255 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-13 15:18:39,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-13 15:18:39,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-07-13 15:18:39,259 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-13 15:18:39,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2022-07-13 15:18:39,260 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 15 [2022-07-13 15:18:39,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:39,260 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-07-13 15:18:39,260 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-13 15:18:39,260 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2022-07-13 15:18:39,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 15:18:39,261 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:39,261 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:39,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 15:18:39,478 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-13 15:18:39,478 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:39,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:39,479 INFO L85 PathProgramCache]: Analyzing trace with hash -2121528262, now seen corresponding path program 1 times [2022-07-13 15:18:39,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:39,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007375733] [2022-07-13 15:18:39,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:39,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:39,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:18:39,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:39,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007375733] [2022-07-13 15:18:39,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007375733] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:18:39,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594876798] [2022-07-13 15:18:39,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:39,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:18:39,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:18:39,547 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:18:39,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 15:18:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:39,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-13 15:18:39,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:18:39,615 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-13 15:18:39,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 15:18:39,681 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-13 15:18:39,688 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-13 15:18:39,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:39,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, 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-13 15:18:39,702 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-13 15:18:39,702 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-13 15:18:39,746 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-13 15:18:39,750 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-13 15:18:39,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:18:39,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:18:39,782 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:18:39,782 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-13 15:18:39,784 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-13 15:18:39,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:18:39,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594876798] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:18:39,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:18:39,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-07-13 15:18:39,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028465930] [2022-07-13 15:18:39,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:18:39,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 15:18:39,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:39,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 15:18:39,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-13 15:18:39,797 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-13 15:18:39,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:39,853 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-07-13 15:18:39,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:18:39,854 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-13 15:18:39,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:39,854 INFO L225 Difference]: With dead ends: 32 [2022-07-13 15:18:39,854 INFO L226 Difference]: Without dead ends: 25 [2022-07-13 15:18:39,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-13 15:18:39,855 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-13 15:18:39,856 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-13 15:18:39,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-13 15:18:39,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-07-13 15:18:39,858 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-13 15:18:39,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-07-13 15:18:39,858 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 15 [2022-07-13 15:18:39,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:39,859 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-07-13 15:18:39,859 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-13 15:18:39,859 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-07-13 15:18:39,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 15:18:39,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:39,859 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:39,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 15:18:40,075 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-13 15:18:40,076 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:40,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:40,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2123144338, now seen corresponding path program 1 times [2022-07-13 15:18:40,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:40,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585934860] [2022-07-13 15:18:40,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:40,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:40,229 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-13 15:18:40,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:40,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585934860] [2022-07-13 15:18:40,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585934860] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:18:40,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255520217] [2022-07-13 15:18:40,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:40,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:18:40,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:18:40,231 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:18:40,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 15:18:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:40,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-13 15:18:40,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:18:40,317 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-13 15:18:40,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:40,363 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-13 15:18:40,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:40,368 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-13 15:18:40,382 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-13 15:18:40,382 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-13 15:18:40,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:40,452 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:40,454 INFO L356 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2022-07-13 15:18:40,454 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-13 15:18:40,458 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:18:40,459 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-13 15:18:40,484 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-13 15:18:40,486 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-13 15:18:40,490 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-13 15:18:40,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:18:40,665 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-13 15:18:40,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255520217] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:18:40,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:18:40,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-07-13 15:18:40,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574415263] [2022-07-13 15:18:40,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:18:40,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 15:18:40,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:40,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 15:18:40,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-13 15:18:40,672 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-13 15:18:40,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:40,708 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-07-13 15:18:40,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:18:40,709 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-13 15:18:40,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:40,711 INFO L225 Difference]: With dead ends: 44 [2022-07-13 15:18:40,711 INFO L226 Difference]: Without dead ends: 30 [2022-07-13 15:18:40,711 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-13 15:18:40,712 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-13 15:18:40,713 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-13 15:18:40,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-13 15:18:40,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-13 15:18:40,719 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-13 15:18:40,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-07-13 15:18:40,722 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 20 [2022-07-13 15:18:40,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:40,722 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-07-13 15:18:40,722 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-13 15:18:40,722 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-07-13 15:18:40,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 15:18:40,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:40,723 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:40,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 15:18:40,939 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-13 15:18:40,939 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:40,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:40,940 INFO L85 PathProgramCache]: Analyzing trace with hash -153301193, now seen corresponding path program 2 times [2022-07-13 15:18:40,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:40,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478286806] [2022-07-13 15:18:40,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:40,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:41,093 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-13 15:18:41,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:41,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478286806] [2022-07-13 15:18:41,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478286806] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:18:41,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739714839] [2022-07-13 15:18:41,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:18:41,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:18:41,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:18:41,095 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:18:41,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 15:18:41,175 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:18:41,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:18:41,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-13 15:18:41,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:18:41,215 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-13 15:18:41,218 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-13 15:18:41,221 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-13 15:18:41,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:41,224 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-13 15:18:41,232 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-13 15:18:41,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:41,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:41,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:41,311 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-13 15:18:41,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:41,320 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-13 15:18:41,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:41,327 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-13 15:18:41,335 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-07-13 15:18:41,336 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-13 15:18:41,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:41,447 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:41,449 INFO L356 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2022-07-13 15:18:41,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-13 15:18:41,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:41,457 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:18:41,458 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-13 15:18:41,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:41,462 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-13 15:18:41,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:41,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, 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-13 15:18:41,533 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:41,534 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-13 15:18:41,540 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-13 15:18:41,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:18:41,554 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-13 15:18:41,760 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:18:41,761 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-13 15:18:41,783 INFO L356 Elim1Store]: treesize reduction 69, result has 51.7 percent of original size [2022-07-13 15:18:41,784 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-13 15:18:41,943 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-13 15:18:41,961 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-13 15:18:41,982 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-13 15:18:41,997 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-13 15:18:49,095 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-13 15:18:49,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739714839] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:18:49,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:18:49,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-07-13 15:18:49,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767694241] [2022-07-13 15:18:49,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:18:49,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 15:18:49,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:49,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 15:18:49,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2022-07-13 15:18:49,097 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-13 15:18:51,307 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))) (and (< (+ .cse0 1) |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (forall ((v_ArrVal_299 (Array Int Int))) (<= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse2 (+ (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| .cse1) .cse2)) (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2))) (+ |c_ULTIMATE.start_main_~base~0#1| 99))) (< |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) (< (+ .cse3 1) |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (< (select (select |c_#memory_int| .cse3) 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 ((.cse4 (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 .cse4 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse4 |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 ((.cse5 (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 .cse5 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse5 |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 .cse3))))) is different from false [2022-07-13 15:18:53,328 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-13 15:18:53,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:53,512 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2022-07-13 15:18:53,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 15:18:53,512 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-13 15:18:53,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:53,513 INFO L225 Difference]: With dead ends: 77 [2022-07-13 15:18:53,513 INFO L226 Difference]: Without dead ends: 75 [2022-07-13 15:18:53,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=105, Invalid=279, Unknown=8, NotChecked=114, Total=506 [2022-07-13 15:18:53,514 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 40 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:18:53,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 104 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 115 Unchecked, 0.1s Time] [2022-07-13 15:18:53,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-13 15:18:53,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 56. [2022-07-13 15:18:53,518 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-13 15:18:53,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 74 transitions. [2022-07-13 15:18:53,519 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 74 transitions. Word has length 26 [2022-07-13 15:18:53,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:53,519 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 74 transitions. [2022-07-13 15:18:53,519 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-13 15:18:53,519 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-07-13 15:18:53,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 15:18:53,519 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:53,520 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:53,554 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-13 15:18:53,720 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-13 15:18:53,720 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:53,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:53,721 INFO L85 PathProgramCache]: Analyzing trace with hash -153299271, now seen corresponding path program 1 times [2022-07-13 15:18:53,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:53,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047210445] [2022-07-13 15:18:53,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:53,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:53,836 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-13 15:18:53,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:53,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047210445] [2022-07-13 15:18:53,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047210445] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:18:53,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242851675] [2022-07-13 15:18:53,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:53,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:18:53,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:18:53,838 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:18:53,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 15:18:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:53,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-13 15:18:53,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:18:53,951 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-13 15:18:53,953 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-13 15:18:53,956 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-13 15:18:53,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:53,960 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-13 15:18:53,966 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-13 15:18:54,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:54,042 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-13 15:18:54,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:54,048 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-13 15:18:54,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:54,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:54,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:54,054 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-13 15:18:54,060 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-07-13 15:18:54,060 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-13 15:18:54,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:54,161 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:54,163 INFO L356 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2022-07-13 15:18:54,163 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-13 15:18:54,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:54,169 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:18:54,169 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-13 15:18:54,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:54,173 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-13 15:18:54,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:54,228 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-13 15:18:54,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:54,233 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-13 15:18:54,243 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-13 15:18:54,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:18:54,260 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-13 15:18:54,411 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:18:54,412 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-13 15:18:54,432 INFO L356 Elim1Store]: treesize reduction 69, result has 51.7 percent of original size [2022-07-13 15:18:54,433 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-13 15:18:54,459 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-13 15:18:54,464 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-13 15:18:54,470 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-13 15:18:54,476 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-13 15:18:54,645 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-13 15:18:54,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242851675] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:18:54,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:18:54,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-07-13 15:18:54,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654829055] [2022-07-13 15:18:54,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:18:54,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 15:18:54,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:54,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 15:18:54,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=142, Unknown=1, NotChecked=24, Total=210 [2022-07-13 15:18:54,647 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-13 15:18:54,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:54,871 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2022-07-13 15:18:54,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 15:18:54,871 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-13 15:18:54,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:54,872 INFO L225 Difference]: With dead ends: 68 [2022-07-13 15:18:54,872 INFO L226 Difference]: Without dead ends: 61 [2022-07-13 15:18:54,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=246, Unknown=2, NotChecked=34, Total=380 [2022-07-13 15:18:54,873 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 32 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:18:54,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 99 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 76 Invalid, 0 Unknown, 39 Unchecked, 0.1s Time] [2022-07-13 15:18:54,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-13 15:18:54,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-07-13 15:18:54,877 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-13 15:18:54,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2022-07-13 15:18:54,877 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 26 [2022-07-13 15:18:54,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:54,878 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2022-07-13 15:18:54,878 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-13 15:18:54,878 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2022-07-13 15:18:54,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-13 15:18:54,879 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:54,879 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-07-13 15:18:54,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 15:18:55,091 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-13 15:18:55,092 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:55,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:55,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1774735439, now seen corresponding path program 3 times [2022-07-13 15:18:55,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:55,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226628071] [2022-07-13 15:18:55,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:55,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:55,236 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-13 15:18:55,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:55,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226628071] [2022-07-13 15:18:55,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226628071] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:18:55,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970811968] [2022-07-13 15:18:55,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 15:18:55,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:18:55,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:18:55,237 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:18:55,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 15:18:55,347 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 15:18:55,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:18:55,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 87 conjunts are in the unsatisfiable core [2022-07-13 15:18:55,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:18:55,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:55,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:55,400 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-13 15:18:55,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:55,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:55,405 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-13 15:18:55,408 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-13 15:18:55,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:55,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:55,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:55,491 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-13 15:18:55,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:55,513 INFO L356 Elim1Store]: treesize reduction 182, result has 6.7 percent of original size [2022-07-13 15:18:55,514 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-13 15:18:55,522 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-07-13 15:18:55,522 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-13 15:18:55,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:55,630 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:55,641 INFO L356 Elim1Store]: treesize reduction 70, result has 9.1 percent of original size [2022-07-13 15:18:55,641 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-13 15:18:55,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:55,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:55,649 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:18:55,649 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-13 15:18:55,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:55,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:18:55,761 INFO L356 Elim1Store]: treesize reduction 164, result has 14.1 percent of original size [2022-07-13 15:18:55,761 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-13 15:18:55,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:55,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:55,767 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:18:55,767 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-13 15:18:55,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:55,805 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-07-13 15:18:55,805 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-13 15:18:55,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:55,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:55,810 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-13 15:18:55,814 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-13 15:18:55,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:18:56,149 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-13 15:18:58,263 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_540 Int) (v_ArrVal_548 Int)) (or (= v_ArrVal_548 v_ArrVal_540) (and (forall ((v_ArrVal_541 Int) (v_ArrVal_552 Int) (v_ArrVal_550 Int) (v_ArrVal_539 Int) (v_ArrVal_537 Int)) (= (let ((.cse6 (+ v_ArrVal_539 4))) (let ((.cse0 (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.offset| v_ArrVal_540 (store (store (select |c_#memory_$Pointer$.offset| v_ArrVal_540) .cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) v_ArrVal_539 v_ArrVal_541)))) (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_539))))) (store .cse7 v_ArrVal_548 (store (store (select .cse7 v_ArrVal_548) 4 v_ArrVal_539) 0 v_ArrVal_552))))) (let ((.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| 0)) v_ArrVal_548) 4))) (select (select (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse2)) (select (select (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| v_ArrVal_540 (store (store (select |c_#memory_$Pointer$.base| v_ArrVal_540) .cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) v_ArrVal_539 v_ArrVal_537)))) (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_540))))) (store .cse4 v_ArrVal_548 (store (store (select .cse4 v_ArrVal_548) 4 v_ArrVal_540) 0 v_ArrVal_550))))) (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| v_ArrVal_548))) v_ArrVal_548) 4)) (+ .cse2 4)))))) 0)) (forall ((v_ArrVal_541 Int) (v_ArrVal_552 Int) (v_ArrVal_550 Int) (v_ArrVal_539 Int) (v_ArrVal_537 Int)) (= (let ((.cse14 (+ v_ArrVal_539 4))) (select (let ((.cse9 (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$.base| v_ArrVal_540 (store (store (select |c_#memory_$Pointer$.base| v_ArrVal_540) .cse14 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) v_ArrVal_539 v_ArrVal_537)))) (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| v_ArrVal_540))))) (store .cse12 v_ArrVal_548 (store (store (select .cse12 v_ArrVal_548) 4 v_ArrVal_540) 0 v_ArrVal_550))))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse11 (select (select (store .cse9 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_548)) v_ArrVal_548) 4))) (select (store .cse9 |c_ULTIMATE.start_main_~#list~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#list~0#1.offset| .cse11)) .cse11)))) (+ (select (select (let ((.cse15 (let ((.cse16 (let ((.cse17 (store |c_#memory_$Pointer$.offset| v_ArrVal_540 (store (store (select |c_#memory_$Pointer$.offset| v_ArrVal_540) .cse14 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) v_ArrVal_539 v_ArrVal_541)))) (store .cse17 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_539))))) (store .cse16 v_ArrVal_548 (store (store (select .cse16 v_ArrVal_548) 4 v_ArrVal_539) 0 v_ArrVal_552))))) (store .cse15 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| 0))) v_ArrVal_548) 4) 4))) 0))) (not (< v_ArrVal_548 |c_#StackHeapBarrier|)) (not (< v_ArrVal_540 |c_#StackHeapBarrier|)))) is different from false [2022-07-13 15:18:58,762 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-07-13 15:18:58,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970811968] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:18:58,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:18:58,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-07-13 15:18:58,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459298199] [2022-07-13 15:18:58,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:18:58,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 15:18:58,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:58,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 15:18:58,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=200, Unknown=1, NotChecked=28, Total=272 [2022-07-13 15:18:58,764 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-13 15:18:59,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:59,122 INFO L93 Difference]: Finished difference Result 110 states and 138 transitions. [2022-07-13 15:18:59,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 15:18:59,123 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-13 15:18:59,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:59,124 INFO L225 Difference]: With dead ends: 110 [2022-07-13 15:18:59,124 INFO L226 Difference]: Without dead ends: 91 [2022-07-13 15:18:59,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=65, Invalid=318, Unknown=1, NotChecked=36, Total=420 [2022-07-13 15:18:59,125 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 36 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:18:59,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 273 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 59 Unchecked, 0.1s Time] [2022-07-13 15:18:59,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-13 15:18:59,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2022-07-13 15:18:59,132 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-13 15:18:59,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 113 transitions. [2022-07-13 15:18:59,133 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 113 transitions. Word has length 31 [2022-07-13 15:18:59,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:59,133 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 113 transitions. [2022-07-13 15:18:59,133 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-13 15:18:59,134 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2022-07-13 15:18:59,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-13 15:18:59,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:59,134 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:59,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-13 15:18:59,343 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-13 15:18:59,344 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:59,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:59,344 INFO L85 PathProgramCache]: Analyzing trace with hash 632278213, now seen corresponding path program 1 times [2022-07-13 15:18:59,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:59,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844487336] [2022-07-13 15:18:59,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:59,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:59,371 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-13 15:18:59,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:59,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844487336] [2022-07-13 15:18:59,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844487336] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:18:59,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:18:59,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:18:59,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139972846] [2022-07-13 15:18:59,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:18:59,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:18:59,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:59,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:18:59,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:18:59,373 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-13 15:18:59,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:59,390 INFO L93 Difference]: Finished difference Result 225 states and 281 transitions. [2022-07-13 15:18:59,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:18:59,390 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-13 15:18:59,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:59,391 INFO L225 Difference]: With dead ends: 225 [2022-07-13 15:18:59,391 INFO L226 Difference]: Without dead ends: 132 [2022-07-13 15:18:59,392 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-13 15:18:59,392 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-13 15:18:59,392 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-13 15:18:59,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-13 15:18:59,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 99. [2022-07-13 15:18:59,399 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-13 15:18:59,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 123 transitions. [2022-07-13 15:18:59,400 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 123 transitions. Word has length 32 [2022-07-13 15:18:59,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:59,401 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 123 transitions. [2022-07-13 15:18:59,401 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-13 15:18:59,401 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2022-07-13 15:18:59,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-13 15:18:59,402 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:59,402 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:59,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 15:18:59,402 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:59,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:59,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1727239095, now seen corresponding path program 2 times [2022-07-13 15:18:59,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:59,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654975630] [2022-07-13 15:18:59,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:59,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:59,434 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-13 15:18:59,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:59,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654975630] [2022-07-13 15:18:59,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654975630] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:18:59,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:18:59,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:18:59,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060269801] [2022-07-13 15:18:59,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:18:59,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:18:59,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:18:59,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:18:59,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:18:59,436 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-13 15:18:59,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:18:59,447 INFO L93 Difference]: Finished difference Result 135 states and 160 transitions. [2022-07-13 15:18:59,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:18:59,448 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-13 15:18:59,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:18:59,448 INFO L225 Difference]: With dead ends: 135 [2022-07-13 15:18:59,448 INFO L226 Difference]: Without dead ends: 92 [2022-07-13 15:18:59,449 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-13 15:18:59,449 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-13 15:18:59,449 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-13 15:18:59,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-13 15:18:59,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2022-07-13 15:18:59,455 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-13 15:18:59,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2022-07-13 15:18:59,455 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 32 [2022-07-13 15:18:59,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:18:59,456 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2022-07-13 15:18:59,456 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-13 15:18:59,456 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2022-07-13 15:18:59,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 15:18:59,457 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:18:59,457 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:18:59,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 15:18:59,457 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:18:59,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:18:59,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1465132951, now seen corresponding path program 1 times [2022-07-13 15:18:59,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:18:59,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517559384] [2022-07-13 15:18:59,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:59,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:18:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:59,662 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-13 15:18:59,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:18:59,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517559384] [2022-07-13 15:18:59,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517559384] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:18:59,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825590626] [2022-07-13 15:18:59,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:18:59,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:18:59,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:18:59,663 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:18:59,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 15:18:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:18:59,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 91 conjunts are in the unsatisfiable core [2022-07-13 15:18:59,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:18:59,762 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-13 15:18:59,796 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-13 15:18:59,800 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-13 15:18:59,804 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-13 15:18:59,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:59,807 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-13 15:18:59,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:59,811 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-13 15:18:59,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:59,881 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-13 15:18:59,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:59,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:59,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:59,887 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-13 15:18:59,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:59,893 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-13 15:18:59,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:18:59,911 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-07-13 15:18:59,912 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-13 15:19:00,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:00,122 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:00,125 INFO L356 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2022-07-13 15:19:00,125 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-13 15:19:00,131 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:19:00,131 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-13 15:19:00,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:00,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-13 15:19:00,206 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-13 15:19:00,210 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:00,211 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-13 15:19:00,216 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-13 15:19:00,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:19:00,237 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-13 15:19:00,393 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:00,393 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-13 15:19:00,415 INFO L356 Elim1Store]: treesize reduction 69, result has 51.7 percent of original size [2022-07-13 15:19:00,415 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-13 15:19:00,524 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-13 15:19:00,536 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-13 15:19:00,548 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-13 15:19:07,497 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-13 15:19:07,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825590626] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:19:07,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:19:07,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 16 [2022-07-13 15:19:07,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900329205] [2022-07-13 15:19:07,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:19:07,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 15:19:07,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:19:07,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 15:19:07,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=171, Unknown=1, NotChecked=26, Total=240 [2022-07-13 15:19:07,499 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-13 15:19:08,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:19:08,829 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2022-07-13 15:19:08,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 15:19:08,829 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-13 15:19:08,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:19:08,830 INFO L225 Difference]: With dead ends: 92 [2022-07-13 15:19:08,830 INFO L226 Difference]: Without dead ends: 81 [2022-07-13 15:19:08,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=91, Invalid=331, Unknown=2, NotChecked=38, Total=462 [2022-07-13 15:19:08,831 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:19:08,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 106 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 49 Unchecked, 0.0s Time] [2022-07-13 15:19:08,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-13 15:19:08,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 41. [2022-07-13 15:19:08,835 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-13 15:19:08,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-07-13 15:19:08,835 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 36 [2022-07-13 15:19:08,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:19:08,835 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-07-13 15:19:08,835 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-13 15:19:08,835 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-07-13 15:19:08,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 15:19:08,836 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:19:08,836 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2022-07-13 15:19:08,853 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-13 15:19:09,052 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-13 15:19:09,053 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:19:09,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:19:09,053 INFO L85 PathProgramCache]: Analyzing trace with hash -212280090, now seen corresponding path program 4 times [2022-07-13 15:19:09,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:19:09,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421147622] [2022-07-13 15:19:09,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:19:09,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:19:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:19:09,288 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-13 15:19:09,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:19:09,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421147622] [2022-07-13 15:19:09,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421147622] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:19:09,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964731811] [2022-07-13 15:19:09,289 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 15:19:09,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:19:09,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:19:09,290 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-13 15:19:09,291 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-13 15:19:09,406 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 15:19:09,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:19:09,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 137 conjunts are in the unsatisfiable core [2022-07-13 15:19:09,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:19:09,420 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-13 15:19:09,454 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-13 15:19:09,459 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-13 15:19:09,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-13 15:19:09,476 INFO L356 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-07-13 15:19:09,476 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-13 15:19:09,479 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-13 15:19:09,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:09,569 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-13 15:19:09,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:09,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:09,576 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-13 15:19:09,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:09,581 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-13 15:19:09,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:09,600 INFO L356 Elim1Store]: treesize reduction 50, result has 37.5 percent of original size [2022-07-13 15:19:09,600 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-13 15:19:09,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:09,762 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-13 15:19:09,763 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-13 15:19:09,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:09,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:09,771 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-13 15:19:09,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:09,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:09,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:09,778 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-13 15:19:09,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:09,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:09,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:09,789 INFO L356 Elim1Store]: treesize reduction 4, result has 83.3 percent of original size [2022-07-13 15:19:09,789 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-13 15:19:09,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:09,978 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:09,981 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-13 15:19:09,981 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-13 15:19:09,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:09,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:09,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:09,990 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:19:09,991 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-13 15:19: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, 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-13 15:19:10,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:10,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:10,124 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:10,126 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-13 15:19:10,126 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-13 15:19:10,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:10,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:10,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:10,145 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:19:10,145 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-13 15:19:10,149 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-13 15:19:10,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:19:10,239 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:19:10,239 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-13 15:19:10,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:10,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, 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-13 15:19:10,251 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-13 15:19:10,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:19:10,269 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-13 15:19:10,282 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-13 15:19:24,906 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-13 15:19:25,116 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:19:25,116 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-13 15:19:25,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:25,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:25,128 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-13 15:19:25,159 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:25,162 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:25,162 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:19:25,760 INFO L356 Elim1Store]: treesize reduction 20468, result has 0.4 percent of original size [2022-07-13 15:19:25,762 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 124687294 treesize of output 120268950 [2022-07-13 15:19:32,989 WARN L233 SmtUtils]: Spent 7.22s on a formula simplification that was a NOOP. DAG size: 1565 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-13 15:20:17,455 WARN L233 SmtUtils]: Spent 44.46s on a formula simplification. DAG size of input: 1555 DAG size of output: 1461 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-13 15:20:17,509 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:20:17,537 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-13 15:20:17,568 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 5406 [2022-07-13 15:20:17,594 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 5406 treesize of output 5246 [2022-07-13 15:20:17,624 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-13 15:20:21,686 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-13 15:20:21,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964731811] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:20:21,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:20:21,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2022-07-13 15:20:21,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221148737] [2022-07-13 15:20:21,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:20:21,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-13 15:20:21,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:20:21,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-13 15:20:21,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=285, Unknown=3, NotChecked=108, Total=462 [2022-07-13 15:20:21,688 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-13 15:20:35,776 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-13 15:20:49,831 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-13 15:21:04,213 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-13 15:21:07,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:21:07,951 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2022-07-13 15:21:07,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-13 15:21:07,951 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-13 15:21:07,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:21:07,952 INFO L225 Difference]: With dead ends: 107 [2022-07-13 15:21:07,952 INFO L226 Difference]: Without dead ends: 105 [2022-07-13 15:21:07,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 6 IntricatePredicates, 4 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 60.9s TimeCoverageRelationStatistics Valid=155, Invalid=669, Unknown=12, NotChecked=354, Total=1190 [2022-07-13 15:21:07,953 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 16 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:21:07,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 180 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 120 Unchecked, 0.1s Time] [2022-07-13 15:21:07,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-13 15:21:07,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 83. [2022-07-13 15:21:07,961 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-13 15:21:07,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2022-07-13 15:21:07,963 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 98 transitions. Word has length 37 [2022-07-13 15:21:07,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:21:07,964 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 98 transitions. [2022-07-13 15:21:07,964 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-13 15:21:07,964 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2022-07-13 15:21:07,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 15:21:07,965 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:21:07,965 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-13 15:21:07,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-13 15:21:08,165 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-13 15:21:08,166 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:21:08,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:21:08,166 INFO L85 PathProgramCache]: Analyzing trace with hash -212278168, now seen corresponding path program 2 times [2022-07-13 15:21:08,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:21:08,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901762078] [2022-07-13 15:21:08,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:21:08,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:21:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:21:08,392 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-13 15:21:08,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:21:08,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901762078] [2022-07-13 15:21:08,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901762078] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:21:08,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779046634] [2022-07-13 15:21:08,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:21:08,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:21:08,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:21:08,394 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-13 15:21:08,394 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-13 15:21:08,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:21:08,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:21:08,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 136 conjunts are in the unsatisfiable core [2022-07-13 15:21:08,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:21:08,526 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-13 15:21:08,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-13 15:21:08,564 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-13 15:21:08,567 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-13 15:21:08,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:08,571 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-13 15:21:08,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:08,575 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-13 15:21:08,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:08,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:08,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:08,664 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-13 15:21:08,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:08,670 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-13 15:21:08,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:08,675 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-13 15:21:08,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:08,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:08,690 INFO L356 Elim1Store]: treesize reduction 50, result has 37.5 percent of original size [2022-07-13 15:21:08,690 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-13 15:21:08,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:08,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:08,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:08,849 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-13 15:21:08,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:08,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:08,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:08,858 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-13 15:21:08,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:08,869 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-13 15:21:08,869 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-13 15:21:08,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:08,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:08,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:08,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:08,882 INFO L356 Elim1Store]: treesize reduction 4, result has 83.3 percent of original size [2022-07-13 15:21:08,882 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-13 15:21:09,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:09,064 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:09,068 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-13 15:21:09,068 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-13 15:21:09,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:09,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:09,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:09,078 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:21:09,078 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-13 15:21:09,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:09,083 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-13 15:21:09,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:09,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:09,218 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:09,222 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-13 15:21:09,222 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-13 15:21:09,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:09,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:09,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:09,233 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 15:21:09,233 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-13 15:21:09,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:09,239 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-13 15:21:09,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:09,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:21:09,317 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:09,325 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-13 15:21:09,325 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-13 15:21:09,331 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:09,332 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-13 15:21:09,338 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-13 15:21:09,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:21:09,358 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-13 15:21:09,377 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-13 15:21:23,951 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-13 15:21:24,186 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:21:24,186 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-13 15:21:24,191 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:24,197 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:24,198 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-13 15:21:24,226 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:24,234 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:24,235 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:21:24,825 INFO L356 Elim1Store]: treesize reduction 20468, result has 0.4 percent of original size [2022-07-13 15:21:24,827 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 150967830 treesize of output 145645838 [2022-07-13 15:21:32,873 WARN L233 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 1865 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-13 15:22:38,809 WARN L233 SmtUtils]: Spent 1.10m on a formula simplification. DAG size of input: 1853 DAG size of output: 1759 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-13 15:22:38,862 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:22:38,892 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 3882 treesize of output 3794 [2022-07-13 15:22:38,913 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 3794 treesize of output 3706 [2022-07-13 15:22:38,931 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 3706 treesize of output 3494 [2022-07-13 15:22:38,951 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 2677 treesize of output 2645 [2022-07-13 15:22:40,905 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 0 refuted. 5 times theorem prover too weak. 0 trivial. 30 not checked. [2022-07-13 15:22:40,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779046634] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:22:40,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:22:40,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2022-07-13 15:22:40,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955589512] [2022-07-13 15:22:40,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:22:40,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-13 15:22:40,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:22:40,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-13 15:22:40,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=247, Unknown=4, NotChecked=102, Total=420 [2022-07-13 15:22:40,907 INFO L87 Difference]: Start difference. First operand 83 states and 98 transitions. Second operand has 21 states, 21 states have (on average 4.904761904761905) internal successors, (103), 21 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:22:54,991 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (and (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)))) (< |c_ULTIMATE.start_main_~base~0#1| (select (select |c_#memory_int| .cse11) 0)) (= (select |c_#valid| .cse11) 1) (= (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) (< .cse11 |c_#StackHeapBarrier|))) is different from false [2022-07-13 15:23:09,219 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| .cse12) 4))) (and (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)))) (= (select |c_#valid| .cse11) 1) (< |c_ULTIMATE.start_main_~base~0#1| (select (select |c_#memory_int| .cse12) 0)) (= (select |c_#valid| .cse12) 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#list~0#1.base|) (< .cse11 |c_#StackHeapBarrier|) (= (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| .cse12) 4) 0) (< |c_ULTIMATE.start_main_~base~0#1| (select (select |c_#memory_int| .cse11) 0)) (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (not (= .cse12 .cse11)) (< .cse12 |c_#StackHeapBarrier|)))) is different from false