./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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/forester-heap/sll-01-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 08:20:40,056 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 08:20:40,058 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 08:20:40,099 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 08:20:40,099 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 08:20:40,102 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 08:20:40,104 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 08:20:40,107 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 08:20:40,109 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 08:20:40,113 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 08:20:40,114 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 08:20:40,115 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 08:20:40,116 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 08:20:40,118 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 08:20:40,120 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 08:20:40,125 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 08:20:40,126 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 08:20:40,127 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 08:20:40,131 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 08:20:40,133 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 08:20:40,136 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 08:20:40,137 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 08:20:40,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 08:20:40,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 08:20:40,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 08:20:40,145 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 08:20:40,146 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 08:20:40,147 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 08:20:40,147 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 08:20:40,148 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 08:20:40,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 08:20:40,150 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 08:20:40,151 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 08:20:40,152 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 08:20:40,153 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 08:20:40,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 08:20:40,154 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 08:20:40,154 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 08:20:40,154 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 08:20:40,155 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 08:20:40,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 08:20:40,156 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 08:20:40,187 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 08:20:40,188 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 08:20:40,188 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 08:20:40,188 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 08:20:40,189 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 08:20:40,189 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 08:20:40,189 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 08:20:40,190 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 08:20:40,190 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 08:20:40,190 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 08:20:40,190 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 08:20:40,190 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 08:20:40,191 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 08:20:40,191 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 08:20:40,191 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 08:20:40,191 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 08:20:40,191 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 08:20:40,192 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 08:20:40,192 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 08:20:40,192 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 08:20:40,192 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 08:20:40,192 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 08:20:40,193 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 08:20:40,193 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 08:20:40,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 08:20:40,193 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 08:20:40,193 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 08:20:40,194 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 08:20:40,194 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 08:20:40,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 08:20:40,194 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 08:20:40,194 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 08:20:40,195 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 08:20:40,195 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 08:20:40,195 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 -> ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d [2021-12-17 08:20:40,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 08:20:40,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 08:20:40,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 08:20:40,432 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 08:20:40,433 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 08:20:40,434 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-1.i [2021-12-17 08:20:40,495 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d78880dc0/df2e8d5a102b4acb9942d9492123e51c/FLAG47ca6fb35 [2021-12-17 08:20:40,939 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 08:20:40,939 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i [2021-12-17 08:20:40,961 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d78880dc0/df2e8d5a102b4acb9942d9492123e51c/FLAG47ca6fb35 [2021-12-17 08:20:41,484 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d78880dc0/df2e8d5a102b4acb9942d9492123e51c [2021-12-17 08:20:41,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 08:20:41,487 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 08:20:41,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 08:20:41,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 08:20:41,491 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 08:20:41,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 08:20:41" (1/1) ... [2021-12-17 08:20:41,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6479e36c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:20:41, skipping insertion in model container [2021-12-17 08:20:41,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 08:20:41" (1/1) ... [2021-12-17 08:20:41,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 08:20:41,543 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 08:20:41,744 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/forester-heap/sll-01-1.i[22034,22047] [2021-12-17 08:20:41,749 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/forester-heap/sll-01-1.i[22307,22320] [2021-12-17 08:20:41,756 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/forester-heap/sll-01-1.i[22516,22529] [2021-12-17 08:20:41,757 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/forester-heap/sll-01-1.i[22586,22599] [2021-12-17 08:20:41,759 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/forester-heap/sll-01-1.i[22853,22866] [2021-12-17 08:20:41,761 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/forester-heap/sll-01-1.i[22961,22974] [2021-12-17 08:20:41,763 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/forester-heap/sll-01-1.i[23192,23205] [2021-12-17 08:20:41,765 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/forester-heap/sll-01-1.i[23272,23285] [2021-12-17 08:20:41,766 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/forester-heap/sll-01-1.i[23351,23364] [2021-12-17 08:20:41,767 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/forester-heap/sll-01-1.i[23441,23454] [2021-12-17 08:20:41,769 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/forester-heap/sll-01-1.i[23619,23632] [2021-12-17 08:20:41,770 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/forester-heap/sll-01-1.i[23697,23710] [2021-12-17 08:20:41,771 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/forester-heap/sll-01-1.i[23774,23787] [2021-12-17 08:20:41,778 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 08:20:41,784 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 08:20:41,832 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/forester-heap/sll-01-1.i[22034,22047] [2021-12-17 08:20:41,834 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/forester-heap/sll-01-1.i[22307,22320] [2021-12-17 08:20:41,835 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/forester-heap/sll-01-1.i[22516,22529] [2021-12-17 08:20:41,836 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/forester-heap/sll-01-1.i[22586,22599] [2021-12-17 08:20:41,837 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/forester-heap/sll-01-1.i[22853,22866] [2021-12-17 08:20:41,838 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/forester-heap/sll-01-1.i[22961,22974] [2021-12-17 08:20:41,839 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/forester-heap/sll-01-1.i[23192,23205] [2021-12-17 08:20:41,840 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/forester-heap/sll-01-1.i[23272,23285] [2021-12-17 08:20:41,841 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/forester-heap/sll-01-1.i[23351,23364] [2021-12-17 08:20:41,841 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/forester-heap/sll-01-1.i[23441,23454] [2021-12-17 08:20:41,842 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/forester-heap/sll-01-1.i[23619,23632] [2021-12-17 08:20:41,843 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/forester-heap/sll-01-1.i[23697,23710] [2021-12-17 08:20:41,844 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/forester-heap/sll-01-1.i[23774,23787] [2021-12-17 08:20:41,845 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 08:20:41,865 INFO L208 MainTranslator]: Completed translation [2021-12-17 08:20:41,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:20:41 WrapperNode [2021-12-17 08:20:41,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 08:20:41,866 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 08:20:41,866 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 08:20:41,867 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 08:20:41,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:20:41" (1/1) ... [2021-12-17 08:20:41,884 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:20:41" (1/1) ... [2021-12-17 08:20:41,904 INFO L137 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 221 [2021-12-17 08:20:41,905 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 08:20:41,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 08:20:41,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 08:20:41,906 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 08:20:41,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:20:41" (1/1) ... [2021-12-17 08:20:41,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:20:41" (1/1) ... [2021-12-17 08:20:41,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:20:41" (1/1) ... [2021-12-17 08:20:41,916 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:20:41" (1/1) ... [2021-12-17 08:20:41,923 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:20:41" (1/1) ... [2021-12-17 08:20:41,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:20:41" (1/1) ... [2021-12-17 08:20:41,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:20:41" (1/1) ... [2021-12-17 08:20:41,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 08:20:41,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 08:20:41,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 08:20:41,934 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 08:20:41,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:20:41" (1/1) ... [2021-12-17 08:20:41,941 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 08:20:41,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:20:41,968 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 08:20:41,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 08:20:42,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 08:20:42,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 08:20:42,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-17 08:20:42,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-17 08:20:42,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 08:20:42,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 08:20:42,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 08:20:42,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 08:20:42,088 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 08:20:42,089 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 08:20:42,381 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 08:20:42,387 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 08:20:42,387 INFO L301 CfgBuilder]: Removed 30 assume(true) statements. [2021-12-17 08:20:42,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 08:20:42 BoogieIcfgContainer [2021-12-17 08:20:42,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 08:20:42,391 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 08:20:42,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 08:20:42,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 08:20:42,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 08:20:41" (1/3) ... [2021-12-17 08:20:42,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@653c1d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 08:20:42, skipping insertion in model container [2021-12-17 08:20:42,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:20:41" (2/3) ... [2021-12-17 08:20:42,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@653c1d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 08:20:42, skipping insertion in model container [2021-12-17 08:20:42,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 08:20:42" (3/3) ... [2021-12-17 08:20:42,400 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2021-12-17 08:20:42,406 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 08:20:42,406 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2021-12-17 08:20:42,454 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 08:20:42,463 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 08:20:42,464 INFO L340 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2021-12-17 08:20:42,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:42,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-17 08:20:42,499 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:20:42,500 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-17 08:20:42,507 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:20:42,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:20:42,512 INFO L85 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2021-12-17 08:20:42,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:20:42,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086784837] [2021-12-17 08:20:42,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:20:42,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:20:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:20:42,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:20:42,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:20:42,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086784837] [2021-12-17 08:20:42,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086784837] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:20:42,653 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:20:42,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 08:20:42,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666961852] [2021-12-17 08:20:42,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:20:42,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 08:20:42,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:20:42,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 08:20:42,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:20:42,687 INFO L87 Difference]: Start difference. First operand has 83 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 82 states have internal predecessors, (135), 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 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:42,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:20:42,753 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2021-12-17 08:20:42,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 08:20:42,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2021-12-17 08:20:42,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:20:42,762 INFO L225 Difference]: With dead ends: 180 [2021-12-17 08:20:42,763 INFO L226 Difference]: Without dead ends: 95 [2021-12-17 08:20:42,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:20:42,768 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 83 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:20:42,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 102 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:20:42,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-17 08:20:42,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2021-12-17 08:20:42,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.323076923076923) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:42,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2021-12-17 08:20:42,798 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 4 [2021-12-17 08:20:42,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:20:42,798 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2021-12-17 08:20:42,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:42,799 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2021-12-17 08:20:42,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-17 08:20:42,799 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:20:42,799 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:20:42,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 08:20:42,800 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:20:42,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:20:42,801 INFO L85 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2021-12-17 08:20:42,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:20:42,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567932877] [2021-12-17 08:20:42,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:20:42,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:20:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:20:42,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:20:42,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:20:42,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567932877] [2021-12-17 08:20:42,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567932877] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:20:42,843 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:20:42,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 08:20:42,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81690017] [2021-12-17 08:20:42,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:20:42,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 08:20:42,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:20:42,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 08:20:42,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:20:42,846 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:42,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:20:42,858 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2021-12-17 08:20:42,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 08:20:42,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-17 08:20:42,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:20:42,868 INFO L225 Difference]: With dead ends: 80 [2021-12-17 08:20:42,868 INFO L226 Difference]: Without dead ends: 78 [2021-12-17 08:20:42,869 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:20:42,870 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:20:42,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:20:42,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-17 08:20:42,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-12-17 08:20:42,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 77 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:42,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2021-12-17 08:20:42,878 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 10 [2021-12-17 08:20:42,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:20:42,878 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2021-12-17 08:20:42,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:42,878 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2021-12-17 08:20:42,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-17 08:20:42,879 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:20:42,879 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:20:42,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 08:20:42,880 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:20:42,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:20:42,880 INFO L85 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2021-12-17 08:20:42,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:20:42,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664784561] [2021-12-17 08:20:42,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:20:42,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:20:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:20:42,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:20:42,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:20:42,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664784561] [2021-12-17 08:20:42,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664784561] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:20:42,945 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:20:42,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 08:20:42,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491862805] [2021-12-17 08:20:42,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:20:42,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 08:20:42,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:20:42,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 08:20:42,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 08:20:42,947 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:43,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:20:43,011 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2021-12-17 08:20:43,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 08:20:43,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-17 08:20:43,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:20:43,013 INFO L225 Difference]: With dead ends: 79 [2021-12-17 08:20:43,014 INFO L226 Difference]: Without dead ends: 77 [2021-12-17 08:20:43,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 08:20:43,016 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:20:43,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 219 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 08:20:43,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-17 08:20:43,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2021-12-17 08:20:43,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 64 states have (on average 1.3125) internal successors, (84), 74 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:43,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2021-12-17 08:20:43,026 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 10 [2021-12-17 08:20:43,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:20:43,026 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2021-12-17 08:20:43,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:43,027 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2021-12-17 08:20:43,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-17 08:20:43,028 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:20:43,028 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:20:43,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 08:20:43,028 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:20:43,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:20:43,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1712619113, now seen corresponding path program 1 times [2021-12-17 08:20:43,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:20:43,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741880329] [2021-12-17 08:20:43,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:20:43,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:20:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:20:43,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:20:43,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:20:43,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741880329] [2021-12-17 08:20:43,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741880329] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:20:43,114 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:20:43,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 08:20:43,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333424972] [2021-12-17 08:20:43,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:20:43,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 08:20:43,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:20:43,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 08:20:43,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:20:43,118 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:43,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:20:43,174 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2021-12-17 08:20:43,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 08:20:43,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-17 08:20:43,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:20:43,175 INFO L225 Difference]: With dead ends: 78 [2021-12-17 08:20:43,176 INFO L226 Difference]: Without dead ends: 74 [2021-12-17 08:20:43,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:20:43,177 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 16 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:20:43,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 125 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:20:43,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-12-17 08:20:43,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2021-12-17 08:20:43,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 70 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:43,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2021-12-17 08:20:43,194 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 15 [2021-12-17 08:20:43,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:20:43,195 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2021-12-17 08:20:43,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:43,195 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2021-12-17 08:20:43,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-17 08:20:43,196 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:20:43,197 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:20:43,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 08:20:43,197 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:20:43,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:20:43,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1551589151, now seen corresponding path program 1 times [2021-12-17 08:20:43,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:20:43,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606587909] [2021-12-17 08:20:43,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:20:43,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:20:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:20:43,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:20:43,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:20:43,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606587909] [2021-12-17 08:20:43,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606587909] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:20:43,258 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:20:43,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 08:20:43,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432900505] [2021-12-17 08:20:43,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:20:43,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 08:20:43,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:20:43,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 08:20:43,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 08:20:43,265 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:43,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:20:43,358 INFO L93 Difference]: Finished difference Result 187 states and 209 transitions. [2021-12-17 08:20:43,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 08:20:43,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-17 08:20:43,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:20:43,360 INFO L225 Difference]: With dead ends: 187 [2021-12-17 08:20:43,360 INFO L226 Difference]: Without dead ends: 124 [2021-12-17 08:20:43,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 08:20:43,361 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 55 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:20:43,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 187 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 08:20:43,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-12-17 08:20:43,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 73. [2021-12-17 08:20:43,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 64 states have (on average 1.28125) internal successors, (82), 72 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:43,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2021-12-17 08:20:43,368 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 16 [2021-12-17 08:20:43,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:20:43,368 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2021-12-17 08:20:43,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:43,369 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2021-12-17 08:20:43,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-17 08:20:43,369 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:20:43,369 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:20:43,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 08:20:43,370 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:20:43,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:20:43,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2063319775, now seen corresponding path program 1 times [2021-12-17 08:20:43,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:20:43,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886823054] [2021-12-17 08:20:43,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:20:43,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:20:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:20:43,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:20:43,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:20:43,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886823054] [2021-12-17 08:20:43,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886823054] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:20:43,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:20:43,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 08:20:43,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556683961] [2021-12-17 08:20:43,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:20:43,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 08:20:43,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:20:43,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 08:20:43,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 08:20:43,426 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:43,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:20:43,488 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2021-12-17 08:20:43,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 08:20:43,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-17 08:20:43,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:20:43,490 INFO L225 Difference]: With dead ends: 132 [2021-12-17 08:20:43,490 INFO L226 Difference]: Without dead ends: 112 [2021-12-17 08:20:43,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 08:20:43,492 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 128 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:20:43,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 116 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:20:43,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-12-17 08:20:43,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 72. [2021-12-17 08:20:43,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 64 states have (on average 1.265625) internal successors, (81), 71 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:43,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2021-12-17 08:20:43,522 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 16 [2021-12-17 08:20:43,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:20:43,523 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2021-12-17 08:20:43,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:43,523 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2021-12-17 08:20:43,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-17 08:20:43,524 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:20:43,524 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:20:43,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-17 08:20:43,524 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:20:43,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:20:43,525 INFO L85 PathProgramCache]: Analyzing trace with hash -940628212, now seen corresponding path program 1 times [2021-12-17 08:20:43,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:20:43,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985679117] [2021-12-17 08:20:43,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:20:43,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:20:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:20:43,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:20:43,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:20:43,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985679117] [2021-12-17 08:20:43,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985679117] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:20:43,563 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:20:43,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 08:20:43,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339723674] [2021-12-17 08:20:43,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:20:43,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 08:20:43,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:20:43,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 08:20:43,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:20:43,565 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:43,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:20:43,575 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2021-12-17 08:20:43,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 08:20:43,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 [2021-12-17 08:20:43,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:20:43,576 INFO L225 Difference]: With dead ends: 137 [2021-12-17 08:20:43,577 INFO L226 Difference]: Without dead ends: 96 [2021-12-17 08:20:43,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:20:43,578 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 24 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:20:43,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 149 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:20:43,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-17 08:20:43,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2021-12-17 08:20:43,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 74 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:43,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2021-12-17 08:20:43,582 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 20 [2021-12-17 08:20:43,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:20:43,582 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2021-12-17 08:20:43,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:43,583 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2021-12-17 08:20:43,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-17 08:20:43,583 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:20:43,584 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:20:43,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-17 08:20:43,584 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:20:43,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:20:43,585 INFO L85 PathProgramCache]: Analyzing trace with hash 905291998, now seen corresponding path program 1 times [2021-12-17 08:20:43,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:20:43,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616778107] [2021-12-17 08:20:43,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:20:43,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:20:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:20:43,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:20:43,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:20:43,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616778107] [2021-12-17 08:20:43,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616778107] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:20:43,618 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:20:43,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 08:20:43,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922984177] [2021-12-17 08:20:43,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:20:43,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 08:20:43,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:20:43,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 08:20:43,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:20:43,620 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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) [2021-12-17 08:20:43,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:20:43,629 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2021-12-17 08:20:43,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 08:20:43,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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) Word has length 21 [2021-12-17 08:20:43,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:20:43,630 INFO L225 Difference]: With dead ends: 75 [2021-12-17 08:20:43,630 INFO L226 Difference]: Without dead ends: 73 [2021-12-17 08:20:43,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:20:43,631 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 13 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:20:43,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 129 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:20:43,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-17 08:20:43,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-12-17 08:20:43,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 72 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:43,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2021-12-17 08:20:43,635 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 21 [2021-12-17 08:20:43,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:20:43,635 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2021-12-17 08:20:43,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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) [2021-12-17 08:20:43,636 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2021-12-17 08:20:43,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-17 08:20:43,636 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:20:43,636 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:20:43,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-17 08:20:43,637 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:20:43,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:20:43,637 INFO L85 PathProgramCache]: Analyzing trace with hash 886650935, now seen corresponding path program 1 times [2021-12-17 08:20:43,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:20:43,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020891450] [2021-12-17 08:20:43,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:20:43,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:20:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:20:43,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:20:43,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:20:43,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020891450] [2021-12-17 08:20:43,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020891450] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:20:43,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:20:43,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 08:20:43,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132605310] [2021-12-17 08:20:43,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:20:43,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 08:20:43,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:20:43,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 08:20:43,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 08:20:43,712 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:43,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:20:43,767 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2021-12-17 08:20:43,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 08:20:43,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-17 08:20:43,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:20:43,769 INFO L225 Difference]: With dead ends: 74 [2021-12-17 08:20:43,769 INFO L226 Difference]: Without dead ends: 72 [2021-12-17 08:20:43,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 08:20:43,771 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:20:43,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:20:43,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-17 08:20:43,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2021-12-17 08:20:43,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 70 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:43,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2021-12-17 08:20:43,775 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 23 [2021-12-17 08:20:43,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:20:43,775 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2021-12-17 08:20:43,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:43,775 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2021-12-17 08:20:43,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-17 08:20:43,776 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:20:43,776 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:20:43,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-17 08:20:43,777 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:20:43,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:20:43,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1458355201, now seen corresponding path program 1 times [2021-12-17 08:20:43,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:20:43,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765466254] [2021-12-17 08:20:43,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:20:43,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:20:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:20:43,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:20:43,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:20:43,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765466254] [2021-12-17 08:20:43,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765466254] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:20:43,847 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:20:43,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 08:20:43,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305115260] [2021-12-17 08:20:43,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:20:43,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 08:20:43,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:20:43,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 08:20:43,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-17 08:20:43,849 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:44,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:20:44,019 INFO L93 Difference]: Finished difference Result 175 states and 199 transitions. [2021-12-17 08:20:44,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 08:20:44,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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) Word has length 24 [2021-12-17 08:20:44,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:20:44,025 INFO L225 Difference]: With dead ends: 175 [2021-12-17 08:20:44,025 INFO L226 Difference]: Without dead ends: 133 [2021-12-17 08:20:44,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-12-17 08:20:44,026 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 115 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:20:44,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 281 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 08:20:44,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-17 08:20:44,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 81. [2021-12-17 08:20:44,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 80 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:44,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2021-12-17 08:20:44,033 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 24 [2021-12-17 08:20:44,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:20:44,033 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2021-12-17 08:20:44,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:44,034 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2021-12-17 08:20:44,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-17 08:20:44,036 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:20:44,036 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:20:44,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-17 08:20:44,037 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:20:44,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:20:44,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1357759361, now seen corresponding path program 1 times [2021-12-17 08:20:44,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:20:44,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952372992] [2021-12-17 08:20:44,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:20:44,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:20:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:20:44,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:20:44,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:20:44,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952372992] [2021-12-17 08:20:44,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952372992] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:20:44,267 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:20:44,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 08:20:44,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160281257] [2021-12-17 08:20:44,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:20:44,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 08:20:44,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:20:44,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 08:20:44,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 08:20:44,269 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:44,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:20:44,599 INFO L93 Difference]: Finished difference Result 234 states and 259 transitions. [2021-12-17 08:20:44,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 08:20:44,600 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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) Word has length 24 [2021-12-17 08:20:44,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:20:44,602 INFO L225 Difference]: With dead ends: 234 [2021-12-17 08:20:44,602 INFO L226 Difference]: Without dead ends: 232 [2021-12-17 08:20:44,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-12-17 08:20:44,603 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 243 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 08:20:44,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 420 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 08:20:44,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-12-17 08:20:44,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 93. [2021-12-17 08:20:44,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 92 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:44,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2021-12-17 08:20:44,609 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 24 [2021-12-17 08:20:44,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:20:44,610 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2021-12-17 08:20:44,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:44,610 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2021-12-17 08:20:44,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-17 08:20:44,611 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:20:44,611 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:20:44,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-17 08:20:44,615 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:20:44,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:20:44,616 INFO L85 PathProgramCache]: Analyzing trace with hash 680714775, now seen corresponding path program 1 times [2021-12-17 08:20:44,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:20:44,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320505970] [2021-12-17 08:20:44,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:20:44,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:20:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:20:44,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 08:20:44,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:20:44,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320505970] [2021-12-17 08:20:44,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320505970] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:20:44,712 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:20:44,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 08:20:44,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478594206] [2021-12-17 08:20:44,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:20:44,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 08:20:44,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:20:44,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 08:20:44,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-17 08:20:44,714 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:44,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:20:44,793 INFO L93 Difference]: Finished difference Result 139 states and 158 transitions. [2021-12-17 08:20:44,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 08:20:44,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-17 08:20:44,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:20:44,794 INFO L225 Difference]: With dead ends: 139 [2021-12-17 08:20:44,794 INFO L226 Difference]: Without dead ends: 121 [2021-12-17 08:20:44,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-17 08:20:44,796 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 57 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:20:44,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 186 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 08:20:44,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-17 08:20:44,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 113. [2021-12-17 08:20:44,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 107 states have (on average 1.2429906542056075) internal successors, (133), 112 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:44,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 133 transitions. [2021-12-17 08:20:44,803 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 133 transitions. Word has length 26 [2021-12-17 08:20:44,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:20:44,803 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 133 transitions. [2021-12-17 08:20:44,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:44,803 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 133 transitions. [2021-12-17 08:20:44,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-17 08:20:44,807 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:20:44,807 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:20:44,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-17 08:20:44,808 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:20:44,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:20:44,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1502606953, now seen corresponding path program 1 times [2021-12-17 08:20:44,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:20:44,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011908187] [2021-12-17 08:20:44,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:20:44,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:20:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:20:44,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 08:20:44,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:20:44,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011908187] [2021-12-17 08:20:44,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011908187] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:20:44,881 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:20:44,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 08:20:44,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310107212] [2021-12-17 08:20:44,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:20:44,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 08:20:44,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:20:44,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 08:20:44,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:20:44,883 INFO L87 Difference]: Start difference. First operand 113 states and 133 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:44,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:20:44,919 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2021-12-17 08:20:44,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 08:20:44,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-17 08:20:44,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:20:44,921 INFO L225 Difference]: With dead ends: 113 [2021-12-17 08:20:44,921 INFO L226 Difference]: Without dead ends: 111 [2021-12-17 08:20:44,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:20:44,923 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 49 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:20:44,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 76 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:20:44,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-17 08:20:44,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-12-17 08:20:44,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.2358490566037736) internal successors, (131), 110 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:44,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions. [2021-12-17 08:20:44,929 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 131 transitions. Word has length 26 [2021-12-17 08:20:44,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:20:44,929 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 131 transitions. [2021-12-17 08:20:44,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:44,930 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 131 transitions. [2021-12-17 08:20:44,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-17 08:20:44,931 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:20:44,931 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:20:44,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-17 08:20:44,932 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:20:44,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:20:44,932 INFO L85 PathProgramCache]: Analyzing trace with hash -988757936, now seen corresponding path program 1 times [2021-12-17 08:20:44,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:20:44,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078824578] [2021-12-17 08:20:44,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:20:44,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:20:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:20:45,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:20:45,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:20:45,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078824578] [2021-12-17 08:20:45,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078824578] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:20:45,134 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:20:45,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 08:20:45,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975963740] [2021-12-17 08:20:45,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:20:45,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 08:20:45,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:20:45,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 08:20:45,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 08:20:45,137 INFO L87 Difference]: Start difference. First operand 111 states and 131 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:45,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:20:45,425 INFO L93 Difference]: Finished difference Result 268 states and 308 transitions. [2021-12-17 08:20:45,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 08:20:45,425 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-17 08:20:45,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:20:45,427 INFO L225 Difference]: With dead ends: 268 [2021-12-17 08:20:45,427 INFO L226 Difference]: Without dead ends: 266 [2021-12-17 08:20:45,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-12-17 08:20:45,428 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 248 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 08:20:45,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 384 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 08:20:45,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-12-17 08:20:45,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 114. [2021-12-17 08:20:45,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 109 states have (on average 1.2293577981651376) internal successors, (134), 113 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:45,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2021-12-17 08:20:45,434 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 27 [2021-12-17 08:20:45,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:20:45,435 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2021-12-17 08:20:45,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:45,435 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2021-12-17 08:20:45,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-17 08:20:45,435 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:20:45,435 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:20:45,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-17 08:20:45,436 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:20:45,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:20:45,436 INFO L85 PathProgramCache]: Analyzing trace with hash -937634650, now seen corresponding path program 1 times [2021-12-17 08:20:45,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:20:45,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373575955] [2021-12-17 08:20:45,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:20:45,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:20:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:20:45,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:20:45,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:20:45,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373575955] [2021-12-17 08:20:45,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373575955] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:20:45,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736664225] [2021-12-17 08:20:45,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:20:45,485 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:20:45,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:20:45,487 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 08:20:45,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 08:20:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:20:45,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-17 08:20:45,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:20:45,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 08:20:45,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 08:20:45,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:20:45,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-17 08:20:45,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:20:45,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-17 08:20:45,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 08:20:45,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 08:20:45,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:20:45,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:20:46,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:20:46,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736664225] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 08:20:46,097 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 08:20:46,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2021-12-17 08:20:46,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424107741] [2021-12-17 08:20:46,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 08:20:46,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 08:20:46,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:20:46,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 08:20:46,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-17 08:20:46,100 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:46,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:20:46,224 INFO L93 Difference]: Finished difference Result 199 states and 229 transitions. [2021-12-17 08:20:46,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 08:20:46,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-17 08:20:46,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:20:46,226 INFO L225 Difference]: With dead ends: 199 [2021-12-17 08:20:46,226 INFO L226 Difference]: Without dead ends: 139 [2021-12-17 08:20:46,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-17 08:20:46,228 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 147 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:20:46,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 166 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 08:20:46,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-12-17 08:20:46,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 116. [2021-12-17 08:20:46,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.2072072072072073) internal successors, (134), 115 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:46,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2021-12-17 08:20:46,239 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 29 [2021-12-17 08:20:46,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:20:46,240 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2021-12-17 08:20:46,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:46,240 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2021-12-17 08:20:46,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-17 08:20:46,241 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:20:46,241 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:20:46,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-17 08:20:46,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-17 08:20:46,465 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:20:46,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:20:46,466 INFO L85 PathProgramCache]: Analyzing trace with hash -2010394174, now seen corresponding path program 1 times [2021-12-17 08:20:46,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:20:46,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966724229] [2021-12-17 08:20:46,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:20:46,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:20:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:20:46,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:20:46,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:20:46,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966724229] [2021-12-17 08:20:46,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966724229] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:20:46,618 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:20:46,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 08:20:46,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827128930] [2021-12-17 08:20:46,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:20:46,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 08:20:46,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:20:46,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 08:20:46,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-17 08:20:46,620 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:46,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:20:46,736 INFO L93 Difference]: Finished difference Result 159 states and 176 transitions. [2021-12-17 08:20:46,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 08:20:46,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-17 08:20:46,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:20:46,737 INFO L225 Difference]: With dead ends: 159 [2021-12-17 08:20:46,737 INFO L226 Difference]: Without dead ends: 139 [2021-12-17 08:20:46,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-17 08:20:46,738 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 152 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:20:46,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 200 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 08:20:46,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-12-17 08:20:46,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 115. [2021-12-17 08:20:46,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.2) internal successors, (132), 114 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:46,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 132 transitions. [2021-12-17 08:20:46,745 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 132 transitions. Word has length 29 [2021-12-17 08:20:46,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:20:46,745 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 132 transitions. [2021-12-17 08:20:46,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:46,745 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 132 transitions. [2021-12-17 08:20:46,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-17 08:20:46,746 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:20:46,746 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:20:46,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-17 08:20:46,746 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:20:46,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:20:46,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1521997910, now seen corresponding path program 1 times [2021-12-17 08:20:46,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:20:46,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691234633] [2021-12-17 08:20:46,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:20:46,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:20:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:20:46,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:20:46,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:20:46,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691234633] [2021-12-17 08:20:46,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691234633] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:20:46,791 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:20:46,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 08:20:46,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510777675] [2021-12-17 08:20:46,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:20:46,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 08:20:46,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:20:46,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 08:20:46,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:20:46,794 INFO L87 Difference]: Start difference. First operand 115 states and 132 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:46,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:20:46,807 INFO L93 Difference]: Finished difference Result 220 states and 257 transitions. [2021-12-17 08:20:46,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 08:20:46,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-17 08:20:46,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:20:46,808 INFO L225 Difference]: With dead ends: 220 [2021-12-17 08:20:46,809 INFO L226 Difference]: Without dead ends: 165 [2021-12-17 08:20:46,811 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:20:46,811 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 26 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:20:46,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 164 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:20:46,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-12-17 08:20:46,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 138. [2021-12-17 08:20:46,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 133 states have (on average 1.2105263157894737) internal successors, (161), 137 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:46,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 161 transitions. [2021-12-17 08:20:46,818 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 161 transitions. Word has length 31 [2021-12-17 08:20:46,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:20:46,819 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 161 transitions. [2021-12-17 08:20:46,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:46,819 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 161 transitions. [2021-12-17 08:20:46,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-17 08:20:46,820 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:20:46,820 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:20:46,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-17 08:20:46,820 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:20:46,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:20:46,822 INFO L85 PathProgramCache]: Analyzing trace with hash 914215427, now seen corresponding path program 1 times [2021-12-17 08:20:46,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:20:46,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578807960] [2021-12-17 08:20:46,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:20:46,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:20:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:20:46,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:20:46,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:20:46,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578807960] [2021-12-17 08:20:46,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578807960] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:20:46,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768322106] [2021-12-17 08:20:46,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:20:46,919 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:20:46,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:20:46,921 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 08:20:46,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 08:20:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:20:47,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-17 08:20:47,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:20:47,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 08:20:47,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 08:20:47,103 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-17 08:20:47,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-17 08:20:47,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:20:47,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-17 08:20:47,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 08:20:47,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 08:20:47,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 08:20:47,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:20:47,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 08:20:47,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768322106] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 08:20:47,347 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 08:20:47,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2021-12-17 08:20:47,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019667896] [2021-12-17 08:20:47,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 08:20:47,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 08:20:47,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:20:47,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 08:20:47,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 08:20:47,349 INFO L87 Difference]: Start difference. First operand 138 states and 161 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:47,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:20:47,493 INFO L93 Difference]: Finished difference Result 247 states and 282 transitions. [2021-12-17 08:20:47,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 08:20:47,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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 [2021-12-17 08:20:47,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:20:47,494 INFO L225 Difference]: With dead ends: 247 [2021-12-17 08:20:47,494 INFO L226 Difference]: Without dead ends: 216 [2021-12-17 08:20:47,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-17 08:20:47,495 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 95 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:20:47,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 286 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 08:20:47,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-12-17 08:20:47,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 165. [2021-12-17 08:20:47,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 160 states have (on average 1.2375) internal successors, (198), 164 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:47,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 198 transitions. [2021-12-17 08:20:47,500 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 198 transitions. Word has length 32 [2021-12-17 08:20:47,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:20:47,500 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 198 transitions. [2021-12-17 08:20:47,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:47,501 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 198 transitions. [2021-12-17 08:20:47,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-17 08:20:47,501 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:20:47,501 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:20:47,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 08:20:47,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-17 08:20:47,720 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:20:47,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:20:47,720 INFO L85 PathProgramCache]: Analyzing trace with hash 191981961, now seen corresponding path program 1 times [2021-12-17 08:20:47,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:20:47,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791448246] [2021-12-17 08:20:47,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:20:47,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:20:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:20:47,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:20:47,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:20:47,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791448246] [2021-12-17 08:20:47,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791448246] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:20:47,799 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:20:47,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 08:20:47,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522077634] [2021-12-17 08:20:47,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:20:47,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 08:20:47,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:20:47,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 08:20:47,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 08:20:47,801 INFO L87 Difference]: Start difference. First operand 165 states and 198 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:47,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:20:47,864 INFO L93 Difference]: Finished difference Result 231 states and 274 transitions. [2021-12-17 08:20:47,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 08:20:47,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-17 08:20:47,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:20:47,866 INFO L225 Difference]: With dead ends: 231 [2021-12-17 08:20:47,866 INFO L226 Difference]: Without dead ends: 117 [2021-12-17 08:20:47,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 08:20:47,868 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 24 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:20:47,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 188 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 08:20:47,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-17 08:20:47,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-12-17 08:20:47,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 113 states have (on average 1.1592920353982301) internal successors, (131), 116 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:47,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2021-12-17 08:20:47,874 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 35 [2021-12-17 08:20:47,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:20:47,874 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2021-12-17 08:20:47,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:47,875 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2021-12-17 08:20:47,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-17 08:20:47,875 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:20:47,875 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:20:47,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-17 08:20:47,876 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:20:47,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:20:47,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1562646056, now seen corresponding path program 1 times [2021-12-17 08:20:47,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:20:47,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274840577] [2021-12-17 08:20:47,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:20:47,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:20:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:20:48,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:20:48,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:20:48,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274840577] [2021-12-17 08:20:48,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274840577] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:20:48,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145176986] [2021-12-17 08:20:48,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:20:48,049 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:20:48,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:20:48,050 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 08:20:48,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 08:20:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:20:48,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-17 08:20:48,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:20:48,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 08:20:48,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 08:20:48,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 08:20:48,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:20:48,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2021-12-17 08:20:48,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:20:48,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2021-12-17 08:20:48,327 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 08:20:48,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-17 08:20:48,347 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 08:20:48,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-17 08:20:48,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 08:20:48,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 08:20:48,379 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 08:20:48,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-17 08:20:48,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-17 08:20:48,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-17 08:20:48,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 08:20:48,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 08:20:48,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:20:48,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:20:48,648 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_976 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_976) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0)) (forall ((v_ArrVal_977 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_977) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0))) is different from false [2021-12-17 08:20:49,319 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:20:49,323 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:20:49,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 57 [2021-12-17 08:20:49,328 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:20:49,331 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:20:49,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 62 [2021-12-17 08:20:49,337 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:20:49,339 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:20:49,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 60 [2021-12-17 08:20:49,343 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:20:49,346 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:20:49,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 58 [2021-12-17 08:20:49,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2021-12-17 08:20:49,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-12-17 08:20:49,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:20:49,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145176986] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 08:20:49,387 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 08:20:49,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2021-12-17 08:20:49,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789497578] [2021-12-17 08:20:49,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 08:20:49,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-17 08:20:49,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:20:49,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-17 08:20:49,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=184, Unknown=2, NotChecked=28, Total=272 [2021-12-17 08:20:49,389 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 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) [2021-12-17 08:20:49,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:20:49,819 INFO L93 Difference]: Finished difference Result 278 states and 311 transitions. [2021-12-17 08:20:49,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-17 08:20:49,820 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 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) Word has length 36 [2021-12-17 08:20:49,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:20:49,821 INFO L225 Difference]: With dead ends: 278 [2021-12-17 08:20:49,821 INFO L226 Difference]: Without dead ends: 218 [2021-12-17 08:20:49,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=431, Unknown=2, NotChecked=44, Total=600 [2021-12-17 08:20:49,822 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 189 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 08:20:49,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 593 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 300 Invalid, 0 Unknown, 173 Unchecked, 0.2s Time] [2021-12-17 08:20:49,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-12-17 08:20:49,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 138. [2021-12-17 08:20:49,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 134 states have (on average 1.1567164179104477) internal successors, (155), 137 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:20:49,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 155 transitions. [2021-12-17 08:20:49,829 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 155 transitions. Word has length 36 [2021-12-17 08:20:49,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:20:49,829 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 155 transitions. [2021-12-17 08:20:49,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 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) [2021-12-17 08:20:49,829 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 155 transitions. [2021-12-17 08:20:49,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-17 08:20:49,830 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:20:49,830 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:20:49,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 08:20:50,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:20:50,056 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:20:50,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:20:50,056 INFO L85 PathProgramCache]: Analyzing trace with hash 878042536, now seen corresponding path program 1 times [2021-12-17 08:20:50,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:20:50,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549264196] [2021-12-17 08:20:50,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:20:50,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:20:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:20:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:20:50,324 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:20:50,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549264196] [2021-12-17 08:20:50,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549264196] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:20:50,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544131081] [2021-12-17 08:20:50,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:20:50,325 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:20:50,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:20:50,326 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 08:20:50,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 08:20:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:20:50,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 82 conjunts are in the unsatisfiable core [2021-12-17 08:20:50,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:20:50,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 08:20:50,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:20:50,579 INFO L354 Elim1Store]: treesize reduction 23, result has 56.6 percent of original size [2021-12-17 08:20:50,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 383 treesize of output 326 [2021-12-17 08:20:50,635 INFO L354 Elim1Store]: treesize reduction 23, result has 56.6 percent of original size [2021-12-17 08:20:50,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 491 treesize of output 404 [2021-12-17 08:20:50,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:20:50,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:20:50,744 INFO L354 Elim1Store]: treesize reduction 504, result has 15.7 percent of original size [2021-12-17 08:20:50,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 368 treesize of output 410 [2021-12-17 08:20:50,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:20:50,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:20:50,833 INFO L354 Elim1Store]: treesize reduction 360, result has 15.7 percent of original size [2021-12-17 08:20:50,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 321 treesize of output 330 [2021-12-17 08:20:50,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 103 [2021-12-17 08:20:50,866 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:20:50,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 124 [2021-12-17 08:20:50,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-17 08:20:50,909 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-17 08:20:50,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-17 08:20:50,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-17 08:20:50,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-17 08:20:50,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-12-17 08:20:50,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-12-17 08:20:51,045 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:20:51,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 55 [2021-12-17 08:20:51,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2021-12-17 08:20:51,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:20:51,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2021-12-17 08:20:51,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-17 08:20:52,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2021-12-17 08:20:52,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2021-12-17 08:20:52,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2021-12-17 08:20:52,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2021-12-17 08:20:52,730 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-17 08:20:52,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:20:52,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2021-12-17 08:20:52,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2021-12-17 08:20:53,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:20:53,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:20:53,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 84 [2021-12-17 08:20:53,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2021-12-17 08:20:54,051 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-12-17 08:20:54,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 126 [2021-12-17 08:20:54,056 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-17 08:20:54,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 84 [2021-12-17 08:20:54,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2021-12-17 08:20:54,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 126 [2021-12-17 08:20:54,644 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-17 08:20:54,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:20:54,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2021-12-17 08:20:54,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2021-12-17 08:20:54,759 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-12-17 08:20:54,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 307 treesize of output 263 [2021-12-17 08:20:54,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 263 treesize of output 247 [2021-12-17 08:20:54,841 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 08:20:54,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 105 [2021-12-17 08:20:54,846 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 08:20:54,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 81 [2021-12-17 08:20:54,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2021-12-17 08:20:54,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2021-12-17 08:20:55,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:20:55,045 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 08:20:55,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 56 [2021-12-17 08:20:55,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:20:55,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-12-17 08:20:55,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:20:55,065 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 08:20:55,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 60 [2021-12-17 08:20:55,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:20:55,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:20:55,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 41 [2021-12-17 08:20:55,086 INFO L354 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2021-12-17 08:20:55,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2021-12-17 08:20:55,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:20:55,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 66 [2021-12-17 08:20:55,300 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:20:55,309 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-17 08:20:55,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 55 [2021-12-17 08:20:56,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:20:56,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:20:56,270 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-12-17 08:20:56,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 51 [2021-12-17 08:20:56,282 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-17 08:20:56,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 29 [2021-12-17 08:20:56,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:20:56,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:20:56,598 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:20:56,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 169 [2021-12-17 08:20:56,604 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:20:56,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 157 [2021-12-17 08:21:06,705 INFO L354 Elim1Store]: treesize reduction 62, result has 54.4 percent of original size [2021-12-17 08:21:06,706 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 10925 treesize of output 8790 [2021-12-17 08:21:07,579 INFO L354 Elim1Store]: treesize reduction 62, result has 54.4 percent of original size [2021-12-17 08:21:07,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 29309 treesize of output 21378 [2021-12-17 08:22:06,534 WARN L227 SmtUtils]: Spent 45.11s on a formula simplification. DAG size of input: 296 DAG size of output: 248 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-12-17 08:22:06,535 INFO L354 Elim1Store]: treesize reduction 876, result has 71.9 percent of original size [2021-12-17 08:22:06,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 15 new quantified variables, introduced 55 case distinctions, treesize of input 68109576 treesize of output 63975146 [2021-12-17 08:22:38,241 WARN L227 SmtUtils]: Spent 31.61s on a formula simplification that was a NOOP. DAG size: 43895 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 08:23:08,990 WARN L227 SmtUtils]: Spent 30.57s on a formula simplification that was a NOOP. DAG size: 43819 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)