./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s1if.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-fpi/s1if.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 1a3387bc5e2da462b89ff029159e07dcc81e24b9a3389e54a743d70d22e0e9eb --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 11:38:06,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 11:38:06,923 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 11:38:06,944 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 11:38:06,944 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 11:38:06,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 11:38:06,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 11:38:06,947 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 11:38:06,948 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 11:38:06,948 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 11:38:06,949 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 11:38:06,950 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 11:38:06,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 11:38:06,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 11:38:06,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 11:38:06,953 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 11:38:06,953 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 11:38:06,954 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 11:38:06,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 11:38:06,957 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 11:38:06,958 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 11:38:06,959 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 11:38:06,960 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 11:38:06,960 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 11:38:06,962 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 11:38:06,962 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 11:38:06,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 11:38:06,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 11:38:06,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 11:38:06,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 11:38:06,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 11:38:06,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 11:38:06,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 11:38:06,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 11:38:06,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 11:38:06,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 11:38:06,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 11:38:06,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 11:38:06,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 11:38:06,968 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 11:38:06,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 11:38:06,969 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:38:06,982 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 11:38:06,982 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 11:38:06,982 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 11:38:06,983 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 11:38:06,983 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 11:38:06,983 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 11:38:06,984 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 11:38:06,984 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 11:38:06,984 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 11:38:06,984 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 11:38:06,984 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 11:38:06,985 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 11:38:06,985 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 11:38:06,985 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 11:38:06,985 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 11:38:06,985 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 11:38:06,986 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 11:38:06,986 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 11:38:06,986 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 11:38:06,986 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 11:38:06,986 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 11:38:06,986 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 11:38:06,986 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 11:38:06,987 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 11:38:06,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:38:06,987 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 11:38:06,987 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 11:38:06,987 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 11:38:06,987 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 11:38:06,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 11:38:06,988 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 11:38:06,988 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 11:38:06,988 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 11:38:06,988 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 11:38:06,988 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 -> 1a3387bc5e2da462b89ff029159e07dcc81e24b9a3389e54a743d70d22e0e9eb [2021-12-14 11:38:07,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 11:38:07,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 11:38:07,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 11:38:07,187 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 11:38:07,188 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 11:38:07,188 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s1if.c [2021-12-14 11:38:07,230 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21dbfab43/479a7d5318ae401aadeddd9b09f8b482/FLAG50e45ca8a [2021-12-14 11:38:07,605 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 11:38:07,605 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s1if.c [2021-12-14 11:38:07,616 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21dbfab43/479a7d5318ae401aadeddd9b09f8b482/FLAG50e45ca8a [2021-12-14 11:38:07,628 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21dbfab43/479a7d5318ae401aadeddd9b09f8b482 [2021-12-14 11:38:07,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 11:38:07,632 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 11:38:07,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 11:38:07,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 11:38:07,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 11:38:07,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:38:07" (1/1) ... [2021-12-14 11:38:07,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@517305f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:38:07, skipping insertion in model container [2021-12-14 11:38:07,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:38:07" (1/1) ... [2021-12-14 11:38:07,645 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 11:38:07,660 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 11:38:07,788 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-fpi/s1if.c[587,600] [2021-12-14 11:38:07,801 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:38:07,804 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 11:38:07,813 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-fpi/s1if.c[587,600] [2021-12-14 11:38:07,825 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:38:07,833 INFO L208 MainTranslator]: Completed translation [2021-12-14 11:38:07,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:38:07 WrapperNode [2021-12-14 11:38:07,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 11:38:07,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 11:38:07,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 11:38:07,834 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 11:38:07,840 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:38:07" (1/1) ... [2021-12-14 11:38:07,844 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:38:07" (1/1) ... [2021-12-14 11:38:07,855 INFO L137 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2021-12-14 11:38:07,855 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 11:38:07,855 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 11:38:07,855 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 11:38:07,855 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 11:38:07,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:38:07" (1/1) ... [2021-12-14 11:38:07,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:38:07" (1/1) ... [2021-12-14 11:38:07,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:38:07" (1/1) ... [2021-12-14 11:38:07,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:38:07" (1/1) ... [2021-12-14 11:38:07,865 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:38:07" (1/1) ... [2021-12-14 11:38:07,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:38:07" (1/1) ... [2021-12-14 11:38:07,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:38:07" (1/1) ... [2021-12-14 11:38:07,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 11:38:07,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 11:38:07,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 11:38:07,869 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 11:38:07,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:38:07" (1/1) ... [2021-12-14 11:38:07,884 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:38:07,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:38:07,916 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:38:07,919 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:38:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 11:38:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 11:38:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 11:38:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 11:38:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 11:38:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 11:38:07,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 11:38:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 11:38:07,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 11:38:07,986 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 11:38:07,987 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 11:38:08,067 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 11:38:08,070 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 11:38:08,070 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-14 11:38:08,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:38:08 BoogieIcfgContainer [2021-12-14 11:38:08,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 11:38:08,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 11:38:08,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 11:38:08,075 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 11:38:08,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:38:07" (1/3) ... [2021-12-14 11:38:08,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603b2c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:38:08, skipping insertion in model container [2021-12-14 11:38:08,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:38:07" (2/3) ... [2021-12-14 11:38:08,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603b2c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:38:08, skipping insertion in model container [2021-12-14 11:38:08,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:38:08" (3/3) ... [2021-12-14 11:38:08,076 INFO L111 eAbstractionObserver]: Analyzing ICFG s1if.c [2021-12-14 11:38:08,079 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 11:38:08,079 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 11:38:08,128 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 11:38:08,132 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:38:08,133 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 11:38:08,140 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:08,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-14 11:38:08,143 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:38:08,143 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:38:08,143 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:38:08,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:38:08,146 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2021-12-14 11:38:08,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:38:08,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767025558] [2021-12-14 11:38:08,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:38:08,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:38:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:38:08,287 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:38:08,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:38:08,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767025558] [2021-12-14 11:38:08,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767025558] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:38:08,289 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:38:08,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 11:38:08,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525113573] [2021-12-14 11:38:08,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:38:08,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 11:38:08,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:38:08,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 11:38:08,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 11:38:08,318 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:08,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:38:08,327 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2021-12-14 11:38:08,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 11:38:08,329 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-14 11:38:08,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:38:08,333 INFO L225 Difference]: With dead ends: 34 [2021-12-14 11:38:08,333 INFO L226 Difference]: Without dead ends: 15 [2021-12-14 11:38:08,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 11:38:08,338 INFO L933 BasicCegarLoop]: 22 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, 22 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:38:08,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:38:08,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-12-14 11:38:08,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-12-14 11:38:08,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:08,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2021-12-14 11:38:08,359 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2021-12-14 11:38:08,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:38:08,359 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-12-14 11:38:08,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:08,360 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2021-12-14 11:38:08,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-14 11:38:08,360 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:38:08,360 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:38:08,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 11:38:08,361 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:38:08,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:38:08,364 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2021-12-14 11:38:08,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:38:08,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078667622] [2021-12-14 11:38:08,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:38:08,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:38:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:38:08,459 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:38:08,460 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:38:08,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078667622] [2021-12-14 11:38:08,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078667622] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:38:08,460 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:38:08,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 11:38:08,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144570770] [2021-12-14 11:38:08,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:38:08,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:38:08,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:38:08,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:38:08,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 11:38:08,463 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:08,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:38:08,501 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2021-12-14 11:38:08,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 11:38:08,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-14 11:38:08,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:38:08,502 INFO L225 Difference]: With dead ends: 28 [2021-12-14 11:38:08,502 INFO L226 Difference]: Without dead ends: 20 [2021-12-14 11:38:08,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 11:38:08,506 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:38:08,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 10 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:38:08,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-14 11:38:08,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2021-12-14 11:38:08,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:08,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2021-12-14 11:38:08,513 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2021-12-14 11:38:08,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:38:08,515 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-12-14 11:38:08,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:08,517 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2021-12-14 11:38:08,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 11:38:08,518 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:38:08,519 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:38:08,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 11:38:08,519 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:38:08,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:38:08,520 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2021-12-14 11:38:08,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:38:08,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727166388] [2021-12-14 11:38:08,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:38:08,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:38:08,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:38:08,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:38:08,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:38:08,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727166388] [2021-12-14 11:38:08,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727166388] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:38:08,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885911835] [2021-12-14 11:38:08,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:38:08,840 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:38:08,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:38:08,847 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:38:08,848 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:38:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:38:08,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-14 11:38:08,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:38:08,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 11:38:08,986 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:38:09,021 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 14 treesize of output 16 [2021-12-14 11:38:09,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2021-12-14 11:38:09,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2021-12-14 11:38:09,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:38:09,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:38:09,448 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 11:38:09,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 46 [2021-12-14 11:38:09,451 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 11:38:09,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2021-12-14 11:38:09,455 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 30 treesize of output 12 [2021-12-14 11:38:09,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:38:09,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885911835] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:38:09,464 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:38:09,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 19 [2021-12-14 11:38:09,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095603008] [2021-12-14 11:38:09,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:38:09,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-14 11:38:09,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:38:09,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-14 11:38:09,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=269, Unknown=1, NotChecked=0, Total=342 [2021-12-14 11:38:09,466 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:09,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:38:09,551 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2021-12-14 11:38:09,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 11:38:09,552 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-14 11:38:09,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:38:09,552 INFO L225 Difference]: With dead ends: 36 [2021-12-14 11:38:09,552 INFO L226 Difference]: Without dead ends: 32 [2021-12-14 11:38:09,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=346, Unknown=1, NotChecked=0, Total=462 [2021-12-14 11:38:09,553 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 37 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:38:09,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 49 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 79 Invalid, 0 Unknown, 41 Unchecked, 0.0s Time] [2021-12-14 11:38:09,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-14 11:38:09,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2021-12-14 11:38:09,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:09,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2021-12-14 11:38:09,557 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 16 [2021-12-14 11:38:09,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:38:09,557 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2021-12-14 11:38:09,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:09,557 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2021-12-14 11:38:09,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 11:38:09,558 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:38:09,558 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:38:09,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 11:38:09,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:38:09,772 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:38:09,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:38:09,772 INFO L85 PathProgramCache]: Analyzing trace with hash 680869797, now seen corresponding path program 1 times [2021-12-14 11:38:09,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:38:09,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606956965] [2021-12-14 11:38:09,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:38:09,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:38:09,783 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 11:38:09,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [318417410] [2021-12-14 11:38:09,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:38:09,787 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:38:09,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:38:09,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:38:09,835 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:38:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:38:09,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-14 11:38:09,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:38:09,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 11:38:09,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 11:38:09,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:38:09,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:38:09,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-12-14 11:38:09,942 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 22 treesize of output 20 [2021-12-14 11:38:09,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:38:09,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:38:09,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606956965] [2021-12-14 11:38:09,953 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 11:38:09,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318417410] [2021-12-14 11:38:09,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318417410] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:38:09,954 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:38:09,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-12-14 11:38:09,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328361857] [2021-12-14 11:38:09,955 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:38:09,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 11:38:09,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:38:09,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 11:38:09,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-14 11:38:09,956 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:10,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:38:10,001 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2021-12-14 11:38:10,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 11:38:10,001 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-14 11:38:10,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:38:10,002 INFO L225 Difference]: With dead ends: 38 [2021-12-14 11:38:10,002 INFO L226 Difference]: Without dead ends: 26 [2021-12-14 11:38:10,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-14 11:38:10,004 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:38:10,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:38:10,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-14 11:38:10,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2021-12-14 11:38:10,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:10,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2021-12-14 11:38:10,011 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2021-12-14 11:38:10,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:38:10,014 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2021-12-14 11:38:10,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:10,014 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2021-12-14 11:38:10,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-14 11:38:10,015 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:38:10,015 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:38:10,034 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:38:10,223 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,SelfDestructingSolverStorable3 [2021-12-14 11:38:10,224 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:38:10,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:38:10,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1137819675, now seen corresponding path program 2 times [2021-12-14 11:38:10,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:38:10,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910853391] [2021-12-14 11:38:10,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:38:10,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:38:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:38:10,272 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:38:10,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:38:10,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910853391] [2021-12-14 11:38:10,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910853391] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:38:10,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643757307] [2021-12-14 11:38:10,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 11:38:10,273 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:38:10,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:38:10,276 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:38:10,284 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:38:10,324 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 11:38:10,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:38:10,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 11:38:10,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:38:10,381 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:38:10,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:38:10,417 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:38:10,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643757307] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:38:10,418 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:38:10,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-14 11:38:10,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559767389] [2021-12-14 11:38:10,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:38:10,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 11:38:10,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:38:10,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 11:38:10,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-14 11:38:10,419 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:10,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:38:10,514 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2021-12-14 11:38:10,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 11:38:10,515 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-14 11:38:10,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:38:10,516 INFO L225 Difference]: With dead ends: 33 [2021-12-14 11:38:10,516 INFO L226 Difference]: Without dead ends: 29 [2021-12-14 11:38:10,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-14 11:38:10,516 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 28 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:38:10,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 25 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:38:10,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-14 11:38:10,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2021-12-14 11:38:10,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:10,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2021-12-14 11:38:10,519 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2021-12-14 11:38:10,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:38:10,520 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2021-12-14 11:38:10,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:10,520 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2021-12-14 11:38:10,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 11:38:10,520 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:38:10,521 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:38:10,557 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:38:10,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:38:10,736 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:38:10,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:38:10,736 INFO L85 PathProgramCache]: Analyzing trace with hash -479454913, now seen corresponding path program 3 times [2021-12-14 11:38:10,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:38:10,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084166482] [2021-12-14 11:38:10,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:38:10,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:38:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:38:10,808 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:38:10,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:38:10,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084166482] [2021-12-14 11:38:10,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084166482] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:38:10,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733571127] [2021-12-14 11:38:10,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 11:38:10,809 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:38:10,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:38:10,824 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:38:10,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 11:38:10,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-14 11:38:10,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:38:10,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 11:38:10,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:38:10,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:38:10,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:38:10,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:38:10,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733571127] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:38:10,965 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:38:10,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-14 11:38:10,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418321659] [2021-12-14 11:38:10,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:38:10,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 11:38:10,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:38:10,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 11:38:10,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-14 11:38:10,966 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:11,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:38:11,018 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2021-12-14 11:38:11,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 11:38:11,018 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-14 11:38:11,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:38:11,019 INFO L225 Difference]: With dead ends: 37 [2021-12-14 11:38:11,019 INFO L226 Difference]: Without dead ends: 25 [2021-12-14 11:38:11,019 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-12-14 11:38:11,020 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 23 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:38:11,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 26 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:38:11,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-14 11:38:11,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2021-12-14 11:38:11,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:11,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2021-12-14 11:38:11,022 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2021-12-14 11:38:11,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:38:11,023 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-12-14 11:38:11,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:11,023 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2021-12-14 11:38:11,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-14 11:38:11,023 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:38:11,024 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:38:11,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 11:38:11,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:38:11,239 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:38:11,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:38:11,240 INFO L85 PathProgramCache]: Analyzing trace with hash 634982145, now seen corresponding path program 4 times [2021-12-14 11:38:11,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:38:11,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881597420] [2021-12-14 11:38:11,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:38:11,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:38:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:38:11,513 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:38:11,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:38:11,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881597420] [2021-12-14 11:38:11,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881597420] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:38:11,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030571633] [2021-12-14 11:38:11,515 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-14 11:38:11,515 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:38:11,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:38:11,528 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:38:11,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 11:38:11,571 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-14 11:38:11,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:38:11,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-14 11:38:11,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:38:11,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 11:38:11,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:38:11,682 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 14 treesize of output 16 [2021-12-14 11:38:11,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:38:11,722 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 14 treesize of output 16 [2021-12-14 11:38:11,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:38:11,861 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 44 treesize of output 27 [2021-12-14 11:38:11,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:38:11,967 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-14 11:38:11,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 41 [2021-12-14 11:38:12,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:38:12,115 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-14 11:38:12,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 28 [2021-12-14 11:38:12,144 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:38:12,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:38:14,991 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (v_ArrVal_152 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_152))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_152 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_47| 4)))) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_44| 4))))) (or (not (= .cse0 1)) (not (= .cse1 1)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse2 (+ .cse0 .cse1 .cse4))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))))))))) is different from false [2021-12-14 11:38:15,059 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (|v_ULTIMATE.start_main_~i~0#1_44| Int) (v_ArrVal_152 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_152))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_152 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_47| 4)))) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_44| 4))))) (or (not (= .cse0 1)) (not (= .cse1 1)) (let ((.cse3 (+ .cse0 .cse1 .cse4)) (.cse2 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))))))))) is different from false [2021-12-14 11:38:15,149 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-14 11:38:15,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030571633] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:38:15,149 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:38:15,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 32 [2021-12-14 11:38:15,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082801637] [2021-12-14 11:38:15,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:38:15,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-14 11:38:15,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:38:15,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-14 11:38:15,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=762, Unknown=3, NotChecked=114, Total=992 [2021-12-14 11:38:15,151 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:15,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:38:15,335 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2021-12-14 11:38:15,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 11:38:15,336 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-14 11:38:15,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:38:15,336 INFO L225 Difference]: With dead ends: 36 [2021-12-14 11:38:15,336 INFO L226 Difference]: Without dead ends: 32 [2021-12-14 11:38:15,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=164, Invalid=963, Unknown=3, NotChecked=130, Total=1260 [2021-12-14 11:38:15,337 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:38:15,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 74 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 92 Invalid, 0 Unknown, 156 Unchecked, 0.1s Time] [2021-12-14 11:38:15,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-14 11:38:15,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2021-12-14 11:38:15,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:15,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2021-12-14 11:38:15,341 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 21 [2021-12-14 11:38:15,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:38:15,341 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-12-14 11:38:15,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:15,341 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2021-12-14 11:38:15,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-14 11:38:15,342 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:38:15,342 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:38:15,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 11:38:15,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:38:15,552 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:38:15,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:38:15,552 INFO L85 PathProgramCache]: Analyzing trace with hash 692240447, now seen corresponding path program 1 times [2021-12-14 11:38:15,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:38:15,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456339538] [2021-12-14 11:38:15,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:38:15,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:38:15,562 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 11:38:15,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1253456614] [2021-12-14 11:38:15,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:38:15,563 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:38:15,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:38:15,568 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:38:15,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 11:38:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:38:15,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-14 11:38:15,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:38:15,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 11:38:15,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:38:15,717 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 16 treesize of output 18 [2021-12-14 11:38:15,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 11:38:15,767 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:38:15,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:38:15,804 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_189 (Array Int Int))) (= 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_189) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4)))) is different from false [2021-12-14 11:38:15,812 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_189 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_189) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 1)) is different from false [2021-12-14 11:38:15,823 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 11:38:15,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2021-12-14 11:38:15,831 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 11:38:15,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2021-12-14 11:38:15,835 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 11 treesize of output 7 [2021-12-14 11:38:15,880 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2021-12-14 11:38:15,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:38:15,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456339538] [2021-12-14 11:38:15,885 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 11:38:15,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253456614] [2021-12-14 11:38:15,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253456614] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:38:15,886 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:38:15,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-12-14 11:38:15,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517344963] [2021-12-14 11:38:15,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:38:15,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-14 11:38:15,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:38:15,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 11:38:15,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=126, Unknown=2, NotChecked=46, Total=210 [2021-12-14 11:38:15,887 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:16,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:38:16,027 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2021-12-14 11:38:16,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 11:38:16,027 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-14 11:38:16,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:38:16,028 INFO L225 Difference]: With dead ends: 41 [2021-12-14 11:38:16,028 INFO L226 Difference]: Without dead ends: 34 [2021-12-14 11:38:16,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=238, Unknown=2, NotChecked=66, Total=380 [2021-12-14 11:38:16,029 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:38:16,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 52 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 109 Invalid, 0 Unknown, 41 Unchecked, 0.1s Time] [2021-12-14 11:38:16,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-14 11:38:16,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2021-12-14 11:38:16,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:16,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2021-12-14 11:38:16,033 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2021-12-14 11:38:16,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:38:16,033 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2021-12-14 11:38:16,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:16,033 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2021-12-14 11:38:16,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-14 11:38:16,033 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:38:16,034 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:38:16,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 11:38:16,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:38:16,251 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:38:16,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:38:16,252 INFO L85 PathProgramCache]: Analyzing trace with hash -2132829117, now seen corresponding path program 5 times [2021-12-14 11:38:16,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:38:16,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697786786] [2021-12-14 11:38:16,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:38:16,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:38:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:38:16,337 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:38:16,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:38:16,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697786786] [2021-12-14 11:38:16,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697786786] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:38:16,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734032227] [2021-12-14 11:38:16,338 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-14 11:38:16,338 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:38:16,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:38:16,339 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:38:16,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 11:38:16,396 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-14 11:38:16,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:38:16,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 11:38:16,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:38:16,476 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:38:16,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:38:16,530 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:38:16,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734032227] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:38:16,531 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:38:16,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-14 11:38:16,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468722233] [2021-12-14 11:38:16,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:38:16,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 11:38:16,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:38:16,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 11:38:16,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-14 11:38:16,532 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:16,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:38:16,643 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2021-12-14 11:38:16,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 11:38:16,643 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-14 11:38:16,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:38:16,644 INFO L225 Difference]: With dead ends: 41 [2021-12-14 11:38:16,644 INFO L226 Difference]: Without dead ends: 37 [2021-12-14 11:38:16,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2021-12-14 11:38:16,645 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 42 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:38:16,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 22 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:38:16,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-14 11:38:16,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2021-12-14 11:38:16,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:16,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2021-12-14 11:38:16,648 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 23 [2021-12-14 11:38:16,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:38:16,648 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2021-12-14 11:38:16,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:16,648 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2021-12-14 11:38:16,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 11:38:16,649 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:38:16,649 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:38:16,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-14 11:38:16,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:38:16,872 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:38:16,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:38:16,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1038837147, now seen corresponding path program 6 times [2021-12-14 11:38:16,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:38:16,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407159171] [2021-12-14 11:38:16,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:38:16,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:38:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:38:16,927 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:38:16,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:38:16,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407159171] [2021-12-14 11:38:16,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407159171] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:38:16,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426986650] [2021-12-14 11:38:16,928 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-14 11:38:16,928 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:38:16,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:38:16,937 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:38:16,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 11:38:16,987 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-12-14 11:38:16,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:38:16,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 11:38:16,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:38:17,065 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:38:17,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:38:17,123 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:38:17,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426986650] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:38:17,123 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:38:17,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-14 11:38:17,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158804550] [2021-12-14 11:38:17,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:38:17,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 11:38:17,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:38:17,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 11:38:17,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-14 11:38:17,125 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:17,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:38:17,210 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2021-12-14 11:38:17,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 11:38:17,211 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-14 11:38:17,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:38:17,211 INFO L225 Difference]: With dead ends: 45 [2021-12-14 11:38:17,211 INFO L226 Difference]: Without dead ends: 30 [2021-12-14 11:38:17,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-12-14 11:38:17,211 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 34 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:38:17,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 28 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:38:17,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-14 11:38:17,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2021-12-14 11:38:17,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:17,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2021-12-14 11:38:17,214 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2021-12-14 11:38:17,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:38:17,215 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2021-12-14 11:38:17,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:17,215 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2021-12-14 11:38:17,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 11:38:17,215 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:38:17,215 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:38:17,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-14 11:38:17,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-14 11:38:17,427 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:38:17,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:38:17,427 INFO L85 PathProgramCache]: Analyzing trace with hash -2121994781, now seen corresponding path program 7 times [2021-12-14 11:38:17,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:38:17,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057501539] [2021-12-14 11:38:17,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:38:17,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:38:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:38:17,741 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:38:17,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:38:17,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057501539] [2021-12-14 11:38:17,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057501539] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:38:17,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912403670] [2021-12-14 11:38:17,742 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-14 11:38:17,742 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:38:17,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:38:17,743 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:38:17,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-14 11:38:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:38:17,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 51 conjunts are in the unsatisfiable core [2021-12-14 11:38:17,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:38:17,802 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:38:17,805 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 11 treesize of output 7 [2021-12-14 11:38:17,826 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 14 treesize of output 16 [2021-12-14 11:38:17,855 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 14 treesize of output 16 [2021-12-14 11:38:17,882 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 14 treesize of output 16 [2021-12-14 11:38:18,034 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 44 treesize of output 27 [2021-12-14 11:38:18,132 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-14 11:38:18,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2021-12-14 11:38:18,276 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-14 11:38:18,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2021-12-14 11:38:18,404 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-14 11:38:18,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 31 [2021-12-14 11:38:18,433 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:38:18,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:38:25,855 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_89| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_302 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_92| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select v_ArrVal_302 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 4))))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_89| 4))))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 4))))) (or (not (= .cse0 1)) (let ((.cse2 (+ .cse3 .cse0 .cse4 .cse5)) (.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse1 .cse2) (<= .cse2 .cse1))) (not (= .cse4 1)) (not (= .cse5 1))))))))) is different from false [2021-12-14 11:38:26,071 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_89| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_302 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_92| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select v_ArrVal_302 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 4))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_89| 4))))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 4))))) (or (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ .cse2 .cse3 .cse4 .cse5))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (= .cse3 1)) (not (= .cse4 1)) (not (= .cse5 1))))))))) is different from false [2021-12-14 11:38:26,530 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_89| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_302 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_92| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select v_ArrVal_302 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 4))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_89| 4))))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 4))))) (or (let ((.cse1 (+ .cse2 .cse3 .cse4 .cse5)) (.cse0 (+ 3 |c_ULTIMATE.start_main_~i~0#1|))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (= .cse3 1)) (not (= .cse4 1)) (not (= .cse5 1))))))))) is different from false [2021-12-14 11:38:26,769 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-14 11:38:26,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912403670] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:38:26,769 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:38:26,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 39 [2021-12-14 11:38:26,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535100665] [2021-12-14 11:38:26,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:38:26,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-12-14 11:38:26,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:38:26,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-12-14 11:38:26,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1130, Unknown=6, NotChecked=210, Total=1482 [2021-12-14 11:38:26,772 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 39 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 39 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:26,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:38:26,963 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2021-12-14 11:38:26,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 11:38:26,964 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 39 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-14 11:38:26,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:38:26,964 INFO L225 Difference]: With dead ends: 44 [2021-12-14 11:38:26,964 INFO L226 Difference]: Without dead ends: 40 [2021-12-14 11:38:26,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=185, Invalid=1381, Unknown=6, NotChecked=234, Total=1806 [2021-12-14 11:38:26,965 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 163 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:38:26,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 163 Unchecked, 0.1s Time] [2021-12-14 11:38:26,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-12-14 11:38:26,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2021-12-14 11:38:26,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:26,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-12-14 11:38:26,971 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 26 [2021-12-14 11:38:26,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:38:26,972 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-12-14 11:38:26,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 39 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:26,972 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2021-12-14 11:38:26,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 11:38:26,973 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:38:26,973 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:38:26,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-14 11:38:27,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:38:27,184 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:38:27,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:38:27,184 INFO L85 PathProgramCache]: Analyzing trace with hash -2064736479, now seen corresponding path program 2 times [2021-12-14 11:38:27,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:38:27,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547230404] [2021-12-14 11:38:27,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:38:27,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:38:27,192 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 11:38:27,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [776569445] [2021-12-14 11:38:27,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 11:38:27,192 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:38:27,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:38:27,206 INFO L229 MonitoredProcess]: Starting monitored process 11 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:38:27,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-14 11:38:27,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 11:38:27,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:38:27,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-14 11:38:27,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:38:27,265 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:38:27,294 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 13 treesize of output 9 [2021-12-14 11:38:27,329 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 16 treesize of output 18 [2021-12-14 11:38:27,353 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 16 treesize of output 18 [2021-12-14 11:38:27,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-14 11:38:27,389 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:38:27,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:38:27,418 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4)) 1)) is different from false [2021-12-14 11:38:27,424 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 (* |c_ULTIMATE.start_main_~i~0#1| 4))) 1)) is different from false [2021-12-14 11:38:27,432 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1)) is different from false [2021-12-14 11:38:27,440 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 11:38:27,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2021-12-14 11:38:27,445 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 11:38:27,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2021-12-14 11:38:27,449 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 11 treesize of output 7 [2021-12-14 11:38:27,482 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2021-12-14 11:38:27,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:38:27,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547230404] [2021-12-14 11:38:27,482 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 11:38:27,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776569445] [2021-12-14 11:38:27,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776569445] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:38:27,483 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:38:27,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2021-12-14 11:38:27,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955063009] [2021-12-14 11:38:27,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:38:27,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-14 11:38:27,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:38:27,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-14 11:38:27,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=128, Unknown=3, NotChecked=72, Total=240 [2021-12-14 11:38:27,484 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:27,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:38:27,628 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2021-12-14 11:38:27,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 11:38:27,629 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-14 11:38:27,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:38:27,629 INFO L225 Difference]: With dead ends: 49 [2021-12-14 11:38:27,629 INFO L226 Difference]: Without dead ends: 42 [2021-12-14 11:38:27,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=276, Unknown=3, NotChecked=108, Total=462 [2021-12-14 11:38:27,630 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:38:27,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 58 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 167 Invalid, 0 Unknown, 70 Unchecked, 0.1s Time] [2021-12-14 11:38:27,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-14 11:38:27,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2021-12-14 11:38:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:27,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2021-12-14 11:38:27,640 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 26 [2021-12-14 11:38:27,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:38:27,641 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2021-12-14 11:38:27,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:27,641 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2021-12-14 11:38:27,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 11:38:27,642 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:38:27,642 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:38:27,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-14 11:38:27,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-14 11:38:27,857 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:38:27,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:38:27,858 INFO L85 PathProgramCache]: Analyzing trace with hash 640571873, now seen corresponding path program 8 times [2021-12-14 11:38:27,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:38:27,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13901655] [2021-12-14 11:38:27,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:38:27,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:38:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:38:27,980 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:38:27,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:38:27,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13901655] [2021-12-14 11:38:27,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13901655] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:38:27,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498961775] [2021-12-14 11:38:27,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 11:38:27,981 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:38:27,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:38:28,000 INFO L229 MonitoredProcess]: Starting monitored process 12 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:38:28,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-14 11:38:28,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 11:38:28,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:38:28,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 11:38:28,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:38:28,165 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:38:28,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:38:28,223 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:38:28,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498961775] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:38:28,223 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:38:28,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-14 11:38:28,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174147890] [2021-12-14 11:38:28,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:38:28,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-14 11:38:28,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:38:28,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-14 11:38:28,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-14 11:38:28,225 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:28,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:38:28,450 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2021-12-14 11:38:28,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 11:38:28,450 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-14 11:38:28,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:38:28,451 INFO L225 Difference]: With dead ends: 49 [2021-12-14 11:38:28,451 INFO L226 Difference]: Without dead ends: 45 [2021-12-14 11:38:28,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2021-12-14 11:38:28,452 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 49 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:38:28,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 36 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:38:28,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-12-14 11:38:28,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2021-12-14 11:38:28,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:28,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2021-12-14 11:38:28,455 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2021-12-14 11:38:28,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:38:28,455 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-12-14 11:38:28,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:28,456 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2021-12-14 11:38:28,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 11:38:28,456 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:38:28,456 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:38:28,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-14 11:38:28,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-14 11:38:28,679 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:38:28,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:38:28,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1478838205, now seen corresponding path program 9 times [2021-12-14 11:38:28,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:38:28,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673693664] [2021-12-14 11:38:28,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:38:28,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:38:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:38:28,743 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:38:28,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:38:28,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673693664] [2021-12-14 11:38:28,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673693664] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:38:28,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353668286] [2021-12-14 11:38:28,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 11:38:28,744 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:38:28,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:38:28,746 INFO L229 MonitoredProcess]: Starting monitored process 13 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:38:28,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-14 11:38:28,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-14 11:38:28,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:38:28,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 11:38:28,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:38:28,972 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:38:28,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:38:29,056 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:38:29,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353668286] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:38:29,057 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:38:29,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-14 11:38:29,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852115673] [2021-12-14 11:38:29,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:38:29,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-14 11:38:29,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:38:29,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-14 11:38:29,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-14 11:38:29,059 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:29,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:38:29,178 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2021-12-14 11:38:29,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 11:38:29,180 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-14 11:38:29,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:38:29,181 INFO L225 Difference]: With dead ends: 53 [2021-12-14 11:38:29,181 INFO L226 Difference]: Without dead ends: 35 [2021-12-14 11:38:29,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2021-12-14 11:38:29,182 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 38 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:38:29,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 33 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:38:29,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-14 11:38:29,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2021-12-14 11:38:29,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:29,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2021-12-14 11:38:29,185 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2021-12-14 11:38:29,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:38:29,185 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2021-12-14 11:38:29,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:38:29,186 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2021-12-14 11:38:29,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-14 11:38:29,186 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:38:29,186 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:38:29,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-14 11:38:29,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-14 11:38:29,387 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:38:29,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:38:29,387 INFO L85 PathProgramCache]: Analyzing trace with hash -2018974843, now seen corresponding path program 10 times [2021-12-14 11:38:29,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:38:29,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155897125] [2021-12-14 11:38:29,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:38:29,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:38:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:38:29,876 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:38:29,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:38:29,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155897125] [2021-12-14 11:38:29,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155897125] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:38:29,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799146692] [2021-12-14 11:38:29,877 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-14 11:38:29,877 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:38:29,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:38:29,878 INFO L229 MonitoredProcess]: Starting monitored process 14 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:38:29,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-14 11:38:29,926 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-14 11:38:29,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:38:29,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-14 11:38:29,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:38:29,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 11:38:29,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:38:29,968 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 14 treesize of output 16 [2021-12-14 11:38:29,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:38:29,999 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 14 treesize of output 16 [2021-12-14 11:38:30,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:38:30,028 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 14 treesize of output 16 [2021-12-14 11:38:30,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:38:30,088 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 14 treesize of output 16 [2021-12-14 11:38:30,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:38:30,204 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 44 treesize of output 27 [2021-12-14 11:38:30,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:38:30,344 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-14 11:38:30,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2021-12-14 11:38:30,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:38:30,466 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-14 11:38:30,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2021-12-14 11:38:30,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:38:30,559 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-14 11:38:30,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2021-12-14 11:38:30,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 11:38:30,674 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-14 11:38:30,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 26 [2021-12-14 11:38:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:38:30,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:38:52,173 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_148| Int) (|v_ULTIMATE.start_main_~i~0#1_153| Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_487 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4))))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4))))) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 4))))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse0 .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4))))) (or (not (= .cse0 1)) (not (= .cse1 1)) (not (= .cse2 1)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse3 (+ .cse5 .cse6 .cse0 .cse1 .cse2))) (and (<= .cse3 .cse4) (<= .cse4 .cse3))) (not (= .cse5 1)))))))))) is different from false [2021-12-14 11:38:53,498 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_148| Int) (|v_ULTIMATE.start_main_~i~0#1_153| Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_487 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4))))) (let ((.cse5 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4))))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 4))))) (let ((.cse2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4))))) (or (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ .cse2 .cse3 .cse4 .cse5 .cse6))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (= .cse4 1)) (not (= .cse5 1)) (not (= .cse6 1)) (not (= .cse2 1)))))))))) is different from false [2021-12-14 11:38:56,130 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_148| Int) (|v_ULTIMATE.start_main_~i~0#1_153| Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_487 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4))))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4))))) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 4))))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse0 .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4))))) (or (not (= .cse0 1)) (not (= .cse1 1)) (let ((.cse3 (+ .cse4 .cse5 .cse0 .cse1 .cse6)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~i~0#1|))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))) (not (= .cse6 1)) (not (= .cse4 1)))))))))) is different from false [2021-12-14 11:38:59,256 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_148| Int) (|v_ULTIMATE.start_main_~i~0#1_153| Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_487 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select v_ArrVal_487 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_153| 4))))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4))))) (let ((.cse0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 4))))) (let ((.cse4 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse0 .cse1 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4))))) (or (not (= .cse0 1)) (not (= .cse1 1)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse2 (+ .cse4 .cse5 .cse0 .cse1 .cse6))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))) (not (= .cse6 1)) (not (= .cse4 1)))))))))) is different from false [2021-12-14 11:39:01,151 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2021-12-14 11:39:01,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799146692] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:39:01,152 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:39:01,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 18] total 52 [2021-12-14 11:39:01,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243090078] [2021-12-14 11:39:01,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:39:01,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-12-14 11:39:01,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:39:01,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-12-14 11:39:01,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2080, Unknown=11, NotChecked=380, Total=2652 [2021-12-14 11:39:01,154 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 52 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:01,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:39:01,713 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2021-12-14 11:39:01,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-14 11:39:01,713 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 52 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-14 11:39:01,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:39:01,714 INFO L225 Difference]: With dead ends: 53 [2021-12-14 11:39:01,714 INFO L226 Difference]: Without dead ends: 49 [2021-12-14 11:39:01,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=232, Invalid=2425, Unknown=11, NotChecked=412, Total=3080 [2021-12-14 11:39:01,715 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 10 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 310 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:39:01,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 117 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 241 Invalid, 0 Unknown, 310 Unchecked, 0.1s Time] [2021-12-14 11:39:01,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-12-14 11:39:01,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2021-12-14 11:39:01,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:01,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2021-12-14 11:39:01,724 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 31 [2021-12-14 11:39:01,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:39:01,724 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2021-12-14 11:39:01,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 52 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:01,725 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2021-12-14 11:39:01,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-14 11:39:01,726 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:39:01,726 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:39:01,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-14 11:39:01,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-14 11:39:01,936 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:39:01,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:39:01,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1961716541, now seen corresponding path program 3 times [2021-12-14 11:39:01,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:39:01,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570225219] [2021-12-14 11:39:01,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:39:01,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:39:01,960 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 11:39:01,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [899012603] [2021-12-14 11:39:01,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 11:39:01,961 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:39:01,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:39:01,962 INFO L229 MonitoredProcess]: Starting monitored process 15 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:39:01,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-14 11:39:02,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-14 11:39:02,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:39:02,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-14 11:39:02,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:39:02,065 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:39:02,111 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 15 treesize of output 11 [2021-12-14 11:39:02,175 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 18 treesize of output 20 [2021-12-14 11:39:02,228 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 18 treesize of output 20 [2021-12-14 11:39:02,277 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 18 treesize of output 20 [2021-12-14 11:39:02,324 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 11:39:02,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2021-12-14 11:39:02,404 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:02,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:39:02,516 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_168| Int) (v_ArrVal_547 (Array Int Int))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_168| 1) c_~N~0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_547) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_168| 4))) 1) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_168|))) is different from false [2021-12-14 11:39:02,538 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_168| Int) (v_ArrVal_547 (Array Int Int))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_168| 1) c_~N~0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_547) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_168| 4))) 1) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_168|))) is different from false [2021-12-14 11:39:02,569 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_168| Int) (v_ArrVal_547 (Array Int Int))) (or (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_168|) (< (+ |v_ULTIMATE.start_main_~i~0#1_168| 1) c_~N~0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_547) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_168| 4))) 1))) is different from false [2021-12-14 11:39:02,604 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_168| Int) (v_ArrVal_547 (Array Int Int))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_168| 1) c_~N~0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_547) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_168| 4))) 1) (< 3 |v_ULTIMATE.start_main_~i~0#1_168|))) is different from false [2021-12-14 11:39:02,630 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 11:39:02,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2021-12-14 11:39:02,635 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 11:39:02,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2021-12-14 11:39:02,639 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 13 treesize of output 7 [2021-12-14 11:39:02,763 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 27 not checked. [2021-12-14 11:39:02,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:39:02,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570225219] [2021-12-14 11:39:02,763 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 11:39:02,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899012603] [2021-12-14 11:39:02,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899012603] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:39:02,764 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:39:02,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2021-12-14 11:39:02,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810103893] [2021-12-14 11:39:02,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:39:02,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-14 11:39:02,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:39:02,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-14 11:39:02,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=427, Unknown=4, NotChecked=188, Total=756 [2021-12-14 11:39:02,765 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 28 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:02,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:39:02,985 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2021-12-14 11:39:02,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-14 11:39:02,985 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 28 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-14 11:39:02,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:39:02,986 INFO L225 Difference]: With dead ends: 55 [2021-12-14 11:39:02,986 INFO L226 Difference]: Without dead ends: 51 [2021-12-14 11:39:02,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 34 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=673, Unknown=4, NotChecked=236, Total=1122 [2021-12-14 11:39:02,987 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:39:02,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 59 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 97 Unchecked, 0.0s Time] [2021-12-14 11:39:02,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-14 11:39:02,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2021-12-14 11:39:02,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.125) internal successors, (54), 48 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:02,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2021-12-14 11:39:02,991 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 31 [2021-12-14 11:39:02,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:39:02,992 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2021-12-14 11:39:02,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 28 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:02,992 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2021-12-14 11:39:02,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 11:39:02,992 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:39:02,992 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:39:03,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-14 11:39:03,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:39:03,200 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:39:03,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:39:03,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1399241145, now seen corresponding path program 11 times [2021-12-14 11:39:03,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:39:03,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143019889] [2021-12-14 11:39:03,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:39:03,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:39:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:39:03,293 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:03,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:39:03,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143019889] [2021-12-14 11:39:03,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143019889] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:39:03,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792978662] [2021-12-14 11:39:03,294 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-14 11:39:03,294 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:39:03,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:39:03,295 INFO L229 MonitoredProcess]: Starting monitored process 16 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:39:03,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-14 11:39:03,394 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-12-14 11:39:03,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:39:03,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 11:39:03,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:39:03,538 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:03,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:39:03,614 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:03,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792978662] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:39:03,615 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:39:03,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2021-12-14 11:39:03,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535215516] [2021-12-14 11:39:03,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:39:03,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-14 11:39:03,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:39:03,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-14 11:39:03,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2021-12-14 11:39:03,616 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:03,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:39:03,876 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2021-12-14 11:39:03,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-14 11:39:03,876 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-14 11:39:03,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:39:03,876 INFO L225 Difference]: With dead ends: 59 [2021-12-14 11:39:03,877 INFO L226 Difference]: Without dead ends: 55 [2021-12-14 11:39:03,877 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2021-12-14 11:39:03,877 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 46 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:39:03,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 37 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:39:03,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-14 11:39:03,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 35. [2021-12-14 11:39:03,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:03,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2021-12-14 11:39:03,881 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 33 [2021-12-14 11:39:03,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:39:03,881 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2021-12-14 11:39:03,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:03,881 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2021-12-14 11:39:03,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-14 11:39:03,881 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:39:03,881 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:39:03,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-14 11:39:04,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-14 11:39:04,082 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:39:04,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:39:04,082 INFO L85 PathProgramCache]: Analyzing trace with hash 981485409, now seen corresponding path program 12 times [2021-12-14 11:39:04,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:39:04,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168685401] [2021-12-14 11:39:04,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:39:04,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:39:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:39:04,174 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:04,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:39:04,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168685401] [2021-12-14 11:39:04,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168685401] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:39:04,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229874378] [2021-12-14 11:39:04,174 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-14 11:39:04,174 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:39:04,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:39:04,175 INFO L229 MonitoredProcess]: Starting monitored process 17 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:39:04,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-14 11:39:04,263 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2021-12-14 11:39:04,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:39:04,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 11:39:04,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:39:04,397 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:04,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:39:04,458 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:04,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229874378] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:39:04,458 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:39:04,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2021-12-14 11:39:04,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033910489] [2021-12-14 11:39:04,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:39:04,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-14 11:39:04,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:39:04,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-14 11:39:04,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2021-12-14 11:39:04,459 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:04,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:39:04,591 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2021-12-14 11:39:04,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 11:39:04,592 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-14 11:39:04,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:39:04,592 INFO L225 Difference]: With dead ends: 61 [2021-12-14 11:39:04,592 INFO L226 Difference]: Without dead ends: 40 [2021-12-14 11:39:04,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2021-12-14 11:39:04,593 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 58 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:39:04,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 29 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:39:04,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-12-14 11:39:04,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2021-12-14 11:39:04,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:04,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2021-12-14 11:39:04,596 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 34 [2021-12-14 11:39:04,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:39:04,597 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2021-12-14 11:39:04,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:39:04,597 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2021-12-14 11:39:04,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-14 11:39:04,597 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:39:04,597 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:39:04,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-14 11:39:04,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-14 11:39:04,811 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:39:04,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:39:04,811 INFO L85 PathProgramCache]: Analyzing trace with hash -596322977, now seen corresponding path program 13 times [2021-12-14 11:39:04,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:39:04,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501427125] [2021-12-14 11:39:04,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:39:04,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:39:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:39:05,516 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:05,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:39:05,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501427125] [2021-12-14 11:39:05,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501427125] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:39:05,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481400267] [2021-12-14 11:39:05,517 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-14 11:39:05,517 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:39:05,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:39:05,518 INFO L229 MonitoredProcess]: Starting monitored process 18 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:39:05,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-14 11:39:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:39:05,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 73 conjunts are in the unsatisfiable core [2021-12-14 11:39:05,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:39:05,608 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:39:05,611 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 11 treesize of output 7 [2021-12-14 11:39:05,619 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 14 treesize of output 16 [2021-12-14 11:39:05,636 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 14 treesize of output 16 [2021-12-14 11:39:05,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 11:39:05,685 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 14 treesize of output 16 [2021-12-14 11:39:05,704 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 14 treesize of output 16 [2021-12-14 11:39:05,852 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 44 treesize of output 27 [2021-12-14 11:39:05,936 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-14 11:39:05,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 41 [2021-12-14 11:39:06,068 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-14 11:39:06,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 57 [2021-12-14 11:39:06,213 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-14 11:39:06,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2021-12-14 11:39:06,386 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-14 11:39:06,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 58 [2021-12-14 11:39:06,552 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-14 11:39:06,553 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 29 [2021-12-14 11:39:06,598 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:39:06,598 INFO L328 TraceCheckSpWp]: Computing backward predicates...