./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/shared_mem1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-data/shared_mem1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 47cb7cab177485da5df0f1af4a3f61fd7eb970990493dd3ac764f888774cbf0f --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 13:44:38,793 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 13:44:38,794 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 13:44:38,811 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 13:44:38,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 13:44:38,817 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 13:44:38,818 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 13:44:38,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 13:44:38,820 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 13:44:38,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 13:44:38,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 13:44:38,822 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 13:44:38,822 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 13:44:38,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 13:44:38,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 13:44:38,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 13:44:38,825 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 13:44:38,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 13:44:38,827 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 13:44:38,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 13:44:38,829 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 13:44:38,830 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 13:44:38,831 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 13:44:38,831 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 13:44:38,833 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 13:44:38,833 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 13:44:38,833 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 13:44:38,834 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 13:44:38,834 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 13:44:38,835 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 13:44:38,835 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 13:44:38,836 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 13:44:38,836 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 13:44:38,837 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 13:44:38,838 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 13:44:38,838 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 13:44:38,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 13:44:38,839 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 13:44:38,839 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 13:44:38,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 13:44:38,840 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 13:44:38,841 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 13:44:38,853 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 13:44:38,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 13:44:38,854 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 13:44:38,854 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 13:44:38,854 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 13:44:38,854 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 13:44:38,855 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 13:44:38,855 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 13:44:38,855 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 13:44:38,855 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 13:44:38,855 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 13:44:38,856 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 13:44:38,856 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 13:44:38,856 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 13:44:38,856 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 13:44:38,856 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 13:44:38,856 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 13:44:38,856 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 13:44:38,856 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 13:44:38,857 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 13:44:38,857 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 13:44:38,857 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 13:44:38,857 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 13:44:38,857 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 13:44:38,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:44:38,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 13:44:38,858 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 13:44:38,858 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 13:44:38,858 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 13:44:38,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 13:44:38,858 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 13:44:38,858 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 13:44:38,858 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 13:44:38,859 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 13:44:38,859 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 47cb7cab177485da5df0f1af4a3f61fd7eb970990493dd3ac764f888774cbf0f [2021-12-14 13:44:39,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 13:44:39,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 13:44:39,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 13:44:39,077 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 13:44:39,078 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 13:44:39,078 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/shared_mem1.i [2021-12-14 13:44:39,134 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72e5cf40b/54f88d203219447788830578b692fd59/FLAG61b981714 [2021-12-14 13:44:39,544 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 13:44:39,544 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem1.i [2021-12-14 13:44:39,554 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72e5cf40b/54f88d203219447788830578b692fd59/FLAG61b981714 [2021-12-14 13:44:39,562 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72e5cf40b/54f88d203219447788830578b692fd59 [2021-12-14 13:44:39,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 13:44:39,567 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 13:44:39,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 13:44:39,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 13:44:39,571 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 13:44:39,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:44:39" (1/1) ... [2021-12-14 13:44:39,572 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a5732af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:39, skipping insertion in model container [2021-12-14 13:44:39,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:44:39" (1/1) ... [2021-12-14 13:44:39,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 13:44:39,614 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 13:44:39,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem1.i[23879,23892] [2021-12-14 13:44:39,830 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:44:39,834 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 13:44:39,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem1.i[23879,23892] [2021-12-14 13:44:39,858 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:44:39,875 INFO L208 MainTranslator]: Completed translation [2021-12-14 13:44:39,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:39 WrapperNode [2021-12-14 13:44:39,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 13:44:39,876 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 13:44:39,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 13:44:39,877 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 13:44:39,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:39" (1/1) ... [2021-12-14 13:44:39,904 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:39" (1/1) ... [2021-12-14 13:44:39,924 INFO L137 Inliner]: procedures = 121, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2021-12-14 13:44:39,924 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 13:44:39,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 13:44:39,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 13:44:39,925 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 13:44:39,930 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:39" (1/1) ... [2021-12-14 13:44:39,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:39" (1/1) ... [2021-12-14 13:44:39,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:39" (1/1) ... [2021-12-14 13:44:39,938 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:39" (1/1) ... [2021-12-14 13:44:39,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:39" (1/1) ... [2021-12-14 13:44:39,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:39" (1/1) ... [2021-12-14 13:44:39,960 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:39" (1/1) ... [2021-12-14 13:44:39,962 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 13:44:39,964 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 13:44:39,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 13:44:39,965 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 13:44:39,966 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:39" (1/1) ... [2021-12-14 13:44:39,971 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:44:39,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:44:40,053 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) [2021-12-14 13:44:40,091 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 [2021-12-14 13:44:40,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 13:44:40,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 13:44:40,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 13:44:40,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 13:44:40,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 13:44:40,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 13:44:40,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 13:44:40,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 13:44:40,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 13:44:40,166 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 13:44:40,167 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 13:44:40,308 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 13:44:40,312 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 13:44:40,312 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-14 13:44:40,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:44:40 BoogieIcfgContainer [2021-12-14 13:44:40,314 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 13:44:40,315 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 13:44:40,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 13:44:40,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 13:44:40,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:44:39" (1/3) ... [2021-12-14 13:44:40,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29fa093f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:44:40, skipping insertion in model container [2021-12-14 13:44:40,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:39" (2/3) ... [2021-12-14 13:44:40,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29fa093f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:44:40, skipping insertion in model container [2021-12-14 13:44:40,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:44:40" (3/3) ... [2021-12-14 13:44:40,319 INFO L111 eAbstractionObserver]: Analyzing ICFG shared_mem1.i [2021-12-14 13:44:40,322 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 13:44:40,322 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 13:44:40,351 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 13:44:40,355 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 13:44:40,356 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 13:44:40,364 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:40,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-14 13:44:40,368 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:40,368 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:40,368 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:40,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:40,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1650103796, now seen corresponding path program 1 times [2021-12-14 13:44:40,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:40,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736303100] [2021-12-14 13:44:40,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:40,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:40,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:40,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:40,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736303100] [2021-12-14 13:44:40,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736303100] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:44:40,489 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:44:40,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 13:44:40,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573280040] [2021-12-14 13:44:40,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:44:40,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 13:44:40,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:40,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 13:44:40,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 13:44:40,512 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:40,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:40,520 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2021-12-14 13:44:40,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 13:44:40,521 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-14 13:44:40,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:40,526 INFO L225 Difference]: With dead ends: 27 [2021-12-14 13:44:40,526 INFO L226 Difference]: Without dead ends: 13 [2021-12-14 13:44:40,528 INFO L932 BasicCegarLoop]: 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 [2021-12-14 13:44:40,530 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:40,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:44:40,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-12-14 13:44:40,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-12-14 13:44:40,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:40,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2021-12-14 13:44:40,551 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 10 [2021-12-14 13:44:40,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:40,551 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2021-12-14 13:44:40,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:40,551 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2021-12-14 13:44:40,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-14 13:44:40,552 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:40,552 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:40,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 13:44:40,553 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:40,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:40,556 INFO L85 PathProgramCache]: Analyzing trace with hash -812668617, now seen corresponding path program 1 times [2021-12-14 13:44:40,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:40,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779053743] [2021-12-14 13:44:40,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:40,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:40,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:40,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:40,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779053743] [2021-12-14 13:44:40,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779053743] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:44:40,977 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:44:40,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 13:44:40,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613388914] [2021-12-14 13:44:40,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:44:40,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 13:44:40,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:40,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 13:44:40,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:44:40,981 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:41,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:41,123 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2021-12-14 13:44:41,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 13:44:41,124 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-14 13:44:41,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:41,125 INFO L225 Difference]: With dead ends: 29 [2021-12-14 13:44:41,126 INFO L226 Difference]: Without dead ends: 27 [2021-12-14 13:44:41,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-14 13:44:41,127 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 31 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:41,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 38 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:44:41,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-14 13:44:41,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2021-12-14 13:44:41,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:41,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2021-12-14 13:44:41,131 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 11 [2021-12-14 13:44:41,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:41,132 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2021-12-14 13:44:41,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:41,132 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2021-12-14 13:44:41,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-14 13:44:41,132 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:41,132 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:41,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 13:44:41,133 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:41,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:41,147 INFO L85 PathProgramCache]: Analyzing trace with hash -812666695, now seen corresponding path program 1 times [2021-12-14 13:44:41,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:41,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206297156] [2021-12-14 13:44:41,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:41,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:41,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:41,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:41,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206297156] [2021-12-14 13:44:41,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206297156] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:44:41,272 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:44:41,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 13:44:41,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549881976] [2021-12-14 13:44:41,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:44:41,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 13:44:41,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:41,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 13:44:41,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 13:44:41,274 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:41,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:41,378 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2021-12-14 13:44:41,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 13:44:41,379 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-14 13:44:41,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:41,380 INFO L225 Difference]: With dead ends: 31 [2021-12-14 13:44:41,380 INFO L226 Difference]: Without dead ends: 24 [2021-12-14 13:44:41,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-12-14 13:44:41,382 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:41,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 38 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:44:41,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-12-14 13:44:41,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2021-12-14 13:44:41,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:41,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2021-12-14 13:44:41,391 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 11 [2021-12-14 13:44:41,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:41,391 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2021-12-14 13:44:41,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:41,392 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2021-12-14 13:44:41,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-14 13:44:41,393 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:41,393 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:41,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 13:44:41,394 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:41,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:41,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1760681901, now seen corresponding path program 1 times [2021-12-14 13:44:41,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:41,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819449725] [2021-12-14 13:44:41,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:41,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:41,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:41,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:41,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819449725] [2021-12-14 13:44:41,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819449725] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:44:41,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757941083] [2021-12-14 13:44:41,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:41,690 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:41,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:44:41,701 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) [2021-12-14 13:44:41,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 13:44:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:41,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-14 13:44:41,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:41,906 INFO L354 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2021-12-14 13:44:41,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 74 [2021-12-14 13:44:41,951 INFO L354 Elim1Store]: treesize reduction 46, result has 37.0 percent of original size [2021-12-14 13:44:41,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 92 [2021-12-14 13:44:41,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:41,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:41,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:41,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2021-12-14 13:44:42,049 INFO L388 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 23 treesize of output 20 [2021-12-14 13:44:42,093 INFO L388 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 17 treesize of output 15 [2021-12-14 13:44:42,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:42,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:42,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:42,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2021-12-14 13:44:42,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:42,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:42,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:42,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2021-12-14 13:44:42,263 INFO L388 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 56 treesize of output 46 [2021-12-14 13:44:42,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:42,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:42,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:42,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2021-12-14 13:44:42,292 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 13:44:42,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-14 13:44:42,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:42,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:42,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:42,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2021-12-14 13:44:42,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:42,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2021-12-14 13:44:42,403 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-14 13:44:42,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-12-14 13:44:42,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2021-12-14 13:44:42,532 INFO L354 Elim1Store]: treesize reduction 40, result has 64.0 percent of original size [2021-12-14 13:44:42,532 INFO L388 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 96 [2021-12-14 13:44:42,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 64 [2021-12-14 13:44:44,158 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:44:44,159 INFO L388 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 63 [2021-12-14 13:44:44,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:44,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:44:44,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 54 [2021-12-14 13:44:44,272 INFO L388 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 54 treesize of output 36 [2021-12-14 13:44:46,058 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_244 Int) (v_arrayElimCell_29 Int) (v_arrayElimCell_28 Int)) (let ((.cse1 (select |c_#memory_int| v_arrayElimCell_28))) (let ((.cse0 (select .cse1 v_arrayElimCell_29))) (or (< 100 .cse0) (<= (select (select (store |c_#memory_int| v_arrayElimCell_28 (store .cse1 v_arrayElimCell_29 v_ArrVal_244)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109) (< (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) .cse0) v_ArrVal_244))))) is different from false [2021-12-14 13:44:48,089 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_244 Int) (v_arrayElimCell_29 Int) (v_arrayElimCell_28 Int)) (let ((.cse1 (select |c_#memory_int| v_arrayElimCell_28))) (let ((.cse0 (select .cse1 v_arrayElimCell_29))) (or (< 100 .cse0) (<= (select (select (store |c_#memory_int| v_arrayElimCell_28 (store .cse1 v_arrayElimCell_29 v_ArrVal_244)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109) (< (+ .cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) v_ArrVal_244))))) is different from false [2021-12-14 13:44:48,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-14 13:44:48,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757941083] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:44:48,295 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:44:48,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2021-12-14 13:44:48,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950181801] [2021-12-14 13:44:48,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:44:48,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-14 13:44:48,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:48,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-14 13:44:48,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=183, Unknown=4, NotChecked=58, Total=306 [2021-12-14 13:44:48,303 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:50,430 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse5 (= |c_ULTIMATE.start_main_~m~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse7))) (.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse4 (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 100))) (and (not (= |c_ULTIMATE.start_main_~m~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (= .cse0 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~m~0#1.base|) 1) (<= .cse1 1) (forall ((v_ArrVal_244 Int) (v_arrayElimCell_29 Int) (v_arrayElimCell_28 Int)) (let ((.cse3 (select |c_#memory_int| v_arrayElimCell_28))) (let ((.cse2 (select .cse3 v_arrayElimCell_29))) (or (< 100 .cse2) (<= (select (select (store |c_#memory_int| v_arrayElimCell_28 (store .cse3 v_arrayElimCell_29 v_ArrVal_244)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109) (< (+ .cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) v_ArrVal_244))))) (<= .cse0 1) (or .cse4 .cse5) .cse4 (or (not .cse5) (let ((.cse6 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse7) |c_ULTIMATE.start_main_~m~0#1.offset|))) (and (or (not .cse6) (= .cse1 1)) (or .cse6 .cse4)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~head~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2021-12-14 13:44:52,506 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~m~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (= .cse0 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~m~0#1.base|) 1) (forall ((v_ArrVal_244 Int) (v_arrayElimCell_29 Int) (v_arrayElimCell_28 Int)) (let ((.cse2 (select |c_#memory_int| v_arrayElimCell_28))) (let ((.cse1 (select .cse2 v_arrayElimCell_29))) (or (< 100 .cse1) (<= (select (select (store |c_#memory_int| v_arrayElimCell_28 (store .cse2 v_arrayElimCell_29 v_ArrVal_244)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109) (< (+ .cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) v_ArrVal_244))))) (<= .cse0 1) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 100) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~head~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-14 13:44:54,542 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~m~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (= .cse0 1) (forall ((v_ArrVal_244 Int) (v_arrayElimCell_29 Int) (v_arrayElimCell_28 Int)) (let ((.cse2 (select |c_#memory_int| v_arrayElimCell_28))) (let ((.cse1 (select .cse2 v_arrayElimCell_29))) (or (< 100 .cse1) (<= (select (select (store |c_#memory_int| v_arrayElimCell_28 (store .cse2 v_arrayElimCell_29 v_ArrVal_244)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109) (< (+ .cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) v_ArrVal_244))))) (<= .cse0 1) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 100) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0))) is different from false [2021-12-14 13:44:55,504 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse2 (= |c_ULTIMATE.start_main_~m~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse6))) (.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse1 (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 100))) (and (not (= |c_ULTIMATE.start_main_~m~0#1.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (<= .cse0 1) (or .cse1 .cse2) (forall ((v_ArrVal_244 Int) (v_arrayElimCell_29 Int) (v_arrayElimCell_28 Int)) (let ((.cse4 (select |c_#memory_int| v_arrayElimCell_28))) (let ((.cse3 (select .cse4 v_arrayElimCell_29))) (or (< 100 .cse3) (<= (select (select (store |c_#memory_int| v_arrayElimCell_28 (store .cse4 v_arrayElimCell_29 v_ArrVal_244)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109) (< (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) .cse3) v_ArrVal_244))))) .cse1 (or (not .cse2) (let ((.cse5 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse6) |c_ULTIMATE.start_main_~m~0#1.offset|))) (and (or (not .cse5) (= .cse0 1)) (or .cse5 .cse1)))) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0)))) is different from false [2021-12-14 13:44:57,541 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~m~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~m~0#1.base|) 1) (forall ((v_ArrVal_244 Int) (v_arrayElimCell_29 Int) (v_arrayElimCell_28 Int)) (let ((.cse1 (select |c_#memory_int| v_arrayElimCell_28))) (let ((.cse0 (select .cse1 v_arrayElimCell_29))) (or (< 100 .cse0) (<= (select (select (store |c_#memory_int| v_arrayElimCell_28 (store .cse1 v_arrayElimCell_29 v_ArrVal_244)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109) (< (+ .cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) v_ArrVal_244))))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 100) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~head~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)) is different from false [2021-12-14 13:44:59,597 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~m~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_244 Int) (v_arrayElimCell_29 Int) (v_arrayElimCell_28 Int)) (let ((.cse1 (select |c_#memory_int| v_arrayElimCell_28))) (let ((.cse0 (select .cse1 v_arrayElimCell_29))) (or (< 100 .cse0) (<= (select (select (store |c_#memory_int| v_arrayElimCell_28 (store .cse1 v_arrayElimCell_29 v_ArrVal_244)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109) (< (+ .cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) v_ArrVal_244))))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 1) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 100) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0)) is different from false [2021-12-14 13:45:00,827 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~m~0#1.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 1) (forall ((v_ArrVal_244 Int) (v_arrayElimCell_29 Int) (v_arrayElimCell_28 Int)) (let ((.cse1 (select |c_#memory_int| v_arrayElimCell_28))) (let ((.cse0 (select .cse1 v_arrayElimCell_29))) (or (< 100 .cse0) (<= (select (select (store |c_#memory_int| v_arrayElimCell_28 (store .cse1 v_arrayElimCell_29 v_ArrVal_244)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109) (< (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) .cse0) v_ArrVal_244))))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 100) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0)) is different from false [2021-12-14 13:45:00,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:45:00,920 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2021-12-14 13:45:00,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-14 13:45:00,923 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-14 13:45:00,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:45:00,925 INFO L225 Difference]: With dead ends: 46 [2021-12-14 13:45:00,926 INFO L226 Difference]: Without dead ends: 44 [2021-12-14 13:45:00,927 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=144, Invalid=343, Unknown=11, NotChecked=432, Total=930 [2021-12-14 13:45:00,928 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 36 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:45:00,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 85 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 76 Invalid, 0 Unknown, 99 Unchecked, 0.1s Time] [2021-12-14 13:45:00,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-14 13:45:00,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2021-12-14 13:45:00,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:45:00,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2021-12-14 13:45:00,940 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 14 [2021-12-14 13:45:00,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:45:00,941 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2021-12-14 13:45:00,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:45:00,941 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2021-12-14 13:45:00,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-14 13:45:00,942 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:45:00,942 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:45:00,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 13:45:01,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:01,155 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:45:01,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:45:01,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1760679979, now seen corresponding path program 1 times [2021-12-14 13:45:01,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:45:01,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705922126] [2021-12-14 13:45:01,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:01,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:45:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:01,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:45:01,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:45:01,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705922126] [2021-12-14 13:45:01,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705922126] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:45:01,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078404549] [2021-12-14 13:45:01,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:01,381 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:01,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:45:01,389 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) [2021-12-14 13:45:01,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 13:45:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:01,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 55 conjunts are in the unsatisfiable core [2021-12-14 13:45:01,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:45:01,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:01,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2021-12-14 13:45:01,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:01,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2021-12-14 13:45:01,516 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 13:45:01,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-14 13:45:01,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:01,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2021-12-14 13:45:01,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2021-12-14 13:45:01,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:01,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:01,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:01,536 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2021-12-14 13:45:01,540 INFO L388 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 8 treesize of output 7 [2021-12-14 13:45:01,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:01,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:01,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2021-12-14 13:45:01,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:01,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:01,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2021-12-14 13:45:01,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:01,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:01,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:01,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2021-12-14 13:45:01,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:01,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2021-12-14 13:45:01,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:01,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2021-12-14 13:45:01,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:01,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2021-12-14 13:45:01,719 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-14 13:45:01,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-12-14 13:45:01,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2021-12-14 13:45:01,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 30 [2021-12-14 13:45:01,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-12-14 13:45:01,881 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 13:45:01,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2021-12-14 13:45:01,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:45:01,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:45:02,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:45:02,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078404549] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:45:02,138 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:45:02,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2021-12-14 13:45:02,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116077860] [2021-12-14 13:45:02,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:45:02,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-14 13:45:02,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:45:02,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-14 13:45:02,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=180, Unknown=2, NotChecked=0, Total=240 [2021-12-14 13:45:02,140 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:45:02,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:45:02,346 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2021-12-14 13:45:02,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 13:45:02,347 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-14 13:45:02,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:45:02,347 INFO L225 Difference]: With dead ends: 43 [2021-12-14 13:45:02,347 INFO L226 Difference]: Without dead ends: 31 [2021-12-14 13:45:02,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=243, Unknown=2, NotChecked=0, Total=342 [2021-12-14 13:45:02,348 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:45:02,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 58 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 42 Invalid, 0 Unknown, 23 Unchecked, 0.1s Time] [2021-12-14 13:45:02,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-14 13:45:02,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2021-12-14 13:45:02,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:45:02,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-12-14 13:45:02,350 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 14 [2021-12-14 13:45:02,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:45:02,350 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-12-14 13:45:02,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:45:02,350 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-12-14 13:45:02,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 13:45:02,351 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:45:02,351 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:45:02,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 13:45:02,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:02,560 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:45:02,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:45:02,560 INFO L85 PathProgramCache]: Analyzing trace with hash 187961508, now seen corresponding path program 1 times [2021-12-14 13:45:02,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:45:02,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556783481] [2021-12-14 13:45:02,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:02,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:45:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:02,833 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:45:02,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:45:02,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556783481] [2021-12-14 13:45:02,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556783481] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:45:02,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621739196] [2021-12-14 13:45:02,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:02,834 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:02,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:45:02,848 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) [2021-12-14 13:45:02,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 13:45:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:02,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-14 13:45:02,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:45:02,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:02,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2021-12-14 13:45:02,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:02,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:02,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2021-12-14 13:45:02,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:02,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2021-12-14 13:45:02,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:02,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:02,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:02,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2021-12-14 13:45:02,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:02,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:02,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2021-12-14 13:45:02,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2021-12-14 13:45:02,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2021-12-14 13:45:03,131 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 13:45:03,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 102 [2021-12-14 13:45:03,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 38 [2021-12-14 13:45:03,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2021-12-14 13:45:03,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-12-14 13:45:03,270 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 13:45:03,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2021-12-14 13:45:03,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:45:03,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:45:03,378 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 Int) (v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse8))) (let ((.cse0 (select |c_#memory_int| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse8))) (or (< v_ArrVal_500 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (select .cse0 .cse1))) (<= 101 (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_503)) (.cse3 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_502)) (.cse7 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7) 4))) (select (select (store |c_#memory_int| .cse2 (store .cse0 .cse1 v_ArrVal_500)) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5)))))))))) is different from false [2021-12-14 13:45:03,405 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 Int) (v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse8))) (let ((.cse1 (select |c_#memory_int| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse8))) (or (<= 101 (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_503)) (.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_502)) (.cse7 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7) 4))) (select (select (store |c_#memory_int| .cse0 (store .cse1 .cse2 v_ArrVal_500)) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))) (< v_ArrVal_500 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse1 .cse2)))))))) is different from false [2021-12-14 13:45:03,448 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-14 13:45:03,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621739196] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:45:03,448 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:45:03,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 7] total 19 [2021-12-14 13:45:03,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127606004] [2021-12-14 13:45:03,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:45:03,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-14 13:45:03,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:45:03,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-14 13:45:03,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=235, Unknown=2, NotChecked=62, Total=342 [2021-12-14 13:45:03,450 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:45:04,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:45:04,195 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2021-12-14 13:45:04,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 13:45:04,196 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-14 13:45:04,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:45:04,196 INFO L225 Difference]: With dead ends: 50 [2021-12-14 13:45:04,196 INFO L226 Difference]: Without dead ends: 27 [2021-12-14 13:45:04,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=121, Invalid=391, Unknown=2, NotChecked=86, Total=600 [2021-12-14 13:45:04,197 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 39 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 13:45:04,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 123 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 137 Invalid, 0 Unknown, 46 Unchecked, 0.2s Time] [2021-12-14 13:45:04,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-14 13:45:04,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2021-12-14 13:45:04,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:45:04,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2021-12-14 13:45:04,199 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 16 [2021-12-14 13:45:04,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:45:04,199 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2021-12-14 13:45:04,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:45:04,200 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2021-12-14 13:45:04,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 13:45:04,200 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:45:04,200 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:45:04,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 13:45:04,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:04,407 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:45:04,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:45:04,408 INFO L85 PathProgramCache]: Analyzing trace with hash -2098222328, now seen corresponding path program 1 times [2021-12-14 13:45:04,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:45:04,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157240546] [2021-12-14 13:45:04,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:04,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:45:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:04,716 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:45:04,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:45:04,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157240546] [2021-12-14 13:45:04,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157240546] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:45:04,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560995710] [2021-12-14 13:45:04,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:04,717 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:04,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:45:04,718 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) [2021-12-14 13:45:04,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 13:45:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:04,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 86 conjunts are in the unsatisfiable core [2021-12-14 13:45:04,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:45:04,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:04,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2021-12-14 13:45:04,875 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 13:45:04,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-14 13:45:04,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:04,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2021-12-14 13:45:04,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2021-12-14 13:45:04,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:04,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:04,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:04,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2021-12-14 13:45:04,906 INFO L388 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 8 treesize of output 7 [2021-12-14 13:45:04,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:04,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2021-12-14 13:45:05,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:05,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:05,038 INFO L388 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 78 treesize of output 67 [2021-12-14 13:45:05,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:05,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:05,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:05,047 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2021-12-14 13:45:05,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:05,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:05,057 INFO L388 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 55 treesize of output 48 [2021-12-14 13:45:05,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:05,063 INFO L388 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 65 treesize of output 53 [2021-12-14 13:45:05,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:05,070 INFO L388 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 56 treesize of output 52 [2021-12-14 13:45:05,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2021-12-14 13:45:05,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2021-12-14 13:45:05,100 INFO L354 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2021-12-14 13:45:05,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 36 [2021-12-14 13:45:05,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:05,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2021-12-14 13:45:05,359 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-14 13:45:05,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 185 treesize of output 170 [2021-12-14 13:45:05,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 38 [2021-12-14 13:45:05,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 79 [2021-12-14 13:45:05,562 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:45:05,568 INFO L354 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2021-12-14 13:45:05,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 118 treesize of output 70 [2021-12-14 13:45:05,577 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-12-14 13:45:05,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 41 [2021-12-14 13:45:05,583 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 13:45:05,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2021-12-14 13:45:05,605 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:45:05,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:45:05,697 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_681 Int) (v_ArrVal_680 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse8))) (let ((.cse1 (select |c_#memory_int| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse8))) (or (<= 101 (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_682)) (.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_680)) (.cse7 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7) 4))) (select (select (store |c_#memory_int| .cse0 (store .cse1 .cse2 v_ArrVal_681)) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))) (< v_ArrVal_681 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (select .cse1 .cse2)))))))) is different from false [2021-12-14 13:45:05,724 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_681 Int) (v_ArrVal_680 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse8))) (let ((.cse1 (select |c_#memory_int| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse8))) (or (<= 101 (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_682)) (.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_680)) (.cse7 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7) 4))) (select (select (store |c_#memory_int| .cse0 (store .cse1 .cse2 v_ArrVal_681)) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))) (< v_ArrVal_681 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse1 .cse2)))))))) is different from false [2021-12-14 13:45:05,787 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:45:05,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 617 treesize of output 557 [2021-12-14 13:45:05,805 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:45:05,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 545 treesize of output 497 [2021-12-14 13:45:06,783 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-14 13:45:06,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560995710] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:45:06,783 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:45:06,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 24 [2021-12-14 13:45:06,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981424739] [2021-12-14 13:45:06,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:45:06,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-14 13:45:06,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:45:06,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-14 13:45:06,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=407, Unknown=2, NotChecked=82, Total=552 [2021-12-14 13:45:06,785 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:45:08,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:45:08,009 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2021-12-14 13:45:08,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 13:45:08,011 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-14 13:45:08,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:45:08,015 INFO L225 Difference]: With dead ends: 45 [2021-12-14 13:45:08,015 INFO L226 Difference]: Without dead ends: 38 [2021-12-14 13:45:08,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=134, Invalid=742, Unknown=2, NotChecked=114, Total=992 [2021-12-14 13:45:08,017 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 35 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 13:45:08,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 158 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 132 Invalid, 0 Unknown, 52 Unchecked, 0.4s Time] [2021-12-14 13:45:08,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-14 13:45:08,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2021-12-14 13:45:08,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:45:08,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2021-12-14 13:45:08,025 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 19 [2021-12-14 13:45:08,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:45:08,025 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2021-12-14 13:45:08,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:45:08,025 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2021-12-14 13:45:08,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 13:45:08,025 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:45:08,026 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:45:08,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 13:45:08,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:08,228 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:45:08,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:45:08,228 INFO L85 PathProgramCache]: Analyzing trace with hash -2096375286, now seen corresponding path program 1 times [2021-12-14 13:45:08,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:45:08,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342916357] [2021-12-14 13:45:08,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:08,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:45:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:08,589 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:45:08,590 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:45:08,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342916357] [2021-12-14 13:45:08,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342916357] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:45:08,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28295724] [2021-12-14 13:45:08,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:08,590 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:08,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:45:08,603 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) [2021-12-14 13:45:08,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 13:45:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:08,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 87 conjunts are in the unsatisfiable core [2021-12-14 13:45:08,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:45:08,745 INFO L354 Elim1Store]: treesize reduction 46, result has 29.2 percent of original size [2021-12-14 13:45:08,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 71 [2021-12-14 13:45:08,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:08,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:08,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:08,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2021-12-14 13:45:08,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:08,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:08,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:08,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2021-12-14 13:45:08,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:08,795 INFO L388 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 49 treesize of output 41 [2021-12-14 13:45:08,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:08,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:08,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:08,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2021-12-14 13:45:08,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:08,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:08,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:08,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 29 [2021-12-14 13:45:08,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:08,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2021-12-14 13:45:08,844 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 13:45:08,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-14 13:45:08,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:08,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2021-12-14 13:45:08,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2021-12-14 13:45:08,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2021-12-14 13:45:08,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:09,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:09,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2021-12-14 13:45:09,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:09,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:09,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2021-12-14 13:45:09,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:09,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:09,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2021-12-14 13:45:09,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:09,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2021-12-14 13:45:09,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:09,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2021-12-14 13:45:09,051 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-14 13:45:09,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 30 [2021-12-14 13:45:09,336 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-14 13:45:09,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 155 [2021-12-14 13:45:09,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 54 [2021-12-14 13:45:09,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 70 [2021-12-14 13:45:09,616 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:45:09,621 INFO L354 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2021-12-14 13:45:09,621 INFO L388 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 180 treesize of output 100 [2021-12-14 13:45:09,628 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-14 13:45:09,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 87 treesize of output 55 [2021-12-14 13:45:09,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2021-12-14 13:45:09,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2021-12-14 13:45:09,751 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:45:09,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:45:18,513 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:45:18,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1950 treesize of output 1746 [2021-12-14 13:45:18,548 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:45:18,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1734 treesize of output 1662 [2021-12-14 13:45:23,118 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:45:23,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28295724] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:45:23,118 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:45:23,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 26 [2021-12-14 13:45:23,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198359766] [2021-12-14 13:45:23,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:45:23,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-14 13:45:23,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:45:23,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-14 13:45:23,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=561, Unknown=4, NotChecked=0, Total=650 [2021-12-14 13:45:23,120 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 26 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:45:23,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:45:23,666 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2021-12-14 13:45:23,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 13:45:23,667 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 26 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-14 13:45:23,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:45:23,667 INFO L225 Difference]: With dead ends: 43 [2021-12-14 13:45:23,667 INFO L226 Difference]: Without dead ends: 41 [2021-12-14 13:45:23,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=159, Invalid=829, Unknown=4, NotChecked=0, Total=992 [2021-12-14 13:45:23,668 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 44 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:45:23,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 130 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 63 Unchecked, 0.1s Time] [2021-12-14 13:45:23,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-12-14 13:45:23,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2021-12-14 13:45:23,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:45:23,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2021-12-14 13:45:23,671 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 19 [2021-12-14 13:45:23,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:45:23,672 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2021-12-14 13:45:23,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 26 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:45:23,672 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2021-12-14 13:45:23,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 13:45:23,672 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:45:23,672 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:45:23,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 13:45:23,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:23,879 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:45:23,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:45:23,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2096373364, now seen corresponding path program 1 times [2021-12-14 13:45:23,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:45:23,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122634296] [2021-12-14 13:45:23,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:23,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:45:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:24,233 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:45:24,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:45:24,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122634296] [2021-12-14 13:45:24,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122634296] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:45:24,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615043193] [2021-12-14 13:45:24,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:24,234 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:24,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:45:24,235 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) [2021-12-14 13:45:24,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 13:45:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:24,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 84 conjunts are in the unsatisfiable core [2021-12-14 13:45:24,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:45:24,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:24,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2021-12-14 13:45:24,366 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 13:45:24,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-14 13:45:24,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2021-12-14 13:45:24,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2021-12-14 13:45:24,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:24,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:24,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2021-12-14 13:45:24,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:24,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2021-12-14 13:45:24,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:24,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2021-12-14 13:45:24,495 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-14 13:45:24,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 30 [2021-12-14 13:45:24,500 INFO L388 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 [2021-12-14 13:45:24,733 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-14 13:45:24,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 131 treesize of output 116 [2021-12-14 13:45:24,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2021-12-14 13:45:24,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-14 13:45:24,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:24,972 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:45:24,978 INFO L354 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2021-12-14 13:45:24,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 216 treesize of output 110 [2021-12-14 13:45:24,988 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-12-14 13:45:24,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 49 [2021-12-14 13:45:24,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2021-12-14 13:45:25,029 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 13:45:25,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2021-12-14 13:45:25,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:45:25,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:45:29,252 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1037 Int) (v_ArrVal_1034 (Array Int Int))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| .cse10 v_ArrVal_1035)) (.cse11 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~list~0#1.base|) .cse11)) (.cse9 (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_1034))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~list~0#1.base|) .cse11)) (.cse8 (+ .cse6 4))) (let ((.cse1 (store |c_#memory_int| .cse10 v_ArrVal_1036)) (.cse2 (select (select .cse9 .cse5) .cse8))) (let ((.cse3 (select .cse1 .cse2)) (.cse4 (select (select .cse7 .cse5) .cse8))) (let ((.cse0 (select .cse3 .cse4))) (or (<= .cse0 100) (<= 91 (select (select (store .cse1 .cse2 (store .cse3 .cse4 v_ArrVal_1037)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (< (+ (select (select .cse1 .cse5) .cse6) v_ArrVal_1037) .cse0)))))))))) is different from false [2021-12-14 13:45:29,290 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1037 Int) (v_ArrVal_1034 (Array Int Int))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| .cse10 v_ArrVal_1035)) (.cse11 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse9 (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_1034))) (let ((.cse4 (select (select .cse9 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse8 (+ .cse5 4))) (let ((.cse0 (store |c_#memory_int| .cse10 v_ArrVal_1036)) (.cse1 (select (select .cse9 .cse4) .cse8))) (let ((.cse2 (select .cse0 .cse1)) (.cse3 (select (select .cse7 .cse4) .cse8))) (let ((.cse6 (select .cse2 .cse3))) (or (<= 91 (select (select (store .cse0 .cse1 (store .cse2 .cse3 v_ArrVal_1037)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (< (+ v_ArrVal_1037 (select (select .cse0 .cse4) .cse5)) .cse6) (<= .cse6 100)))))))))) is different from false [2021-12-14 13:45:29,372 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:45:29,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1983 treesize of output 1515 [2021-12-14 13:45:29,389 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:45:29,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 1503 treesize of output 1457 [2021-12-14 13:45:29,449 INFO L354 Elim1Store]: treesize reduction 36, result has 57.6 percent of original size [2021-12-14 13:45:29,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 1433 treesize of output 1129 [2021-12-14 13:45:29,498 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:45:29,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39736 treesize of output 34663 [2021-12-14 13:45:29,795 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:45:29,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 92389 treesize of output 78720 [2021-12-14 13:45:30,050 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:45:30,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 78065 treesize of output 76291 [2021-12-14 13:45:30,640 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:45:30,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 73816 treesize of output 73708 [2021-12-14 13:45:31,191 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:45:31,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 76362 treesize of output 75826 [2021-12-14 13:45:31,733 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-14 13:45:31,733 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-14 13:45:31,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2021-12-14 13:45:31,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719374072] [2021-12-14 13:45:31,733 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-14 13:45:31,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 13:45:31,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:45:31,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 13:45:31,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=317, Unknown=2, NotChecked=74, Total=462 [2021-12-14 13:45:31,734 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 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) [2021-12-14 13:45:31,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:45:31,976 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2021-12-14 13:45:31,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 13:45:31,977 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 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) Word has length 19 [2021-12-14 13:45:31,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:45:31,977 INFO L225 Difference]: With dead ends: 46 [2021-12-14 13:45:31,977 INFO L226 Difference]: Without dead ends: 39 [2021-12-14 13:45:31,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=106, Invalid=452, Unknown=2, NotChecked=90, Total=650 [2021-12-14 13:45:31,978 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:45:31,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 40 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:45:31,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-12-14 13:45:31,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2021-12-14 13:45:31,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:45:31,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2021-12-14 13:45:31,982 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 19 [2021-12-14 13:45:31,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:45:31,982 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2021-12-14 13:45:31,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 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) [2021-12-14 13:45:31,982 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2021-12-14 13:45:31,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 13:45:31,982 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:45:31,982 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:45:32,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 13:45:32,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:32,191 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:45:32,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:45:32,192 INFO L85 PathProgramCache]: Analyzing trace with hash -209500636, now seen corresponding path program 2 times [2021-12-14 13:45:32,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:45:32,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286562643] [2021-12-14 13:45:32,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:32,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:45:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:32,467 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 13:45:32,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:45:32,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286562643] [2021-12-14 13:45:32,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286562643] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:45:32,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983503003] [2021-12-14 13:45:32,467 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 13:45:32,467 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:32,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:45:32,476 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) [2021-12-14 13:45:32,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 13:45:32,635 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 13:45:32,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:45:32,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 97 conjunts are in the unsatisfiable core [2021-12-14 13:45:32,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:45:32,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:32,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:32,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:32,670 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-14 13:45:32,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2021-12-14 13:45:32,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:32,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2021-12-14 13:45:32,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:32,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2021-12-14 13:45:32,706 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 13:45:32,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-14 13:45:32,854 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-14 13:45:32,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 34 [2021-12-14 13:45:32,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:32,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:32,863 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2021-12-14 13:45:32,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:32,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:32,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:32,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2021-12-14 13:45:32,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:32,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:32,894 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2021-12-14 13:45:32,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:32,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2021-12-14 13:45:32,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:32,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2021-12-14 13:45:32,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:32,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2021-12-14 13:45:32,931 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-14 13:45:32,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-12-14 13:45:33,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:33,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:33,101 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 13:45:33,102 INFO L388 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 1 case distinctions, treesize of input 44 treesize of output 46 [2021-12-14 13:45:33,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:33,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:33,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:33,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2021-12-14 13:45:33,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:33,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:33,132 INFO L388 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 26 treesize of output 23 [2021-12-14 13:45:33,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:33,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2021-12-14 13:45:33,161 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-14 13:45:33,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 30 [2021-12-14 13:45:33,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:33,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2021-12-14 13:45:33,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:33,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2021-12-14 13:45:33,202 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-14 13:45:33,203 INFO L388 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 7 [2021-12-14 13:45:33,350 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 13:45:33,351 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 89 [2021-12-14 13:45:33,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 38 [2021-12-14 13:45:33,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2021-12-14 13:45:33,584 INFO L354 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2021-12-14 13:45:33,584 INFO L388 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 109 treesize of output 58 [2021-12-14 13:45:33,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 31 treesize of output 19 [2021-12-14 13:45:33,619 INFO L354 Elim1Store]: treesize reduction 51, result has 46.3 percent of original size [2021-12-14 13:45:33,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 65 [2021-12-14 13:45:33,678 INFO L388 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 22 treesize of output 10 [2021-12-14 13:45:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:45:33,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:45:33,740 INFO L388 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 53 treesize of output 41 [2021-12-14 13:45:35,765 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~list~0#1.offset| Int) (v_arrayElimCell_224 Int) (v_ArrVal_1290 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 4)))) (let ((.cse1 (select |c_#memory_int| .cse0))) (or (< (select (select (store |c_#memory_int| .cse0 (store .cse1 v_arrayElimCell_224 v_ArrVal_1290)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (< 100 (select .cse1 v_arrayElimCell_224)))))) is different from false [2021-12-14 13:45:42,195 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_39| Int) (v_ArrVal_1288 Int) (v_ArrVal_1286 (Array Int Int)) (v_arrayElimCell_224 Int) (v_ArrVal_1290 Int)) (let ((.cse7 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse7))) (let ((.cse3 (select |c_#memory_int| .cse6)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse7))) (let ((.cse0 (store |c_#memory_int| .cse6 (store .cse3 .cse4 v_ArrVal_1288))) (.cse1 (select (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_1286))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (+ |v_ULTIMATE.start_main_~list~0#1.offset_39| 4)))) (let ((.cse2 (select .cse0 .cse1))) (or (< (select (select (store .cse0 .cse1 (store .cse2 v_arrayElimCell_224 v_ArrVal_1290)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (< 100 (select .cse2 v_arrayElimCell_224)) (< v_ArrVal_1288 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (select .cse3 .cse4))) (<= 110 (select (select .cse0 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))))))))) is different from false [2021-12-14 13:45:42,255 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_39| Int) (v_ArrVal_1288 Int) (v_ArrVal_1286 (Array Int Int)) (v_arrayElimCell_224 Int) (v_ArrVal_1290 Int)) (let ((.cse7 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse7))) (let ((.cse3 (select |c_#memory_int| .cse6)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse7))) (let ((.cse0 (store |c_#memory_int| .cse6 (store .cse3 .cse4 v_ArrVal_1288))) (.cse1 (select (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_1286))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (+ |v_ULTIMATE.start_main_~list~0#1.offset_39| 4)))) (let ((.cse2 (select .cse0 .cse1))) (or (< (select (select (store .cse0 .cse1 (store .cse2 v_arrayElimCell_224 v_ArrVal_1290)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (< 100 (select .cse2 v_arrayElimCell_224)) (<= 110 (select (select .cse0 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (< v_ArrVal_1288 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse3 .cse4)))))))))) is different from false [2021-12-14 13:45:42,962 INFO L354 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-12-14 13:45:42,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 2177 treesize of output 1993 [2021-12-14 13:45:44,170 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1277 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1285 (Array Int Int)) (v_arrayElimCell_224 Int) (v_ArrVal_1262 (Array Int Int)) (v_ArrVal_1290 Int) (v_ArrVal_1282 Int) (v_ArrVal_1271 Int) (v_ArrVal_1284 Int) (v_ArrVal_1283 Int) (|v_ULTIMATE.start_main_~list~0#1.offset_39| Int) (v_ArrVal_1261 Int) (v_ArrVal_1263 Int) (|v_ULTIMATE.start_main_~n~0#1.offset_14| Int) (v_ArrVal_1288 Int) (v_ArrVal_1259 Int) (|v_ULTIMATE.start_main_~n~0#1.base_15| Int)) (let ((.cse10 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse7 (let ((.cse15 (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_15| v_ArrVal_1258) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_15| v_ArrVal_1256) |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 v_ArrVal_1259)))) (store (store .cse15 v_ArrVal_1284 v_ArrVal_1277) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store .cse15 v_ArrVal_1284 v_ArrVal_1274) |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 v_ArrVal_1284)))) (.cse12 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse2 (let ((.cse13 (store (let ((.cse14 (store |c_#memory_int| |v_ULTIMATE.start_main_~n~0#1.base_15| v_ArrVal_1262))) (store .cse14 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 v_ArrVal_1263))) v_ArrVal_1284 v_ArrVal_1278))) (store .cse13 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 v_ArrVal_1282)))) (.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) .cse12))) (let ((.cse0 (select .cse2 .cse8)) (.cse1 (select (select (let ((.cse9 (let ((.cse11 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_15| v_arrayElimArr_21))) (store .cse11 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 v_ArrVal_1271))))) (store (store .cse9 v_ArrVal_1284 v_ArrVal_1285) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store .cse9 v_ArrVal_1284 v_ArrVal_1276) |c_ULTIMATE.start_main_~list~0#1.base|) .cse10 v_ArrVal_1283))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse12))) (let ((.cse3 (store .cse2 .cse8 (store .cse0 .cse1 v_ArrVal_1288))) (.cse4 (select (let ((.cse6 (store .cse7 .cse8 v_ArrVal_1286))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (+ |v_ULTIMATE.start_main_~list~0#1.offset_39| 4)))) (let ((.cse5 (select .cse3 .cse4))) (or (< v_ArrVal_1288 (+ (select .cse0 .cse1) (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (< (select (select (store .cse3 .cse4 (store .cse5 v_arrayElimCell_224 v_ArrVal_1290)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_21 (+ |v_ULTIMATE.start_main_~n~0#1.offset_14| 4)))) (<= 110 (select (select .cse3 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (< 100 (select .cse5 v_arrayElimCell_224)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_15| v_ArrVal_1261) v_ArrVal_1284) 0)) (not (= (select v_arrayElimArr_21 (+ |v_ULTIMATE.start_main_~n~0#1.offset_14| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_15|) 0)))))))))) is different from false [2021-12-14 13:45:46,339 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-14 13:45:46,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983503003] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:45:46,340 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:45:46,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 31 [2021-12-14 13:45:46,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465976672] [2021-12-14 13:45:46,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:45:46,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-14 13:45:46,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:45:46,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-14 13:45:46,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=598, Unknown=6, NotChecked=212, Total=930 [2021-12-14 13:45:46,341 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 31 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)