./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s1lif.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/s1lif.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 cdcd45f06ced2bb4437693c85186d4d1862b19794596dce357397727796a8cdf --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 10:52:12,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 10:52:12,893 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 10:52:12,910 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 10:52:12,911 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 10:52:12,912 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 10:52:12,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 10:52:12,919 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 10:52:12,920 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 10:52:12,925 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 10:52:12,926 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 10:52:12,927 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 10:52:12,928 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 10:52:12,928 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 10:52:12,929 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 10:52:12,929 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 10:52:12,930 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 10:52:12,930 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 10:52:12,934 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 10:52:12,936 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 10:52:12,939 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 10:52:12,940 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 10:52:12,940 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 10:52:12,941 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 10:52:12,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 10:52:12,944 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 10:52:12,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 10:52:12,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 10:52:12,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 10:52:12,948 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 10:52:12,949 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 10:52:12,949 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 10:52:12,950 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 10:52:12,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 10:52:12,952 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 10:52:12,952 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 10:52:12,952 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 10:52:12,953 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 10:52:12,953 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 10:52:12,953 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 10:52:12,954 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 10:52:12,955 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 10:52:12,956 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 10:52:12,973 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 10:52:12,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 10:52:12,976 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 10:52:12,976 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 10:52:12,977 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 10:52:12,977 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 10:52:12,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 10:52:12,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 10:52:12,978 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 10:52:12,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 10:52:12,979 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 10:52:12,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 10:52:12,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 10:52:12,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 10:52:12,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 10:52:12,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 10:52:12,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 10:52:12,980 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 10:52:12,980 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 10:52:12,980 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 10:52:12,980 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 10:52:12,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 10:52:12,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 10:52:12,981 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 10:52:12,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:52:12,981 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 10:52:12,982 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 10:52:12,982 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 10:52:12,982 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 10:52:12,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 10:52:12,982 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 10:52:12,982 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 10:52:12,983 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 10:52:12,983 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 -> cdcd45f06ced2bb4437693c85186d4d1862b19794596dce357397727796a8cdf [2022-07-22 10:52:13,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 10:52:13,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 10:52:13,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 10:52:13,164 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 10:52:13,165 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 10:52:13,166 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s1lif.c [2022-07-22 10:52:13,222 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66db24c09/db96565f6b4244ab97bd7eeb6610abb8/FLAGb1cf4af05 [2022-07-22 10:52:13,585 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 10:52:13,585 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s1lif.c [2022-07-22 10:52:13,593 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66db24c09/db96565f6b4244ab97bd7eeb6610abb8/FLAGb1cf4af05 [2022-07-22 10:52:13,606 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66db24c09/db96565f6b4244ab97bd7eeb6610abb8 [2022-07-22 10:52:13,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 10:52:13,609 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 10:52:13,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 10:52:13,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 10:52:13,613 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 10:52:13,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:52:13" (1/1) ... [2022-07-22 10:52:13,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43b8dc55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:52:13, skipping insertion in model container [2022-07-22 10:52:13,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:52:13" (1/1) ... [2022-07-22 10:52:13,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 10:52:13,627 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 10:52:13,737 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/s1lif.c[588,601] [2022-07-22 10:52:13,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:52:13,770 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 10:52:13,781 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/s1lif.c[588,601] [2022-07-22 10:52:13,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:52:13,806 INFO L208 MainTranslator]: Completed translation [2022-07-22 10:52:13,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:52:13 WrapperNode [2022-07-22 10:52:13,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 10:52:13,808 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 10:52:13,808 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 10:52:13,808 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 10:52:13,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:52:13" (1/1) ... [2022-07-22 10:52:13,824 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:52:13" (1/1) ... [2022-07-22 10:52:13,842 INFO L137 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2022-07-22 10:52:13,843 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 10:52:13,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 10:52:13,844 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 10:52:13,844 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 10:52:13,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:52:13" (1/1) ... [2022-07-22 10:52:13,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:52:13" (1/1) ... [2022-07-22 10:52:13,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:52:13" (1/1) ... [2022-07-22 10:52:13,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:52:13" (1/1) ... [2022-07-22 10:52:13,863 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:52:13" (1/1) ... [2022-07-22 10:52:13,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:52:13" (1/1) ... [2022-07-22 10:52:13,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:52:13" (1/1) ... [2022-07-22 10:52:13,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 10:52:13,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 10:52:13,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 10:52:13,877 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 10:52:13,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:52:13" (1/1) ... [2022-07-22 10:52:13,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:52:13,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:52:13,897 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 10:52:13,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 10:52:13,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 10:52:13,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 10:52:13,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 10:52:13,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 10:52:13,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 10:52:13,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 10:52:13,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 10:52:13,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 10:52:13,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 10:52:13,961 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 10:52:13,962 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 10:52:14,042 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 10:52:14,046 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 10:52:14,046 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 10:52:14,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:52:14 BoogieIcfgContainer [2022-07-22 10:52:14,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 10:52:14,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 10:52:14,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 10:52:14,051 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 10:52:14,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:52:13" (1/3) ... [2022-07-22 10:52:14,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d975f15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:52:14, skipping insertion in model container [2022-07-22 10:52:14,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:52:13" (2/3) ... [2022-07-22 10:52:14,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d975f15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:52:14, skipping insertion in model container [2022-07-22 10:52:14,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:52:14" (3/3) ... [2022-07-22 10:52:14,054 INFO L111 eAbstractionObserver]: Analyzing ICFG s1lif.c [2022-07-22 10:52:14,062 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 10:52:14,063 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 10:52:14,092 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 10:52:14,096 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@59bd02e1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@32f82173 [2022-07-22 10:52:14,097 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 10:52:14,100 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:14,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 10:52:14,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:52:14,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:52:14,105 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:52:14,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:52:14,108 INFO L85 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2022-07-22 10:52:14,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:52:14,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800143240] [2022-07-22 10:52:14,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:14,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:52:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:14,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:52:14,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:52:14,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800143240] [2022-07-22 10:52:14,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800143240] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:52:14,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:52:14,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 10:52:14,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437915188] [2022-07-22 10:52:14,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:52:14,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 10:52:14,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:52:14,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 10:52:14,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 10:52:14,250 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 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) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:14,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:52:14,259 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-07-22 10:52:14,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 10:52:14,261 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2022-07-22 10:52:14,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:52:14,266 INFO L225 Difference]: With dead ends: 40 [2022-07-22 10:52:14,266 INFO L226 Difference]: Without dead ends: 18 [2022-07-22 10:52:14,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 10:52:14,272 INFO L413 NwaCegarLoop]: 26 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, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 10:52:14,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:52:14,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-22 10:52:14,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-22 10:52:14,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:14,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-07-22 10:52:14,309 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2022-07-22 10:52:14,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:52:14,310 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-07-22 10:52:14,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:14,310 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-07-22 10:52:14,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 10:52:14,311 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:52:14,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:52:14,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 10:52:14,311 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:52:14,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:52:14,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2022-07-22 10:52:14,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:52:14,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554571365] [2022-07-22 10:52:14,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:14,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:52:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:14,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:52:14,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:52:14,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554571365] [2022-07-22 10:52:14,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554571365] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:52:14,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:52:14,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 10:52:14,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79586591] [2022-07-22 10:52:14,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:52:14,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 10:52:14,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:52:14,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 10:52:14,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 10:52:14,410 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:14,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:52:14,449 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-07-22 10:52:14,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 10:52:14,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-07-22 10:52:14,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:52:14,450 INFO L225 Difference]: With dead ends: 36 [2022-07-22 10:52:14,450 INFO L226 Difference]: Without dead ends: 25 [2022-07-22 10:52:14,451 INFO L412 NwaCegarLoop]: 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 [2022-07-22 10:52:14,452 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 10:52:14,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 11 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:52:14,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-22 10:52:14,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-07-22 10:52:14,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 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) [2022-07-22 10:52:14,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-07-22 10:52:14,456 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2022-07-22 10:52:14,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:52:14,456 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-07-22 10:52:14,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:14,457 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-07-22 10:52:14,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 10:52:14,457 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:52:14,457 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:52:14,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 10:52:14,458 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:52:14,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:52:14,458 INFO L85 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2022-07-22 10:52:14,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:52:14,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041721266] [2022-07-22 10:52:14,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:14,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:52:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:14,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:52:14,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:52:14,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041721266] [2022-07-22 10:52:14,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041721266] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:52:14,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86864975] [2022-07-22 10:52:14,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:14,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:14,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:52:14,911 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:52:14,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 10:52:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:14,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-22 10:52:14,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:52:15,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-22 10:52:15,085 INFO L390 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 [2022-07-22 10:52:15,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 10:52:15,241 INFO L390 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 32 treesize of output 23 [2022-07-22 10:52:15,302 INFO L390 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 38 treesize of output 25 [2022-07-22 10:52:15,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:52:15,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:52:15,574 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:52:15,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 28 [2022-07-22 10:52:15,638 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:52:15,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-22 10:52:15,641 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:52:15,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2022-07-22 10:52:15,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-22 10:52:15,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:52:15,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86864975] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:52:15,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:52:15,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 27 [2022-07-22 10:52:15,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259130773] [2022-07-22 10:52:15,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:52:15,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-22 10:52:15,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:52:15,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-22 10:52:15,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=550, Unknown=0, NotChecked=0, Total=702 [2022-07-22 10:52:15,666 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 27 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 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) [2022-07-22 10:52:15,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:52:15,975 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-07-22 10:52:15,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-22 10:52:15,976 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 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 20 [2022-07-22 10:52:15,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:52:15,978 INFO L225 Difference]: With dead ends: 46 [2022-07-22 10:52:15,978 INFO L226 Difference]: Without dead ends: 41 [2022-07-22 10:52:15,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=217, Invalid=905, Unknown=0, NotChecked=0, Total=1122 [2022-07-22 10:52:15,979 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 17 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:52:15,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 68 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 179 Invalid, 0 Unknown, 51 Unchecked, 0.1s Time] [2022-07-22 10:52:15,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-22 10:52:15,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2022-07-22 10:52:15,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 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) [2022-07-22 10:52:15,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-07-22 10:52:15,984 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 20 [2022-07-22 10:52:15,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:52:15,984 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-07-22 10:52:15,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 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) [2022-07-22 10:52:15,984 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-07-22 10:52:15,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 10:52:15,985 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:52:15,985 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:52:16,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-22 10:52:16,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:16,186 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:52:16,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:52:16,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2022-07-22 10:52:16,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:52:16,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935232788] [2022-07-22 10:52:16,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:16,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:52:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:16,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:52:16,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:52:16,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935232788] [2022-07-22 10:52:16,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935232788] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:52:16,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311687764] [2022-07-22 10:52:16,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:16,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:16,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:52:16,300 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:52:16,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 10:52:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:16,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-22 10:52:16,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:52:16,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-22 10:52:16,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 10:52:16,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:52:16,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:52:16,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-07-22 10:52:16,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-07-22 10:52:16,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:52:16,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311687764] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:52:16,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:52:16,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-07-22 10:52:16,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019249602] [2022-07-22 10:52:16,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:52:16,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 10:52:16,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:52:16,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 10:52:16,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-22 10:52:16,438 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:16,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:52:16,503 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2022-07-22 10:52:16,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 10:52:16,504 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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 20 [2022-07-22 10:52:16,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:52:16,504 INFO L225 Difference]: With dead ends: 49 [2022-07-22 10:52:16,504 INFO L226 Difference]: Without dead ends: 38 [2022-07-22 10:52:16,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-22 10:52:16,505 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 10:52:16,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 56 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:52:16,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-22 10:52:16,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-07-22 10:52:16,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 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) [2022-07-22 10:52:16,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2022-07-22 10:52:16,510 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 20 [2022-07-22 10:52:16,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:52:16,510 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-07-22 10:52:16,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-07-22 10:52:16,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-22 10:52:16,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:52:16,511 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:52:16,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 10:52:16,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-22 10:52:16,736 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:52:16,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:52:16,736 INFO L85 PathProgramCache]: Analyzing trace with hash -949569453, now seen corresponding path program 2 times [2022-07-22 10:52:16,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:52:16,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760758104] [2022-07-22 10:52:16,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:16,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:52:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:16,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:52:16,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:52:16,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760758104] [2022-07-22 10:52:16,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760758104] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:52:16,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789888848] [2022-07-22 10:52:16,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:52:16,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:16,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:52:16,800 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:52:16,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 10:52:16,842 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:52:16,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:52:16,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 10:52:16,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:52:16,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:52:16,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:52:16,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:52:16,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789888848] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:52:16,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:52:16,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-22 10:52:16,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392479391] [2022-07-22 10:52:16,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:52:16,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 10:52:16,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:52:16,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 10:52:16,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-22 10:52:16,892 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 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) [2022-07-22 10:52:16,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:52:16,964 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-07-22 10:52:16,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 10:52:16,965 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 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 22 [2022-07-22 10:52:16,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:52:16,965 INFO L225 Difference]: With dead ends: 70 [2022-07-22 10:52:16,965 INFO L226 Difference]: Without dead ends: 44 [2022-07-22 10:52:16,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-22 10:52:16,966 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 54 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:52:16,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 31 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:52:16,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-22 10:52:16,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2022-07-22 10:52:16,969 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) [2022-07-22 10:52:16,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-07-22 10:52:16,970 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2022-07-22 10:52:16,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:52:16,970 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-07-22 10:52:16,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 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) [2022-07-22 10:52:16,970 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-07-22 10:52:16,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-22 10:52:16,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:52:16,971 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:52:16,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-22 10:52:17,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:17,177 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:52:17,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:52:17,177 INFO L85 PathProgramCache]: Analyzing trace with hash -2105967953, now seen corresponding path program 3 times [2022-07-22 10:52:17,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:52:17,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468471624] [2022-07-22 10:52:17,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:17,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:52:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:17,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:52:17,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:52:17,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468471624] [2022-07-22 10:52:17,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468471624] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:52:17,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65272523] [2022-07-22 10:52:17,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 10:52:17,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:17,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:52:17,241 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:52:17,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 10:52:17,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-22 10:52:17,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:52:17,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 10:52:17,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:52:17,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:52:17,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:52:17,343 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:52:17,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65272523] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:52:17,343 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:52:17,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-22 10:52:17,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307298636] [2022-07-22 10:52:17,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:52:17,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 10:52:17,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:52:17,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 10:52:17,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-22 10:52:17,345 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:17,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:52:17,420 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-07-22 10:52:17,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 10:52:17,421 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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 22 [2022-07-22 10:52:17,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:52:17,421 INFO L225 Difference]: With dead ends: 39 [2022-07-22 10:52:17,422 INFO L226 Difference]: Without dead ends: 31 [2022-07-22 10:52:17,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-22 10:52:17,422 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 38 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:52:17,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 30 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:52:17,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-22 10:52:17,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-07-22 10:52:17,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:17,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-07-22 10:52:17,425 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2022-07-22 10:52:17,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:52:17,426 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-07-22 10:52:17,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:17,426 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-07-22 10:52:17,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-22 10:52:17,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:52:17,426 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:52:17,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 10:52:17,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:17,639 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:52:17,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:52:17,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1032594067, now seen corresponding path program 4 times [2022-07-22 10:52:17,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:52:17,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587913641] [2022-07-22 10:52:17,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:17,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:52:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:18,250 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:52:18,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:52:18,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587913641] [2022-07-22 10:52:18,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587913641] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:52:18,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098167694] [2022-07-22 10:52:18,251 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 10:52:18,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:18,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:52:18,252 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:52:18,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 10:52:18,291 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 10:52:18,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:52:18,292 WARN L261 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-22 10:52:18,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:52:18,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 10:52:18,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:18,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 [2022-07-22 10:52:18,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:18,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 10:52:18,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:18,529 INFO L390 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 [2022-07-22 10:52:18,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:18,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:18,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2022-07-22 10:52:18,763 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:52:18,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:18,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:18,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2022-07-22 10:52:18,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:18,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2022-07-22 10:52:18,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:18,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 34 [2022-07-22 10:52:18,948 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:52:18,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:52:19,639 INFO L356 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-07-22 10:52:19,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 137 treesize of output 73 [2022-07-22 10:52:19,652 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_3 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (= (* 2 ~N~0) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_3))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse3))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (= (+ (- 1) .cse0) 1)) (not (= (+ (- 1) (select v_arrayElimArr_3 .cse4)) 1)) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-22 10:52:19,668 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_3 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (= (* 2 ~N~0) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_3))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse3))))) (not (= (+ (- 1) .cse0) 1)) (not (= (+ (- 1) (select v_arrayElimArr_3 .cse4)) 1))))) is different from false [2022-07-22 10:52:19,712 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-22 10:52:19,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098167694] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:52:19,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:52:19,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 49 [2022-07-22 10:52:19,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911622763] [2022-07-22 10:52:19,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:52:19,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-22 10:52:19,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:52:19,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-22 10:52:19,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1863, Unknown=2, NotChecked=182, Total=2352 [2022-07-22 10:52:19,715 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 49 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:22,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:52:22,846 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2022-07-22 10:52:22,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-07-22 10:52:22,846 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 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 27 [2022-07-22 10:52:22,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:52:22,847 INFO L225 Difference]: With dead ends: 77 [2022-07-22 10:52:22,847 INFO L226 Difference]: Without dead ends: 72 [2022-07-22 10:52:22,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1845 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=842, Invalid=4864, Unknown=2, NotChecked=298, Total=6006 [2022-07-22 10:52:22,849 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 58 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-22 10:52:22,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 116 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 679 Invalid, 0 Unknown, 171 Unchecked, 0.6s Time] [2022-07-22 10:52:22,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-22 10:52:22,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 44. [2022-07-22 10:52:22,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:22,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-07-22 10:52:22,855 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 27 [2022-07-22 10:52:22,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:52:22,855 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-07-22 10:52:22,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:22,855 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-07-22 10:52:22,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-22 10:52:22,856 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:52:22,856 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:52:22,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-22 10:52:23,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:23,065 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:52:23,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:52:23,066 INFO L85 PathProgramCache]: Analyzing trace with hash -774428629, now seen corresponding path program 1 times [2022-07-22 10:52:23,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:52:23,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6087593] [2022-07-22 10:52:23,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:23,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:52:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:23,190 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 10:52:23,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:52:23,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6087593] [2022-07-22 10:52:23,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6087593] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:52:23,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217346797] [2022-07-22 10:52:23,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:23,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:23,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:52:23,193 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:52:23,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 10:52:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:23,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-22 10:52:23,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:52:23,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 10:52:23,297 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-22 10:52:23,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-07-22 10:52:23,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-22 10:52:23,321 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 10:52:23,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:52:23,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-22 10:52:23,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-07-22 10:52:23,358 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 10:52:23,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217346797] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:52:23,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:52:23,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2022-07-22 10:52:23,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79814000] [2022-07-22 10:52:23,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:52:23,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-22 10:52:23,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:52:23,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-22 10:52:23,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-07-22 10:52:23,360 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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) [2022-07-22 10:52:23,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:52:23,533 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-07-22 10:52:23,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 10:52:23,534 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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) Word has length 27 [2022-07-22 10:52:23,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:52:23,534 INFO L225 Difference]: With dead ends: 63 [2022-07-22 10:52:23,534 INFO L226 Difference]: Without dead ends: 50 [2022-07-22 10:52:23,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2022-07-22 10:52:23,535 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:52:23,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 54 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:52:23,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-22 10:52:23,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2022-07-22 10:52:23,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:23,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2022-07-22 10:52:23,540 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 27 [2022-07-22 10:52:23,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:52:23,540 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2022-07-22 10:52:23,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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) [2022-07-22 10:52:23,541 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2022-07-22 10:52:23,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-22 10:52:23,541 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:52:23,541 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:52:23,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 10:52:23,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:23,758 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:52:23,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:52:23,758 INFO L85 PathProgramCache]: Analyzing trace with hash -132219249, now seen corresponding path program 5 times [2022-07-22 10:52:23,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:52:23,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851261313] [2022-07-22 10:52:23,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:23,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:52:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:23,800 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 10:52:23,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:52:23,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851261313] [2022-07-22 10:52:23,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851261313] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:52:23,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363047050] [2022-07-22 10:52:23,801 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 10:52:23,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:23,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:52:23,802 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:52:23,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 10:52:23,853 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-22 10:52:23,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:52:23,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 10:52:23,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:52:23,899 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 10:52:23,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:52:23,924 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 10:52:23,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363047050] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:52:23,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:52:23,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-22 10:52:23,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846421805] [2022-07-22 10:52:23,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:52:23,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 10:52:23,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:52:23,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 10:52:23,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-22 10:52:23,928 INFO L87 Difference]: Start difference. First operand 45 states and 52 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) [2022-07-22 10:52:24,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:52:24,020 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2022-07-22 10:52:24,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 10:52:24,021 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 29 [2022-07-22 10:52:24,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:52:24,021 INFO L225 Difference]: With dead ends: 77 [2022-07-22 10:52:24,021 INFO L226 Difference]: Without dead ends: 43 [2022-07-22 10:52:24,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-22 10:52:24,022 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 60 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:52:24,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 35 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:52:24,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-22 10:52:24,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2022-07-22 10:52:24,026 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) [2022-07-22 10:52:24,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-07-22 10:52:24,026 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 29 [2022-07-22 10:52:24,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:52:24,027 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-07-22 10:52:24,027 INFO L496 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) [2022-07-22 10:52:24,027 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-07-22 10:52:24,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 10:52:24,027 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:52:24,027 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:52:24,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-22 10:52:24,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:24,236 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:52:24,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:52:24,236 INFO L85 PathProgramCache]: Analyzing trace with hash -863925553, now seen corresponding path program 6 times [2022-07-22 10:52:24,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:52:24,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191090672] [2022-07-22 10:52:24,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:24,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:52:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:24,281 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 10:52:24,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:52:24,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191090672] [2022-07-22 10:52:24,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191090672] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:52:24,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61940246] [2022-07-22 10:52:24,281 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 10:52:24,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:24,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:52:24,283 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:52:24,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-22 10:52:24,338 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-22 10:52:24,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:52:24,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 10:52:24,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:52:24,388 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 10:52:24,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:52:24,416 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 10:52:24,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61940246] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:52:24,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:52:24,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-22 10:52:24,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464364385] [2022-07-22 10:52:24,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:52:24,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 10:52:24,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:52:24,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 10:52:24,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-22 10:52:24,418 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:24,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:52:24,531 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-07-22 10:52:24,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 10:52:24,532 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 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 32 [2022-07-22 10:52:24,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:52:24,533 INFO L225 Difference]: With dead ends: 42 [2022-07-22 10:52:24,533 INFO L226 Difference]: Without dead ends: 38 [2022-07-22 10:52:24,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-07-22 10:52:24,534 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 62 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:52:24,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 23 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:52:24,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-22 10:52:24,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-07-22 10:52:24,539 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) [2022-07-22 10:52:24,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-07-22 10:52:24,539 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2022-07-22 10:52:24,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:52:24,539 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-07-22 10:52:24,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:24,539 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-07-22 10:52:24,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-22 10:52:24,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:52:24,540 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:52:24,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-22 10:52:24,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-22 10:52:24,741 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:52:24,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:52:24,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1250534543, now seen corresponding path program 7 times [2022-07-22 10:52:24,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:52:24,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787965681] [2022-07-22 10:52:24,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:24,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:52:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:25,744 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:52:25,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:52:25,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787965681] [2022-07-22 10:52:25,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787965681] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:52:25,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205349667] [2022-07-22 10:52:25,745 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-22 10:52:25,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:25,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:52:25,746 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:52:25,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-22 10:52:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:25,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-22 10:52:25,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:52:25,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-22 10:52:25,811 INFO L390 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 [2022-07-22 10:52:25,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 10:52:25,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 10:52:25,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 10:52:26,040 INFO L390 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 [2022-07-22 10:52:26,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:26,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2022-07-22 10:52:26,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:26,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:26,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:26,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-07-22 10:52:26,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:26,406 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:52:26,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:26,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:26,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2022-07-22 10:52:26,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:26,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:26,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:26,506 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:52:26,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:26,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 53 [2022-07-22 10:52:26,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2022-07-22 10:52:26,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 37 [2022-07-22 10:52:26,714 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:52:26,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:52:28,757 INFO L356 Elim1Store]: treesize reduction 106, result has 21.5 percent of original size [2022-07-22 10:52:28,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 429 treesize of output 149 [2022-07-22 10:52:28,775 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_4 .cse0) 2)) (not (= (+ (- 1) (select v_arrayElimArr_4 .cse1)) 1)) (not (= (+ (- 1) .cse2) 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (= (* 2 ~N~0) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse5 .cse6)))))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-22 10:52:28,799 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= (select v_arrayElimArr_4 .cse0) 2)) (not (= (+ (- 1) (select v_arrayElimArr_4 .cse1)) 1)) (not (= (+ (- 1) .cse2) 1)) (= (* 2 ~N~0) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse5 .cse6))))))))) is different from false [2022-07-22 10:52:28,843 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_4 .cse0) 2)) (not (= (+ (- 1) (select v_arrayElimArr_4 .cse1)) 1)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= (+ (- 1) .cse2) 1)) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (= (* 2 ~N~0) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse5 .cse6))))))))) is different from false [2022-07-22 10:52:28,873 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-22 10:52:28,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205349667] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:52:28,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:52:28,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 67 [2022-07-22 10:52:28,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463831068] [2022-07-22 10:52:28,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:52:28,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-07-22 10:52:28,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:52:28,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-07-22 10:52:28,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=3533, Unknown=3, NotChecked=378, Total=4422 [2022-07-22 10:52:28,876 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 67 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:39,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:52:39,365 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2022-07-22 10:52:39,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-07-22 10:52:39,365 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 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 [2022-07-22 10:52:39,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:52:39,366 INFO L225 Difference]: With dead ends: 99 [2022-07-22 10:52:39,366 INFO L226 Difference]: Without dead ends: 81 [2022-07-22 10:52:39,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 103 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3573 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=1212, Invalid=9099, Unknown=3, NotChecked=606, Total=10920 [2022-07-22 10:52:39,369 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 83 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:52:39,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 130 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 1052 Invalid, 0 Unknown, 128 Unchecked, 1.1s Time] [2022-07-22 10:52:39,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-22 10:52:39,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 55. [2022-07-22 10:52:39,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 54 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:39,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-07-22 10:52:39,376 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 34 [2022-07-22 10:52:39,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:52:39,377 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-07-22 10:52:39,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:39,377 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-07-22 10:52:39,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-22 10:52:39,377 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:52:39,378 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:52:39,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-22 10:52:39,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:39,591 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:52:39,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:52:39,592 INFO L85 PathProgramCache]: Analyzing trace with hash 2033315503, now seen corresponding path program 2 times [2022-07-22 10:52:39,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:52:39,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214745129] [2022-07-22 10:52:39,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:39,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:52:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:39,734 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 10:52:39,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:52:39,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214745129] [2022-07-22 10:52:39,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214745129] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:52:39,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965506539] [2022-07-22 10:52:39,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:52:39,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:39,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:52:39,735 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) [2022-07-22 10:52:39,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-22 10:52:39,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:52:39,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:52:39,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-22 10:52:39,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:52:39,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 10:52:39,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:39,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-07-22 10:52:39,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:39,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-07-22 10:52:39,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 10:52:39,933 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 10:52:39,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:52:39,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-22 10:52:39,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-07-22 10:52:40,010 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 10:52:40,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965506539] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:52:40,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:52:40,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 27 [2022-07-22 10:52:40,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866128413] [2022-07-22 10:52:40,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:52:40,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-22 10:52:40,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:52:40,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-22 10:52:40,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2022-07-22 10:52:40,012 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:40,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:52:40,296 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2022-07-22 10:52:40,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-22 10:52:40,297 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 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 [2022-07-22 10:52:40,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:52:40,297 INFO L225 Difference]: With dead ends: 76 [2022-07-22 10:52:40,297 INFO L226 Difference]: Without dead ends: 61 [2022-07-22 10:52:40,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2022-07-22 10:52:40,298 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 50 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:52:40,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 72 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:52:40,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-22 10:52:40,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2022-07-22 10:52:40,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:40,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-07-22 10:52:40,304 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 34 [2022-07-22 10:52:40,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:52:40,304 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-07-22 10:52:40,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:40,305 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-07-22 10:52:40,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-22 10:52:40,305 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:52:40,305 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:52:40,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-22 10:52:40,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-22 10:52:40,517 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:52:40,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:52:40,518 INFO L85 PathProgramCache]: Analyzing trace with hash 880380819, now seen corresponding path program 8 times [2022-07-22 10:52:40,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:52:40,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964518967] [2022-07-22 10:52:40,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:40,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:52:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:40,576 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 10:52:40,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:52:40,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964518967] [2022-07-22 10:52:40,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964518967] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:52:40,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727536799] [2022-07-22 10:52:40,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:52:40,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:40,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:52:40,578 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) [2022-07-22 10:52:40,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-22 10:52:40,638 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:52:40,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:52:40,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 10:52:40,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:52:40,699 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 10:52:40,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:52:40,731 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 10:52:40,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727536799] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:52:40,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:52:40,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-22 10:52:40,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066174588] [2022-07-22 10:52:40,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:52:40,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-22 10:52:40,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:52:40,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 10:52:40,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-22 10:52:40,732 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 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) [2022-07-22 10:52:40,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:52:40,846 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2022-07-22 10:52:40,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 10:52:40,847 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 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) Word has length 36 [2022-07-22 10:52:40,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:52:40,847 INFO L225 Difference]: With dead ends: 86 [2022-07-22 10:52:40,847 INFO L226 Difference]: Without dead ends: 50 [2022-07-22 10:52:40,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-07-22 10:52:40,848 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 82 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:52:40,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 36 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:52:40,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-22 10:52:40,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2022-07-22 10:52:40,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:40,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-07-22 10:52:40,853 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 36 [2022-07-22 10:52:40,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:52:40,853 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-07-22 10:52:40,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 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) [2022-07-22 10:52:40,853 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-07-22 10:52:40,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-22 10:52:40,853 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:52:40,853 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:52:40,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-22 10:52:41,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-22 10:52:41,063 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:52:41,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:52:41,064 INFO L85 PathProgramCache]: Analyzing trace with hash 975408915, now seen corresponding path program 9 times [2022-07-22 10:52:41,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:52:41,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436480153] [2022-07-22 10:52:41,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:41,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:52:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:41,135 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 10:52:41,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:52:41,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436480153] [2022-07-22 10:52:41,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436480153] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:52:41,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252625631] [2022-07-22 10:52:41,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 10:52:41,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:41,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:52:41,138 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) [2022-07-22 10:52:41,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-22 10:52:41,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-22 10:52:41,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:52:41,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 10:52:41,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:52:41,287 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-22 10:52:41,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:52:41,319 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-22 10:52:41,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252625631] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:52:41,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:52:41,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-22 10:52:41,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290949533] [2022-07-22 10:52:41,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:52:41,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-22 10:52:41,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:52:41,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 10:52:41,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-22 10:52:41,320 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:41,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:52:41,519 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-07-22 10:52:41,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 10:52:41,519 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 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 39 [2022-07-22 10:52:41,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:52:41,520 INFO L225 Difference]: With dead ends: 49 [2022-07-22 10:52:41,520 INFO L226 Difference]: Without dead ends: 45 [2022-07-22 10:52:41,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-07-22 10:52:41,520 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 56 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:52:41,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 33 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:52:41,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-22 10:52:41,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-07-22 10:52:41,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:41,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-07-22 10:52:41,525 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 39 [2022-07-22 10:52:41,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:52:41,525 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-07-22 10:52:41,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:52:41,526 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-07-22 10:52:41,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-22 10:52:41,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:52:41,526 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:52:41,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-22 10:52:41,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-22 10:52:41,727 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:52:41,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:52:41,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1118330549, now seen corresponding path program 10 times [2022-07-22 10:52:41,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:52:41,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566836561] [2022-07-22 10:52:41,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:52:41,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:52:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:52:43,219 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 1 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:52:43,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:52:43,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566836561] [2022-07-22 10:52:43,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566836561] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:52:43,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871965005] [2022-07-22 10:52:43,219 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 10:52:43,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:52:43,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:52:43,220 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) [2022-07-22 10:52:43,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-22 10:52:43,277 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 10:52:43,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:52:43,278 WARN L261 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-22 10:52:43,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:52:43,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 10:52:43,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:43,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 10:52:43,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:43,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 10:52:43,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:43,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 10:52:43,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:43,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 10:52:43,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:43,614 INFO L390 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 [2022-07-22 10:52:43,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:43,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:43,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-07-22 10:52:43,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:43,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:43,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:43,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:43,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 51 [2022-07-22 10:52:44,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2022-07-22 10:52:44,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,210 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:52:44,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2022-07-22 10:52:44,333 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:52:44,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 66 [2022-07-22 10:52:44,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:52:44,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 71 [2022-07-22 10:52:44,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 63 [2022-07-22 10:52:44,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:44,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 40 [2022-07-22 10:52:44,739 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:52:44,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:52:51,796 INFO L356 Elim1Store]: treesize reduction 233, result has 14.3 percent of original size [2022-07-22 10:52:51,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 1159 treesize of output 287 [2022-07-22 10:52:51,827 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (~N~0 Int)) (let ((.cse2 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_5 .cse0) 2)) (not (= (+ (- 1) (select v_arrayElimArr_5 .cse1)) 1)) (not (= 2 (select v_arrayElimArr_5 .cse2))) (not (= (+ (- 1) .cse3) 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (= (* 2 ~N~0) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse4 .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse3 .cse8))))))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-22 10:52:51,865 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (~N~0 Int)) (let ((.cse2 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_5 .cse0) 2)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= (+ (- 1) (select v_arrayElimArr_5 .cse1)) 1)) (not (= 2 (select v_arrayElimArr_5 .cse2))) (not (= (+ (- 1) .cse3) 1)) (= (* 2 ~N~0) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse4 .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse3 .cse8)))))))))) is different from false [2022-07-22 10:52:51,934 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (~N~0 Int)) (let ((.cse2 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_5 .cse0) 2)) (not (= (+ (- 1) (select v_arrayElimArr_5 .cse1)) 1)) (not (= 2 (select v_arrayElimArr_5 .cse2))) (not (= (+ (- 1) .cse3) 1)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (= (* 2 ~N~0) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse4 .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse3 .cse8)))))))))) is different from false [2022-07-22 10:52:52,000 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (~N~0 Int)) (let ((.cse2 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_5 .cse0) 2)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (= (+ (- 1) (select v_arrayElimArr_5 .cse1)) 1)) (not (= 2 (select v_arrayElimArr_5 .cse2))) (not (= (+ (- 1) .cse3) 1)) (= (* 2 ~N~0) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse4 .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse3 .cse8))))))) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))))) is different from false [2022-07-22 10:52:52,047 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-07-22 10:52:52,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871965005] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:52:52,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:52:52,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 86 [2022-07-22 10:52:52,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467090834] [2022-07-22 10:52:52,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:52:52,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-07-22 10:52:52,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:52:52,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-07-22 10:52:52,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=819, Invalid=5835, Unknown=4, NotChecked=652, Total=7310 [2022-07-22 10:52:52,051 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 86 states, 86 states have (on average 1.302325581395349) internal successors, (112), 86 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:53:27,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:53:27,767 INFO L93 Difference]: Finished difference Result 114 states and 130 transitions. [2022-07-22 10:53:27,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-07-22 10:53:27,768 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 1.302325581395349) internal successors, (112), 86 states have internal predecessors, (112), 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 41 [2022-07-22 10:53:27,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:53:27,768 INFO L225 Difference]: With dead ends: 114 [2022-07-22 10:53:27,769 INFO L226 Difference]: Without dead ends: 94 [2022-07-22 10:53:27,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 120 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 4969 ImplicationChecksByTransitivity, 41.5s TimeCoverageRelationStatistics Valid=1531, Invalid=12287, Unknown=4, NotChecked=940, Total=14762 [2022-07-22 10:53:27,771 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 115 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 1513 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 2267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 1513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 321 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 10:53:27,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 162 Invalid, 2267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 1513 Invalid, 0 Unknown, 321 Unchecked, 2.2s Time] [2022-07-22 10:53:27,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-22 10:53:27,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 65. [2022-07-22 10:53:27,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.140625) internal successors, (73), 64 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:53:27,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2022-07-22 10:53:27,781 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 41 [2022-07-22 10:53:27,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:53:27,781 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2022-07-22 10:53:27,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 1.302325581395349) internal successors, (112), 86 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:53:27,781 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-07-22 10:53:27,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-22 10:53:27,782 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:53:27,782 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:53:27,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-22 10:53:27,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-22 10:53:27,991 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:53:27,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:53:27,992 INFO L85 PathProgramCache]: Analyzing trace with hash 97262195, now seen corresponding path program 3 times [2022-07-22 10:53:27,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:53:27,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383821048] [2022-07-22 10:53:27,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:53:27,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:53:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:53:28,158 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-22 10:53:28,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:53:28,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383821048] [2022-07-22 10:53:28,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383821048] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:53:28,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450275275] [2022-07-22 10:53:28,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 10:53:28,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:53:28,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:53:28,160 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) [2022-07-22 10:53:28,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-22 10:53:28,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-22 10:53:28,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:53:28,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-22 10:53:28,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:53:28,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-22 10:53:28,333 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-22 10:53:28,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34 [2022-07-22 10:53:28,412 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-22 10:53:28,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 56 [2022-07-22 10:53:28,462 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-22 10:53:28,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 47 [2022-07-22 10:53:28,543 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:53:28,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 36 [2022-07-22 10:53:28,702 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 23 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 10:53:28,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:53:49,680 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 23 proven. 20 refuted. 2 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 10:53:49,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450275275] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:53:49,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:53:49,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 17] total 47 [2022-07-22 10:53:49,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595415498] [2022-07-22 10:53:49,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:53:49,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-22 10:53:49,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:53:49,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-22 10:53:49,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=1742, Unknown=17, NotChecked=0, Total=2162 [2022-07-22 10:53:49,682 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 47 states, 47 states have (on average 1.872340425531915) internal successors, (88), 47 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:53:57,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:53:57,851 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2022-07-22 10:53:57,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-22 10:53:57,852 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.872340425531915) internal successors, (88), 47 states have internal predecessors, (88), 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 41 [2022-07-22 10:53:57,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:53:57,852 INFO L225 Difference]: With dead ends: 92 [2022-07-22 10:53:57,852 INFO L226 Difference]: Without dead ends: 72 [2022-07-22 10:53:57,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1418 ImplicationChecksByTransitivity, 29.2s TimeCoverageRelationStatistics Valid=745, Invalid=3391, Unknown=24, NotChecked=0, Total=4160 [2022-07-22 10:53:57,853 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 20 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:53:57,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 59 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 150 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2022-07-22 10:53:57,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-22 10:53:57,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2022-07-22 10:53:57,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 67 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:53:57,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-07-22 10:53:57,863 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 41 [2022-07-22 10:53:57,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:53:57,864 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-07-22 10:53:57,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.872340425531915) internal successors, (88), 47 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:53:57,864 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-07-22 10:53:57,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-22 10:53:57,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:53:57,864 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:53:57,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-22 10:53:58,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:53:58,080 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:53:58,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:53:58,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1027067351, now seen corresponding path program 11 times [2022-07-22 10:53:58,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:53:58,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507288773] [2022-07-22 10:53:58,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:53:58,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:53:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:53:58,153 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 10:53:58,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:53:58,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507288773] [2022-07-22 10:53:58,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507288773] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:53:58,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151282023] [2022-07-22 10:53:58,153 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 10:53:58,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:53:58,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:53:58,155 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) [2022-07-22 10:53:58,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-22 10:53:58,318 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-22 10:53:58,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:53:58,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-22 10:53:58,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:53:58,406 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 10:53:58,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:53:58,448 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 10:53:58,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151282023] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:53:58,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:53:58,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-22 10:53:58,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258831487] [2022-07-22 10:53:58,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:53:58,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-22 10:53:58,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:53:58,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-22 10:53:58,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-22 10:53:58,449 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 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) [2022-07-22 10:53:58,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:53:58,619 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2022-07-22 10:53:58,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 10:53:58,620 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 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 43 [2022-07-22 10:53:58,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:53:58,620 INFO L225 Difference]: With dead ends: 109 [2022-07-22 10:53:58,620 INFO L226 Difference]: Without dead ends: 62 [2022-07-22 10:53:58,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2022-07-22 10:53:58,621 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 111 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:53:58,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 41 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:53:58,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-22 10:53:58,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2022-07-22 10:53:58,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 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) [2022-07-22 10:53:58,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-07-22 10:53:58,628 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 43 [2022-07-22 10:53:58,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:53:58,628 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-07-22 10:53:58,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 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) [2022-07-22 10:53:58,628 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-07-22 10:53:58,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-22 10:53:58,632 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:53:58,632 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:53:58,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-22 10:53:58,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-22 10:53:58,843 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:53:58,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:53:58,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1824213007, now seen corresponding path program 12 times [2022-07-22 10:53:58,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:53:58,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941906718] [2022-07-22 10:53:58,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:53:58,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:53:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:53:58,923 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 32 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-22 10:53:58,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:53:58,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941906718] [2022-07-22 10:53:58,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941906718] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:53:58,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976831294] [2022-07-22 10:53:58,924 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 10:53:58,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:53:58,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:53:58,936 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) [2022-07-22 10:53:58,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-22 10:53:59,044 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-22 10:53:59,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:53:59,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-22 10:53:59,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:53:59,126 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 22 proven. 29 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-22 10:53:59,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:53:59,164 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 22 proven. 29 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-22 10:53:59,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976831294] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:53:59,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:53:59,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-22 10:53:59,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464126530] [2022-07-22 10:53:59,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:53:59,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-22 10:53:59,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:53:59,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-22 10:53:59,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-22 10:53:59,166 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:53:59,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:53:59,359 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-07-22 10:53:59,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-22 10:53:59,360 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 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 46 [2022-07-22 10:53:59,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:53:59,360 INFO L225 Difference]: With dead ends: 61 [2022-07-22 10:53:59,361 INFO L226 Difference]: Without dead ends: 57 [2022-07-22 10:53:59,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2022-07-22 10:53:59,361 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 94 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:53:59,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 30 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:53:59,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-22 10:53:59,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2022-07-22 10:53:59,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:53:59,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-07-22 10:53:59,369 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 46 [2022-07-22 10:53:59,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:53:59,369 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-07-22 10:53:59,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:53:59,369 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-07-22 10:53:59,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-22 10:53:59,369 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:53:59,369 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:53:59,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-07-22 10:53:59,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-22 10:53:59,570 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:53:59,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:53:59,570 INFO L85 PathProgramCache]: Analyzing trace with hash 775276721, now seen corresponding path program 13 times [2022-07-22 10:53:59,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:53:59,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991379304] [2022-07-22 10:53:59,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:53:59,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:53:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:54:01,523 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:54:01,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:54:01,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991379304] [2022-07-22 10:54:01,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991379304] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 10:54:01,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993094643] [2022-07-22 10:54:01,523 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-22 10:54:01,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:54:01,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:54:01,525 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) [2022-07-22 10:54:01,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-22 10:54:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:54:01,606 WARN L261 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 115 conjunts are in the unsatisfiable core [2022-07-22 10:54:01,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:54:01,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 10:54:01,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-22 10:54:01,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 10:54:01,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 10:54:01,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 10:54:01,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 10:54:01,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 10:54:01,897 INFO L390 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 [2022-07-22 10:54:02,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 44 [2022-07-22 10:54:02,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 53 [2022-07-22 10:54:02,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 63 [2022-07-22 10:54:02,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 73 [2022-07-22 10:54:02,818 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:54:02,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 79 [2022-07-22 10:54:02,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,971 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:54:02,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:02,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 78 [2022-07-22 10:54:03,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:03,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:03,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:03,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:03,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:03,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:03,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:03,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:03,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:03,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:03,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:03,149 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:54:03,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:03,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 77 [2022-07-22 10:54:03,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:03,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:03,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:03,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:03,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:03,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:03,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:03,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:03,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:03,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:03,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:03,314 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:54:03,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:54:03,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 79 [2022-07-22 10:54:03,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 67 [2022-07-22 10:54:03,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 43 [2022-07-22 10:54:03,625 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:54:03,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:54:24,593 INFO L356 Elim1Store]: treesize reduction 420, result has 10.4 percent of original size [2022-07-22 10:54:24,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 2897 treesize of output 549 [2022-07-22 10:54:24,655 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse10 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= (select v_arrayElimArr_6 .cse1) 2)) (not (= (+ (- 1) .cse2) 1)) (not (= 2 (select v_arrayElimArr_6 .cse3))) (= (* 2 ~N~0) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse9 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse2 .cse6 .cse7 .cse8 .cse9)))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (= 2 (select v_arrayElimArr_6 .cse10))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-22 10:54:24,731 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse10 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= (select v_arrayElimArr_6 .cse1) 2)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= (+ (- 1) .cse2) 1)) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= 2 (select v_arrayElimArr_6 .cse3))) (= (* 2 ~N~0) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse9 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse2 .cse6 .cse7 .cse8 .cse9)))))))) (not (= 2 (select v_arrayElimArr_6 .cse10)))))) is different from false [2022-07-22 10:54:24,851 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse10 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= (select v_arrayElimArr_6 .cse1) 2)) (not (= (+ (- 1) .cse2) 1)) (not (= 2 (select v_arrayElimArr_6 .cse3))) (= (* 2 ~N~0) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse9 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse2 .cse6 .cse7 .cse8 .cse9)))))))) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (not (= 2 (select v_arrayElimArr_6 .cse10)))))) is different from false [2022-07-22 10:54:24,977 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse10 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= (select v_arrayElimArr_6 .cse1) 2)) (not (= (+ (- 1) .cse2) 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (= 2 (select v_arrayElimArr_6 .cse3))) (= (* 2 ~N~0) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse9 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse2 .cse6 .cse7 .cse8 .cse9)))))))) (not (= 2 (select v_arrayElimArr_6 .cse10))) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))))) is different from false [2022-07-22 10:54:25,109 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse10 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= (select v_arrayElimArr_6 .cse1) 2)) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0)) (not (= (+ (- 1) .cse2) 1)) (not (= 2 (select v_arrayElimArr_6 .cse3))) (= (* 2 ~N~0) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse9 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse2 .cse6 .cse7 .cse8 .cse9)))))))) (not (= 2 (select v_arrayElimArr_6 .cse10))) (< (+ 5 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)))) is different from false [2022-07-22 10:54:25,181 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2022-07-22 10:54:25,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993094643] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:54:25,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 10:54:25,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36, 36] total 99 [2022-07-22 10:54:25,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882858349] [2022-07-22 10:54:25,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 10:54:25,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2022-07-22 10:54:25,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:54:25,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2022-07-22 10:54:25,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=984, Invalid=7773, Unknown=5, NotChecked=940, Total=9702 [2022-07-22 10:54:25,183 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 99 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 99 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:54:41,338 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse40 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse26 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse72 (+ .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse71 (+ .cse40 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse65 (select .cse26 .cse72))) (let ((.cse70 (+ .cse40 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse56 (store .cse26 .cse72 (+ .cse65 1))) (.cse69 (select .cse26 .cse71))) (let ((.cse68 (+ .cse40 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse48 (store .cse56 .cse71 (+ .cse69 1))) (.cse67 (select .cse26 .cse70))) (let ((.cse14 (store .cse48 .cse70 (+ .cse67 1))) (.cse66 (select .cse26 .cse68))) (let ((.cse0 (not (= .cse69 1))) (.cse1 (not (= .cse65 1))) (.cse10 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse11 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse12 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse36 (store .cse14 .cse68 (+ .cse66 1))) (.cse15 (not (= .cse67 1))) (.cse39 (not (= .cse66 1))) (.cse2 (* c_~N~0 2))) (and (or .cse0 .cse1 (= .cse2 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse9 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse7 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (+ .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse6 .cse7 .cse8 .cse9)))))))) .cse15) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (let ((.cse17 (select .cse26 .cse13)) (.cse16 (select .cse26 .cse12)) (.cse18 (select .cse26 .cse10)) (.cse25 (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse27 (select .cse26 .cse11))) (or (not (= .cse16 1)) (not (= .cse17 1)) (not (= .cse18 1)) (= .cse2 (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store (store .cse26 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse25 1)) .cse13 (+ .cse17 1)) .cse12 (+ .cse16 1)) .cse11 (+ .cse27 1)) .cse10 (+ .cse18 1))))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse24 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse25 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse24 .cse25 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse23 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse22 .cse24 .cse25 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (+ .cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse22 .cse23 .cse24 .cse25 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse22 .cse23 .cse24 .cse25 1)))))))) (not (= .cse25 1)) (not (= .cse27 1)))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (let ((.cse37 (+ .cse40 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse38 (select .cse26 .cse37))) (or (= .cse2 (let ((.cse35 (store .cse36 .cse37 (+ .cse38 1)))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse35))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse34 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse31 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse33 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse31 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse32 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse31 .cse33 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (+ (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse31 .cse32 .cse33 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse30 .cse31 .cse32 .cse33 .cse34))))))))) .cse0 .cse1 (not (= .cse38 1)) .cse15 .cse39))) (or .cse0 .cse1 (= .cse2 (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse48))) (let ((.cse45 (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse42 (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse47 (select .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse41 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse43 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse46 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42 .cse43 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (+ .cse41 .cse42 .cse43 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42 .cse43 .cse46 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse46 .cse47))))))))) (or .cse1 (= .cse2 (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse56))) (let ((.cse52 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse50 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse54 (select .cse56 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse53 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse50 .cse54))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse55 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse50 .cse53 .cse54))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse49 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse50 .cse53 .cse54 .cse55))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (+ .cse49 .cse50 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse50 .cse53 .cse54 .cse55))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse53 .cse54 .cse55))))))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or .cse0 .cse1 (= .cse2 (let ((.cse60 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse36))) (let ((.cse61 (select .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse58 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse62 (select .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse63 (select (select (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse62))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse13))) (let ((.cse59 (select (select (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse62 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse57 (select (select (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse58 .cse59 .cse62 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (+ .cse57 .cse58 .cse59 (select (select (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse57 .cse58 .cse59 .cse62 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse62 .cse63)))))))) .cse15 .cse39) (or (let ((.cse64 (+ .cse65 8))) (and (<= .cse2 .cse64) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (<= (+ (div (+ 12 (* (- 1) |c_ULTIMATE.start_main_~a~0#1.offset|)) 4) 2) c_~N~0) (<= .cse64 .cse2))) (< 5 c_~N~0)))))))))) is different from true [2022-07-22 10:55:17,652 WARN L233 SmtUtils]: Spent 26.67s on a formula simplification. DAG size of input: 212 DAG size of output: 207 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 10:55:40,551 WARN L233 SmtUtils]: Spent 11.27s on a formula simplification that was a NOOP. DAG size: 209 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 10:56:25,356 WARN L233 SmtUtils]: Spent 32.33s on a formula simplification. DAG size of input: 232 DAG size of output: 225 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)