./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array2_pattern.c --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/array-patterns/array2_pattern.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a25becec148beba97bef86c2a84619bb26dfafe7c127e8d70246837f0d2d470 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 11:30:35,584 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 11:30:35,585 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 11:30:35,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 11:30:35,644 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 11:30:35,646 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 11:30:35,647 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 11:30:35,649 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 11:30:35,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 11:30:35,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 11:30:35,654 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 11:30:35,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 11:30:35,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 11:30:35,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 11:30:35,658 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 11:30:35,660 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 11:30:35,662 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 11:30:35,662 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 11:30:35,664 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 11:30:35,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 11:30:35,669 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 11:30:35,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 11:30:35,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 11:30:35,671 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 11:30:35,676 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 11:30:35,676 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 11:30:35,676 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 11:30:35,677 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 11:30:35,678 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 11:30:35,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 11:30:35,678 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 11:30:35,679 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 11:30:35,680 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 11:30:35,681 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 11:30:35,682 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 11:30:35,682 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 11:30:35,682 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 11:30:35,682 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 11:30:35,682 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 11:30:35,684 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 11:30:35,684 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 11:30:35,685 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 11:30:35,708 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 11:30:35,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 11:30:35,709 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 11:30:35,709 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 11:30:35,709 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 11:30:35,710 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 11:30:35,710 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 11:30:35,710 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 11:30:35,710 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 11:30:35,710 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 11:30:35,711 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 11:30:35,711 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 11:30:35,711 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 11:30:35,711 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 11:30:35,712 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 11:30:35,712 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 11:30:35,712 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 11:30:35,712 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 11:30:35,712 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 11:30:35,712 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 11:30:35,712 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 11:30:35,713 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 11:30:35,713 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 11:30:35,713 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 11:30:35,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:30:35,713 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 11:30:35,713 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 11:30:35,714 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 11:30:35,714 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 11:30:35,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 11:30:35,714 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 11:30:35,715 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 11:30:35,715 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 11:30:35,715 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 11:30:35,715 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 -> 1a25becec148beba97bef86c2a84619bb26dfafe7c127e8d70246837f0d2d470 [2021-12-14 11:30:35,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 11:30:35,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 11:30:35,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 11:30:35,915 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 11:30:35,916 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 11:30:35,916 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array2_pattern.c [2021-12-14 11:30:35,982 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a31437a9f/c75a3ce373ed409694f55d2fa84e5f2a/FLAG96ed54a50 [2021-12-14 11:30:36,320 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 11:30:36,321 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array2_pattern.c [2021-12-14 11:30:36,329 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a31437a9f/c75a3ce373ed409694f55d2fa84e5f2a/FLAG96ed54a50 [2021-12-14 11:30:36,343 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a31437a9f/c75a3ce373ed409694f55d2fa84e5f2a [2021-12-14 11:30:36,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 11:30:36,347 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 11:30:36,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 11:30:36,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 11:30:36,352 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 11:30:36,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:30:36" (1/1) ... [2021-12-14 11:30:36,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3706a288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:30:36, skipping insertion in model container [2021-12-14 11:30:36,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:30:36" (1/1) ... [2021-12-14 11:30:36,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 11:30:36,370 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 11:30:36,536 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array2_pattern.c[1322,1335] [2021-12-14 11:30:36,572 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:30:36,578 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 11:30:36,588 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array2_pattern.c[1322,1335] [2021-12-14 11:30:36,598 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:30:36,607 INFO L208 MainTranslator]: Completed translation [2021-12-14 11:30:36,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:30:36 WrapperNode [2021-12-14 11:30:36,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 11:30:36,609 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 11:30:36,609 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 11:30:36,609 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 11:30:36,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:30:36" (1/1) ... [2021-12-14 11:30:36,624 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:30:36" (1/1) ... [2021-12-14 11:30:36,648 INFO L137 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80 [2021-12-14 11:30:36,648 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 11:30:36,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 11:30:36,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 11:30:36,649 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 11:30:36,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:30:36" (1/1) ... [2021-12-14 11:30:36,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:30:36" (1/1) ... [2021-12-14 11:30:36,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:30:36" (1/1) ... [2021-12-14 11:30:36,661 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:30:36" (1/1) ... [2021-12-14 11:30:36,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:30:36" (1/1) ... [2021-12-14 11:30:36,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:30:36" (1/1) ... [2021-12-14 11:30:36,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:30:36" (1/1) ... [2021-12-14 11:30:36,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 11:30:36,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 11:30:36,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 11:30:36,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 11:30:36,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:30:36" (1/1) ... [2021-12-14 11:30:36,687 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:30:36,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:30:36,720 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 11:30:36,744 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 11:30:36,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 11:30:36,762 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-14 11:30:36,762 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-14 11:30:36,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 11:30:36,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 11:30:36,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 11:30:36,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 11:30:36,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 11:30:36,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 11:30:36,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 11:30:36,814 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 11:30:36,815 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 11:30:36,944 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 11:30:36,948 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 11:30:36,948 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-14 11:30:36,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:30:36 BoogieIcfgContainer [2021-12-14 11:30:36,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 11:30:36,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 11:30:36,950 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 11:30:36,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 11:30:36,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:30:36" (1/3) ... [2021-12-14 11:30:36,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67aecc7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:30:36, skipping insertion in model container [2021-12-14 11:30:36,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:30:36" (2/3) ... [2021-12-14 11:30:36,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67aecc7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:30:36, skipping insertion in model container [2021-12-14 11:30:36,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:30:36" (3/3) ... [2021-12-14 11:30:36,954 INFO L111 eAbstractionObserver]: Analyzing ICFG array2_pattern.c [2021-12-14 11:30:36,969 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 11:30:36,969 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 11:30:36,996 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 11:30:37,000 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 11:30:37,001 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 11:30:37,010 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:30:37,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-14 11:30:37,013 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:30:37,013 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:30:37,014 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:30:37,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:30:37,033 INFO L85 PathProgramCache]: Analyzing trace with hash -800294020, now seen corresponding path program 1 times [2021-12-14 11:30:37,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:30:37,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112096072] [2021-12-14 11:30:37,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:30:37,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:30:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:30:37,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 11:30:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:30:37,164 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 11:30:37,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:30:37,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112096072] [2021-12-14 11:30:37,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112096072] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:30:37,166 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:30:37,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 11:30:37,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384250639] [2021-12-14 11:30:37,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:30:37,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 11:30:37,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:30:37,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 11:30:37,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 11:30:37,192 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:30:37,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:30:37,206 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2021-12-14 11:30:37,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 11:30:37,207 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-12-14 11:30:37,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:30:37,211 INFO L225 Difference]: With dead ends: 47 [2021-12-14 11:30:37,211 INFO L226 Difference]: Without dead ends: 21 [2021-12-14 11:30:37,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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 11:30:37,220 INFO L933 BasicCegarLoop]: 28 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, 28 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 11:30:37,221 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:30:37,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-12-14 11:30:37,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-12-14 11:30:37,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:30:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2021-12-14 11:30:37,243 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 15 [2021-12-14 11:30:37,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:30:37,244 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2021-12-14 11:30:37,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:30:37,244 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2021-12-14 11:30:37,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 11:30:37,252 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:30:37,252 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:30:37,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 11:30:37,253 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:30:37,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:30:37,256 INFO L85 PathProgramCache]: Analyzing trace with hash -952637313, now seen corresponding path program 1 times [2021-12-14 11:30:37,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:30:37,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204727662] [2021-12-14 11:30:37,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:30:37,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:30:37,278 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 11:30:37,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1032679684] [2021-12-14 11:30:37,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:30:37,282 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:30:37,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:30:37,283 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 11:30:37,284 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 11:30:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:30:37,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 11:30:37,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:30:37,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 11:30:37,481 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:30:37,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:30:37,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204727662] [2021-12-14 11:30:37,482 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 11:30:37,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032679684] [2021-12-14 11:30:37,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032679684] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:30:37,489 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:30:37,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 11:30:37,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865098104] [2021-12-14 11:30:37,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:30:37,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:30:37,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:30:37,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:30:37,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 11:30:37,493 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:30:37,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:30:37,521 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2021-12-14 11:30:37,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 11:30:37,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2021-12-14 11:30:37,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:30:37,526 INFO L225 Difference]: With dead ends: 26 [2021-12-14 11:30:37,526 INFO L226 Difference]: Without dead ends: 22 [2021-12-14 11:30:37,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:30:37,529 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:30:37,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 54 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:30:37,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-12-14 11:30:37,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-12-14 11:30:37,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:30:37,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2021-12-14 11:30:37,539 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 22 [2021-12-14 11:30:37,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:30:37,540 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2021-12-14 11:30:37,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:30:37,541 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2021-12-14 11:30:37,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 11:30:37,542 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:30:37,542 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:30:37,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-14 11:30:37,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:30:37,761 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:30:37,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:30:37,762 INFO L85 PathProgramCache]: Analyzing trace with hash -603190335, now seen corresponding path program 1 times [2021-12-14 11:30:37,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:30:37,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959287973] [2021-12-14 11:30:37,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:30:37,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:30:37,784 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 11:30:37,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1780717587] [2021-12-14 11:30:37,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:30:37,787 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:30:37,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:30:37,788 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 11:30:37,789 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 11:30:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:30:37,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 11:30:37,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:30:37,912 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:30:37,912 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:30:37,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:30:37,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959287973] [2021-12-14 11:30:37,913 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 11:30:37,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780717587] [2021-12-14 11:30:37,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780717587] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:30:37,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:30:37,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 11:30:37,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253165085] [2021-12-14 11:30:37,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:30:37,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 11:30:37,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:30:37,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 11:30:37,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:30:37,915 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:30:37,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:30:37,955 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2021-12-14 11:30:37,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 11:30:37,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2021-12-14 11:30:37,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:30:37,956 INFO L225 Difference]: With dead ends: 41 [2021-12-14 11:30:37,956 INFO L226 Difference]: Without dead ends: 25 [2021-12-14 11:30:37,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:30:37,957 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 9 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:30:37,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 59 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:30:37,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-14 11:30:37,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2021-12-14 11:30:37,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:30:37,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2021-12-14 11:30:37,960 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 24 [2021-12-14 11:30:37,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:30:37,961 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2021-12-14 11:30:37,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:30:37,961 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2021-12-14 11:30:37,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 11:30:37,962 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:30:37,962 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:30:37,977 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 11:30:38,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-12-14 11:30:38,177 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:30:38,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:30:38,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1366149955, now seen corresponding path program 1 times [2021-12-14 11:30:38,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:30:38,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914783564] [2021-12-14 11:30:38,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:30:38,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:30:38,205 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 11:30:38,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1750368464] [2021-12-14 11:30:38,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:30:38,219 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:30:38,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:30:38,222 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 11:30:38,223 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 11:30:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:30:38,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-14 11:30:38,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:30:38,317 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 10 treesize of output 8 [2021-12-14 11:30:38,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:30:38,391 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 27 treesize of output 31 [2021-12-14 11:30:38,398 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 28 treesize of output 28 [2021-12-14 11:30:38,404 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 12 treesize of output 11 [2021-12-14 11:30:38,413 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 12 treesize of output 11 [2021-12-14 11:30:38,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:30:38,830 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 169 treesize of output 160 [2021-12-14 11:30:38,837 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 160 treesize of output 152 [2021-12-14 11:30:38,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:30:38,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:30:38,847 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 11:30:38,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 136 [2021-12-14 11:30:38,857 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 11:30:38,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2021-12-14 11:30:38,883 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-14 11:30:38,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:30:38,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 82 treesize of output 42 [2021-12-14 11:30:39,083 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 11:30:39,084 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 11:30:39,085 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 14 [2021-12-14 11:30:39,106 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:30:39,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:30:39,283 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ (* |c_ULTIMATE.start_main_~index~0#1| 4294967295) 4294967295 c_~ARR_SIZE~0) 4294967296))) (and (or (forall ((v_ArrVal_105 (Array Int Int)) (v_ArrVal_109 (Array Int Int))) (= (let ((.cse0 (let ((.cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| (- 17179869184) (* (mod (+ (* |c_ULTIMATE.start_main_~index~0#1| 4294967295) 4294967295 c_~ARR_SIZE~0) 4294967296) 4)))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse3 (+ (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~index~0#1|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_105) |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse3)))))) (+ (select .cse0 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |c_ULTIMATE.start_main_~index~0#1| 4)))) (store .cse1 .cse2 (+ (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~index~0#1|) (select .cse1 .cse2))))) |c_ULTIMATE.start_main_~#array2~0#1.base| .cse0) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1|)) 0)) (<= .cse4 2147483647)) (or (forall ((v_ArrVal_105 (Array Int Int)) (v_ArrVal_109 (Array Int Int))) (= (let ((.cse5 (let ((.cse8 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| (* (mod (+ (* |c_ULTIMATE.start_main_~index~0#1| 4294967295) 4294967295 c_~ARR_SIZE~0) 4294967296) 4)))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse8 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_105) |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse8) (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~index~0#1|)))))) (+ (select .cse5 |c_ULTIMATE.start_main_~#array2~0#1.offset|) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse7 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| (* |c_ULTIMATE.start_main_~index~0#1| 4)))) (store .cse6 .cse7 (+ (* |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~index~0#1|) (select .cse6 .cse7))))) |c_ULTIMATE.start_main_~#array2~0#1.base| .cse5) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) |c_ULTIMATE.start_main_~sum~0#1|)) 0)) (< 2147483647 .cse4)))) is different from false [2021-12-14 11:30:44,830 WARN L228 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2021-12-14 11:30:44,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:30:44,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914783564] [2021-12-14 11:30:44,830 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 11:30:44,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750368464] [2021-12-14 11:30:44,831 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2021-12-14 11:30:44,831 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:30:44,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-12-14 11:30:44,831 ERROR L172 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2021-12-14 11:30:44,831 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-12-14 11:30:44,835 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 11:30:44,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2021-12-14 11:30:44,855 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 11:30:45,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:30:45,046 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2021-12-14 11:30:45,048 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 11:30:45,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 11:30:45 BoogieIcfgContainer [2021-12-14 11:30:45,058 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 11:30:45,059 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 11:30:45,059 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 11:30:45,059 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 11:30:45,060 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:30:36" (3/4) ... [2021-12-14 11:30:45,062 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-14 11:30:45,062 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 11:30:45,062 INFO L158 Benchmark]: Toolchain (without parser) took 8715.96ms. Allocated memory was 115.3MB in the beginning and 144.7MB in the end (delta: 29.4MB). Free memory was 84.3MB in the beginning and 79.8MB in the end (delta: 4.5MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. [2021-12-14 11:30:45,063 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 81.8MB. Free memory is still 41.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 11:30:45,063 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.43ms. Allocated memory is still 115.3MB. Free memory was 84.1MB in the beginning and 90.8MB in the end (delta: -6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 11:30:45,063 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.57ms. Allocated memory is still 115.3MB. Free memory was 90.8MB in the beginning and 89.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 11:30:45,063 INFO L158 Benchmark]: Boogie Preprocessor took 27.96ms. Allocated memory is still 115.3MB. Free memory was 89.2MB in the beginning and 88.2MB in the end (delta: 933.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 11:30:45,064 INFO L158 Benchmark]: RCFGBuilder took 271.77ms. Allocated memory is still 115.3MB. Free memory was 87.8MB in the beginning and 77.4MB in the end (delta: 10.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-14 11:30:45,064 INFO L158 Benchmark]: TraceAbstraction took 8108.76ms. Allocated memory was 115.3MB in the beginning and 144.7MB in the end (delta: 29.4MB). Free memory was 77.0MB in the beginning and 79.8MB in the end (delta: -2.8MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2021-12-14 11:30:45,064 INFO L158 Benchmark]: Witness Printer took 3.17ms. Allocated memory is still 144.7MB. Free memory is still 79.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 11:30:45,065 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 81.8MB. Free memory is still 41.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.43ms. Allocated memory is still 115.3MB. Free memory was 84.1MB in the beginning and 90.8MB in the end (delta: -6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.57ms. Allocated memory is still 115.3MB. Free memory was 90.8MB in the beginning and 89.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.96ms. Allocated memory is still 115.3MB. Free memory was 89.2MB in the beginning and 88.2MB in the end (delta: 933.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 271.77ms. Allocated memory is still 115.3MB. Free memory was 87.8MB in the beginning and 77.4MB in the end (delta: 10.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8108.76ms. Allocated memory was 115.3MB in the beginning and 144.7MB in the end (delta: 29.4MB). Free memory was 77.0MB in the beginning and 79.8MB in the end (delta: -2.8MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. * Witness Printer took 3.17ms. Allocated memory is still 144.7MB. Free memory is still 79.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 30]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L34] signed long long ARR_SIZE ; [L38] ARR_SIZE = (signed long long)__VERIFIER_nondet_short() [L39] CALL assume_abort_if_not(ARR_SIZE > 0) [L28] COND FALSE !(!cond) [L39] RET assume_abort_if_not(ARR_SIZE > 0) [L41] int array1[ARR_SIZE] ; [L42] int array2[ARR_SIZE] ; [L43] int count = 0, num = -1 ; [L44] short index ; [L45] int temp ; [L46] signed long long sum = 0 ; [L48] count=0 [L48] COND TRUE count=0 && index < ARR_SIZE) [L28] COND FALSE !(!cond) [L58] RET assume_abort_if_not(index>=0 && index < ARR_SIZE) [L60] EXPR array1[index] [L60] array1[index] = array1[index] + (num*num*index) [L61] EXPR array2[ARR_SIZE-1-index] [L61] array2[ARR_SIZE-1-index] = array2[ARR_SIZE-1-index] + (num * index) [L63] temp = __VERIFIER_nondet_int() [L64] COND TRUE temp == 0 [L67] count=0 [L67] COND TRUE count 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 -> 1a25becec148beba97bef86c2a84619bb26dfafe7c127e8d70246837f0d2d470 [2021-12-14 11:30:47,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 11:30:47,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 11:30:47,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 11:30:47,091 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 11:30:47,092 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 11:30:47,094 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array2_pattern.c [2021-12-14 11:30:47,138 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea2171af2/40d6f7fd84ac420e8eaee0bd716e5155/FLAGf32bac45c [2021-12-14 11:30:47,524 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 11:30:47,525 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array2_pattern.c [2021-12-14 11:30:47,530 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea2171af2/40d6f7fd84ac420e8eaee0bd716e5155/FLAGf32bac45c [2021-12-14 11:30:47,542 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea2171af2/40d6f7fd84ac420e8eaee0bd716e5155 [2021-12-14 11:30:47,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 11:30:47,545 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 11:30:47,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 11:30:47,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 11:30:47,552 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 11:30:47,552 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:30:47" (1/1) ... [2021-12-14 11:30:47,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54148116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:30:47, skipping insertion in model container [2021-12-14 11:30:47,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:30:47" (1/1) ... [2021-12-14 11:30:47,560 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 11:30:47,577 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 11:30:47,739 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array2_pattern.c[1322,1335] [2021-12-14 11:30:47,796 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:30:47,821 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 11:30:47,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array2_pattern.c[1322,1335] [2021-12-14 11:30:47,870 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:30:47,887 INFO L208 MainTranslator]: Completed translation [2021-12-14 11:30:47,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:30:47 WrapperNode [2021-12-14 11:30:47,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 11:30:47,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 11:30:47,890 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 11:30:47,890 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 11:30:47,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:30:47" (1/1) ... [2021-12-14 11:30:47,909 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:30:47" (1/1) ... [2021-12-14 11:30:47,931 INFO L137 Inliner]: procedures = 18, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 77 [2021-12-14 11:30:47,932 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 11:30:47,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 11:30:47,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 11:30:47,933 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 11:30:47,940 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:30:47" (1/1) ... [2021-12-14 11:30:47,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:30:47" (1/1) ... [2021-12-14 11:30:47,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:30:47" (1/1) ... [2021-12-14 11:30:47,948 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:30:47" (1/1) ... [2021-12-14 11:30:47,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:30:47" (1/1) ... [2021-12-14 11:30:47,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:30:47" (1/1) ... [2021-12-14 11:30:47,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:30:47" (1/1) ... [2021-12-14 11:30:47,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 11:30:47,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 11:30:47,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 11:30:47,980 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 11:30:47,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:30:47" (1/1) ... [2021-12-14 11:30:47,986 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:30:47,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:30:48,032 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 11:30:48,072 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 11:30:48,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 11:30:48,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-14 11:30:48,094 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-14 11:30:48,094 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-14 11:30:48,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 11:30:48,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-14 11:30:48,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 11:30:48,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 11:30:48,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 11:30:48,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-14 11:30:48,198 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 11:30:48,199 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 11:30:48,330 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 11:30:48,334 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 11:30:48,334 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-14 11:30:48,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:30:48 BoogieIcfgContainer [2021-12-14 11:30:48,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 11:30:48,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 11:30:48,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 11:30:48,338 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 11:30:48,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:30:47" (1/3) ... [2021-12-14 11:30:48,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d6681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:30:48, skipping insertion in model container [2021-12-14 11:30:48,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:30:47" (2/3) ... [2021-12-14 11:30:48,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d6681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:30:48, skipping insertion in model container [2021-12-14 11:30:48,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:30:48" (3/3) ... [2021-12-14 11:30:48,340 INFO L111 eAbstractionObserver]: Analyzing ICFG array2_pattern.c [2021-12-14 11:30:48,350 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 11:30:48,350 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 11:30:48,377 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 11:30:48,381 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 11:30:48,382 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 11:30:48,391 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:30:48,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-14 11:30:48,394 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:30:48,394 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:30:48,395 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:30:48,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:30:48,398 INFO L85 PathProgramCache]: Analyzing trace with hash -800294020, now seen corresponding path program 1 times [2021-12-14 11:30:48,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:30:48,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597112079] [2021-12-14 11:30:48,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:30:48,406 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:30:48,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:30:48,437 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:30:48,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-14 11:30:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:30:48,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-14 11:30:48,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:30:48,574 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 11:30:48,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:30:48,575 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:30:48,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597112079] [2021-12-14 11:30:48,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597112079] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:30:48,576 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:30:48,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 11:30:48,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063050396] [2021-12-14 11:30:48,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:30:48,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 11:30:48,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:30:48,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 11:30:48,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 11:30:48,618 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:30:48,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:30:48,634 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2021-12-14 11:30:48,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 11:30:48,636 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-12-14 11:30:48,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:30:48,643 INFO L225 Difference]: With dead ends: 47 [2021-12-14 11:30:48,643 INFO L226 Difference]: Without dead ends: 21 [2021-12-14 11:30:48,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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 11:30:48,652 INFO L933 BasicCegarLoop]: 28 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, 28 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 11:30:48,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:30:48,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-12-14 11:30:48,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-12-14 11:30:48,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:30:48,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2021-12-14 11:30:48,686 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 15 [2021-12-14 11:30:48,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:30:48,686 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2021-12-14 11:30:48,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:30:48,687 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2021-12-14 11:30:48,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 11:30:48,689 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:30:48,689 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:30:48,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-14 11:30:48,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:30:48,896 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:30:48,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:30:48,897 INFO L85 PathProgramCache]: Analyzing trace with hash -952637313, now seen corresponding path program 1 times [2021-12-14 11:30:48,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:30:48,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [606419591] [2021-12-14 11:30:48,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:30:48,898 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:30:48,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:30:48,899 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:30:48,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-14 11:30:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:30:48,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 11:30:48,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:30:49,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 11:30:49,058 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:30:49,058 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:30:49,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [606419591] [2021-12-14 11:30:49,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [606419591] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:30:49,059 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:30:49,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 11:30:49,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893971815] [2021-12-14 11:30:49,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:30:49,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:30:49,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:30:49,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:30:49,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 11:30:49,061 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:30:49,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:30:49,086 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2021-12-14 11:30:49,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 11:30:49,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2021-12-14 11:30:49,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:30:49,088 INFO L225 Difference]: With dead ends: 26 [2021-12-14 11:30:49,088 INFO L226 Difference]: Without dead ends: 22 [2021-12-14 11:30:49,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:30:49,089 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:30:49,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 54 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:30:49,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-12-14 11:30:49,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-12-14 11:30:49,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:30:49,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2021-12-14 11:30:49,093 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 22 [2021-12-14 11:30:49,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:30:49,094 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2021-12-14 11:30:49,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:30:49,095 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2021-12-14 11:30:49,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 11:30:49,095 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:30:49,095 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:30:49,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-14 11:30:49,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:30:49,303 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:30:49,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:30:49,304 INFO L85 PathProgramCache]: Analyzing trace with hash -603190335, now seen corresponding path program 1 times [2021-12-14 11:30:49,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:30:49,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85387828] [2021-12-14 11:30:49,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:30:49,305 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:30:49,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:30:49,306 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:30:49,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-14 11:30:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:30:49,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 11:30:49,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:30:49,574 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 11:30:49,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:30:49,575 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:30:49,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [85387828] [2021-12-14 11:30:49,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [85387828] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:30:49,575 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:30:49,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 11:30:49,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044283578] [2021-12-14 11:30:49,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:30:49,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 11:30:49,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:30:49,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 11:30:49,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:30:49,577 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:30:49,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:30:49,582 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2021-12-14 11:30:49,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 11:30:49,582 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2021-12-14 11:30:49,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:30:49,583 INFO L225 Difference]: With dead ends: 43 [2021-12-14 11:30:49,583 INFO L226 Difference]: Without dead ends: 27 [2021-12-14 11:30:49,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:30:49,584 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:30:49,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 64 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 35 Unchecked, 0.0s Time] [2021-12-14 11:30:49,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-14 11:30:49,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-12-14 11:30:49,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:30:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2021-12-14 11:30:49,595 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2021-12-14 11:30:49,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:30:49,596 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2021-12-14 11:30:49,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:30:49,596 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2021-12-14 11:30:49,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 11:30:49,596 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:30:49,597 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:30:49,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-14 11:30:49,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:30:49,804 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:30:49,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:30:49,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1366149955, now seen corresponding path program 1 times [2021-12-14 11:30:49,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:30:49,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1359018668] [2021-12-14 11:30:49,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:30:49,805 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:30:49,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:30:49,813 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:30:49,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-14 11:30:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:30:49,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-14 11:30:49,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:30:50,053 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 18 treesize of output 16 [2021-12-14 11:30:50,160 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 39 treesize of output 23 [2021-12-14 11:30:51,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:30:51,032 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 82 treesize of output 77 [2021-12-14 11:30:51,051 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 73 treesize of output 69 [2021-12-14 11:30:51,065 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 11:30:51,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2021-12-14 11:30:51,078 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 11:30:51,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2021-12-14 11:30:51,510 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 11:30:51,511 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 11:30:51,515 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 18 [2021-12-14 11:30:51,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:30:51,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:30:51,974 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_62 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 64) (let ((.cse3 ((_ sign_extend 16) |c_ULTIMATE.start_main_~index~0#1|))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse5 (bvadd (bvmul .cse3 (_ bv4 32)) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (store .cse4 .cse5 (bvadd (bvmul .cse3 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (select .cse4 .cse5))))))) (let ((.cse0 (let ((.cse2 (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) .cse3)) c_~ARR_SIZE~0 (_ bv18446744073709551615 64))) (_ bv4 32)) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_62) |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse2 (bvadd (select (select .cse1 |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse2) (bvmul .cse3 |c_ULTIMATE.start_main_~num~0#1|)))))) (bvadd ((_ sign_extend 32) (select .cse0 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) |c_ULTIMATE.start_main_~sum~0#1| ((_ sign_extend 32) (select (select (store .cse1 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse0) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)))))))) is different from false [2021-12-14 11:30:52,816 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:30:52,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1359018668] [2021-12-14 11:30:52,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1359018668] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:30:52,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [451083817] [2021-12-14 11:30:52,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:30:52,817 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-14 11:30:52,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-14 11:30:52,818 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-14 11:30:52,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2021-12-14 11:30:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:30:53,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-14 11:30:53,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:30:53,111 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 18 treesize of output 16 [2021-12-14 11:30:53,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:30:53,210 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 27 treesize of output 31 [2021-12-14 11:30:53,217 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 28 treesize of output 28 [2021-12-14 11:30:53,223 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 12 treesize of output 11 [2021-12-14 11:30:53,231 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 12 treesize of output 11 [2021-12-14 11:30:53,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:30:53,666 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 82 treesize of output 77 [2021-12-14 11:30:53,672 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 73 treesize of output 69 [2021-12-14 11:30:53,682 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 11:30:53,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2021-12-14 11:30:53,695 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 11:30:53,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2021-12-14 11:30:53,986 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 11:30:53,988 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 11:30:53,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, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 18 [2021-12-14 11:30:54,009 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:30:54,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:30:54,191 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_92 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_98 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 64) (let ((.cse2 ((_ sign_extend 16) |c_ULTIMATE.start_main_~index~0#1|))) (let ((.cse3 (let ((.cse4 (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) .cse2)) c_~ARR_SIZE~0 (_ bv18446744073709551615 64))) (_ bv4 32)) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_92) |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse4 (bvadd (bvmul .cse2 |c_ULTIMATE.start_main_~num~0#1|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_98) |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse4)))))) (bvadd |c_ULTIMATE.start_main_~sum~0#1| ((_ sign_extend 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse1 (bvadd (bvmul .cse2 (_ bv4 32)) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (store .cse0 .cse1 (bvadd (bvmul .cse2 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (select .cse0 .cse1))))) |c_ULTIMATE.start_main_~#array2~0#1.base| .cse3) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) ((_ sign_extend 32) (select .cse3 |c_ULTIMATE.start_main_~#array2~0#1.offset|))))))) is different from false [2021-12-14 11:30:57,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [451083817] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:30:57,128 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:30:57,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 20 [2021-12-14 11:30:57,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685867351] [2021-12-14 11:30:57,128 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:30:57,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-14 11:30:57,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:30:57,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-14 11:30:57,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=483, Unknown=7, NotChecked=94, Total=702 [2021-12-14 11:30:57,130 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 17 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 11:30:57,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:30:57,480 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2021-12-14 11:30:57,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 11:30:57,481 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 17 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2021-12-14 11:30:57,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:30:57,483 INFO L225 Difference]: With dead ends: 46 [2021-12-14 11:30:57,483 INFO L226 Difference]: Without dead ends: 42 [2021-12-14 11:30:57,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=136, Invalid=515, Unknown=7, NotChecked=98, Total=756 [2021-12-14 11:30:57,484 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:30:57,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 125 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 38 Unchecked, 0.1s Time] [2021-12-14 11:30:57,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-14 11:30:57,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2021-12-14 11:30:57,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 11:30:57,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2021-12-14 11:30:57,490 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 26 [2021-12-14 11:30:57,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:30:57,491 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2021-12-14 11:30:57,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 17 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 11:30:57,491 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2021-12-14 11:30:57,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 11:30:57,492 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:30:57,492 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:30:57,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-14 11:30:57,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2021-12-14 11:30:57,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-14 11:30:57,901 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:30:57,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:30:57,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1336652411, now seen corresponding path program 2 times [2021-12-14 11:30:57,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:30:57,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323291870] [2021-12-14 11:30:57,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 11:30:57,902 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:30:57,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:30:57,903 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:30:57,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-14 11:30:57,978 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 11:30:57,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:30:57,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 11:30:57,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:30:58,263 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:30:58,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:30:58,635 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 11:30:58,635 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:30:58,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1323291870] [2021-12-14 11:30:58,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1323291870] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:30:58,635 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:30:58,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2021-12-14 11:30:58,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922948567] [2021-12-14 11:30:58,636 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:30:58,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-14 11:30:58,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:30:58,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-14 11:30:58,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2021-12-14 11:30:58,637 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 11:30:59,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:30:59,150 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2021-12-14 11:30:59,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-14 11:30:59,152 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 28 [2021-12-14 11:30:59,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:30:59,153 INFO L225 Difference]: With dead ends: 53 [2021-12-14 11:30:59,153 INFO L226 Difference]: Without dead ends: 35 [2021-12-14 11:30:59,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2021-12-14 11:30:59,154 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 43 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 11:30:59,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 140 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 60 Invalid, 0 Unknown, 77 Unchecked, 0.3s Time] [2021-12-14 11:30:59,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-14 11:30:59,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2021-12-14 11:30:59,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:30:59,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2021-12-14 11:30:59,174 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 28 [2021-12-14 11:30:59,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:30:59,174 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2021-12-14 11:30:59,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 11:30:59,175 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2021-12-14 11:30:59,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 11:30:59,175 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:30:59,176 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:30:59,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-14 11:30:59,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:30:59,392 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:30:59,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:30:59,393 INFO L85 PathProgramCache]: Analyzing trace with hash -178408891, now seen corresponding path program 3 times [2021-12-14 11:30:59,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:30:59,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295967721] [2021-12-14 11:30:59,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 11:30:59,393 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:30:59,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:30:59,394 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:30:59,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-14 11:30:59,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-14 11:30:59,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:30:59,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 11:30:59,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:30:59,935 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:30:59,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:31:00,180 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 11:31:00,180 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:31:00,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295967721] [2021-12-14 11:31:00,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295967721] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:31:00,181 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:31:00,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2021-12-14 11:31:00,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879718554] [2021-12-14 11:31:00,181 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:31:00,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-14 11:31:00,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:31:00,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-14 11:31:00,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2021-12-14 11:31:00,183 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 11:31:00,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:31:00,336 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2021-12-14 11:31:00,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 11:31:00,337 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 28 [2021-12-14 11:31:00,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:31:00,338 INFO L225 Difference]: With dead ends: 49 [2021-12-14 11:31:00,338 INFO L226 Difference]: Without dead ends: 45 [2021-12-14 11:31:00,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2021-12-14 11:31:00,338 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 31 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:31:00,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 93 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 35 Unchecked, 0.0s Time] [2021-12-14 11:31:00,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-12-14 11:31:00,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2021-12-14 11:31:00,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:31:00,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2021-12-14 11:31:00,343 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 28 [2021-12-14 11:31:00,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:31:00,343 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2021-12-14 11:31:00,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 15 states have internal predecessors, (41), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 11:31:00,343 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2021-12-14 11:31:00,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 11:31:00,344 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:31:00,344 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:31:00,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-14 11:31:00,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:31:00,551 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:31:00,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:31:00,552 INFO L85 PathProgramCache]: Analyzing trace with hash 400980999, now seen corresponding path program 4 times [2021-12-14 11:31:00,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:31:00,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793586916] [2021-12-14 11:31:00,552 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-14 11:31:00,552 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:31:00,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:31:00,553 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:31:00,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-14 11:31:00,682 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-14 11:31:00,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:31:00,690 WARN L261 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-14 11:31:00,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:31:00,785 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 18 treesize of output 16 [2021-12-14 11:31:00,866 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 39 treesize of output 23 [2021-12-14 11:31:01,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:31:01,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:31:01,062 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 64 treesize of output 53 [2021-12-14 11:31:02,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:31:02,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:31:02,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:31:02,247 INFO L354 Elim1Store]: treesize reduction 198, result has 23.0 percent of original size [2021-12-14 11:31:02,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 125 treesize of output 109 [2021-12-14 11:31:06,856 INFO L354 Elim1Store]: treesize reduction 50, result has 12.3 percent of original size [2021-12-14 11:31:06,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 116 treesize of output 63 [2021-12-14 11:31:07,130 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:31:07,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:31:12,728 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:31:12,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793586916] [2021-12-14 11:31:12,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793586916] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:31:12,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [656365240] [2021-12-14 11:31:12,729 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-14 11:31:12,729 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-14 11:31:12,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-14 11:31:12,740 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-14 11:31:12,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2021-12-14 11:31:13,079 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-14 11:31:13,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:31:13,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-14 11:31:13,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:31:13,150 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 18 treesize of output 16 [2021-12-14 11:31:13,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:31:13,358 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 27 treesize of output 31 [2021-12-14 11:31:13,367 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 12 treesize of output 11 [2021-12-14 11:31:13,372 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 27 treesize of output 26 [2021-12-14 11:31:13,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:31:13,548 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 52 treesize of output 51 [2021-12-14 11:31:13,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:31:13,578 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 23 treesize of output 27 [2021-12-14 11:31:13,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:31:13,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:31:13,600 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 51 treesize of output 56 [2021-12-14 11:31:14,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:31:14,270 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 100 treesize of output 91 [2021-12-14 11:31:14,283 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 82 treesize of output 76 [2021-12-14 11:31:14,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:31:14,394 INFO L354 Elim1Store]: treesize reduction 116, result has 22.1 percent of original size [2021-12-14 11:31:14,395 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 50 treesize of output 62 [2021-12-14 11:31:14,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:31:14,466 INFO L354 Elim1Store]: treesize reduction 82, result has 24.8 percent of original size [2021-12-14 11:31:14,466 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 36 treesize of output 48 [2021-12-14 11:31:18,840 INFO L354 Elim1Store]: treesize reduction 50, result has 12.3 percent of original size [2021-12-14 11:31:18,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 116 treesize of output 63 [2021-12-14 11:31:19,008 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:31:19,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:31:19,396 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_226 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_229 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 64) (let ((.cse4 ((_ sign_extend 16) |c_ULTIMATE.start_main_~index~0#1|))) (let ((.cse1 (let ((.cse5 (bvadd (bvmul ((_ extract 31 0) (bvadd (bvneg ((_ sign_extend 32) .cse4)) c_~ARR_SIZE~0 (_ bv18446744073709551615 64))) (_ bv4 32)) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse5 (bvadd (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse5) (bvmul .cse4 |c_ULTIMATE.start_main_~num~0#1|)))))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse3 (bvadd (bvmul .cse4 (_ bv4 32)) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (store .cse2 .cse3 (bvadd (bvmul .cse4 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (select .cse2 .cse3))))) |c_ULTIMATE.start_main_~#array2~0#1.base| .cse1) |c_ULTIMATE.start_main_~#array1~0#1.base|))) (bvadd ((_ sign_extend 32) (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) ((_ sign_extend 32) (select .cse0 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) |c_ULTIMATE.start_main_~sum~0#1| ((_ sign_extend 32) (select .cse1 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) ((_ sign_extend 32) (select .cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#array2~0#1.offset|))))))))) is different from false [2021-12-14 11:31:23,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [656365240] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:31:23,345 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:31:23,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 24 [2021-12-14 11:31:23,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911422525] [2021-12-14 11:31:23,346 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:31:23,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-14 11:31:23,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:31:23,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-14 11:31:23,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=846, Unknown=6, NotChecked=60, Total=1056 [2021-12-14 11:31:23,347 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 24 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 21 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 11:31:23,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:31:23,741 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2021-12-14 11:31:23,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-14 11:31:23,741 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 21 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2021-12-14 11:31:23,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:31:23,742 INFO L225 Difference]: With dead ends: 54 [2021-12-14 11:31:23,742 INFO L226 Difference]: Without dead ends: 50 [2021-12-14 11:31:23,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=150, Invalid=904, Unknown=6, NotChecked=62, Total=1122 [2021-12-14 11:31:23,743 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 9 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:31:23,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 155 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 101 Unchecked, 0.1s Time] [2021-12-14 11:31:23,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-14 11:31:23,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2021-12-14 11:31:23,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 11:31:23,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2021-12-14 11:31:23,754 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 30 [2021-12-14 11:31:23,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:31:23,754 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2021-12-14 11:31:23,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 21 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 11:31:23,754 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2021-12-14 11:31:23,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 11:31:23,756 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:31:23,756 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:31:23,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-14 11:31:23,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2021-12-14 11:31:24,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-14 11:31:24,159 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:31:24,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:31:24,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1151083191, now seen corresponding path program 5 times [2021-12-14 11:31:24,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:31:24,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133222367] [2021-12-14 11:31:24,161 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-14 11:31:24,161 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:31:24,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:31:24,161 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:31:24,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-14 11:31:24,333 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-14 11:31:24,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:31:24,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-14 11:31:24,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:31:24,823 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:31:24,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:31:25,388 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 11:31:25,388 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:31:25,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133222367] [2021-12-14 11:31:25,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133222367] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:31:25,388 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:31:25,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2021-12-14 11:31:25,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376895466] [2021-12-14 11:31:25,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:31:25,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-14 11:31:25,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:31:25,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-14 11:31:25,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2021-12-14 11:31:25,390 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 11:31:25,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:31:25,549 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2021-12-14 11:31:25,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 11:31:25,550 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 32 [2021-12-14 11:31:25,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:31:25,551 INFO L225 Difference]: With dead ends: 67 [2021-12-14 11:31:25,551 INFO L226 Difference]: Without dead ends: 55 [2021-12-14 11:31:25,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2021-12-14 11:31:25,552 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 33 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:31:25,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 132 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 34 Unchecked, 0.1s Time] [2021-12-14 11:31:25,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-14 11:31:25,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-12-14 11:31:25,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 11:31:25,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2021-12-14 11:31:25,567 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 32 [2021-12-14 11:31:25,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:31:25,567 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2021-12-14 11:31:25,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 11:31:25,567 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2021-12-14 11:31:25,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 11:31:25,568 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:31:25,568 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:31:25,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-14 11:31:25,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:31:25,768 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:31:25,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:31:25,769 INFO L85 PathProgramCache]: Analyzing trace with hash -475590135, now seen corresponding path program 6 times [2021-12-14 11:31:25,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:31:25,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952944447] [2021-12-14 11:31:25,769 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-14 11:31:25,769 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:31:25,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:31:25,778 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:31:25,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-14 11:31:25,937 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-12-14 11:31:25,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:31:25,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-14 11:31:25,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:31:26,731 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:31:26,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:31:26,963 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:31:26,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952944447] [2021-12-14 11:31:26,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [952944447] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:31:26,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2101607754] [2021-12-14 11:31:26,964 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-14 11:31:26,964 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-14 11:31:26,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-14 11:31:26,965 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-14 11:31:26,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2021-12-14 11:31:27,203 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-12-14 11:31:27,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:31:27,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-14 11:31:27,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:31:27,450 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:31:27,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:31:27,940 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 11:31:27,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2101607754] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:31:27,940 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:31:27,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 27 [2021-12-14 11:31:27,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515092292] [2021-12-14 11:31:27,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:31:27,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-14 11:31:27,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:31:27,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-14 11:31:27,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2021-12-14 11:31:27,942 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 27 states, 27 states have (on average 2.185185185185185) internal successors, (59), 26 states have internal predecessors, (59), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-14 11:31:28,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:31:28,191 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2021-12-14 11:31:28,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-14 11:31:28,192 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.185185185185185) internal successors, (59), 26 states have internal predecessors, (59), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 32 [2021-12-14 11:31:28,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:31:28,192 INFO L225 Difference]: With dead ends: 77 [2021-12-14 11:31:28,192 INFO L226 Difference]: Without dead ends: 73 [2021-12-14 11:31:28,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2021-12-14 11:31:28,193 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 44 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:31:28,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 212 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 127 Unchecked, 0.1s Time] [2021-12-14 11:31:28,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-14 11:31:28,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2021-12-14 11:31:28,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 48 states have internal predecessors, (53), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 11:31:28,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2021-12-14 11:31:28,198 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 32 [2021-12-14 11:31:28,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:31:28,198 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2021-12-14 11:31:28,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.185185185185185) internal successors, (59), 26 states have internal predecessors, (59), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-14 11:31:28,199 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2021-12-14 11:31:28,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-14 11:31:28,202 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:31:28,202 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:31:28,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2021-12-14 11:31:28,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-14 11:31:28,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:31:28,603 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:31:28,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:31:28,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1722352949, now seen corresponding path program 7 times [2021-12-14 11:31:28,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:31:28,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743274537] [2021-12-14 11:31:28,603 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-14 11:31:28,603 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:31:28,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:31:28,605 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:31:28,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-14 11:31:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:31:28,886 WARN L261 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 59 conjunts are in the unsatisfiable core [2021-12-14 11:31:28,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:31:28,992 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 18 treesize of output 16 [2021-12-14 11:31:29,082 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 39 treesize of output 23 [2021-12-14 11:31:29,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:31:29,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:31:29,325 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 54 treesize of output 43 [2021-12-14 11:31:29,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:31:29,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:31:29,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:31:29,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:31:29,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:31:29,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:31:29,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 67 [2021-12-14 11:31:30,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:31:30,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:31:30,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:31:30,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:31:30,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:31:30,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:31:30,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:31:31,203 INFO L354 Elim1Store]: treesize reduction 298, result has 24.6 percent of original size [2021-12-14 11:31:31,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 143 treesize of output 153 [2021-12-14 11:31:51,221 INFO L354 Elim1Store]: treesize reduction 28, result has 67.1 percent of original size [2021-12-14 11:31:51,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 4 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 150 treesize of output 139