/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-01-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 17:45:14,557 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 17:45:14,558 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 17:45:14,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 17:45:14,615 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 17:45:14,616 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 17:45:14,617 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 17:45:14,619 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 17:45:14,620 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 17:45:14,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 17:45:14,622 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 17:45:14,622 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 17:45:14,623 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 17:45:14,623 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 17:45:14,624 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 17:45:14,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 17:45:14,626 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 17:45:14,627 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 17:45:14,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 17:45:14,629 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 17:45:14,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 17:45:14,635 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 17:45:14,638 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 17:45:14,644 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 17:45:14,654 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 17:45:14,654 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 17:45:14,655 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 17:45:14,655 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 17:45:14,656 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 17:45:14,656 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 17:45:14,656 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 17:45:14,657 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 17:45:14,658 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 17:45:14,658 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 17:45:14,659 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 17:45:14,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 17:45:14,660 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 17:45:14,660 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 17:45:14,660 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 17:45:14,661 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 17:45:14,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 17:45:14,667 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 17:45:14,696 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 17:45:14,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 17:45:14,697 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 17:45:14,697 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 17:45:14,698 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 17:45:14,698 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 17:45:14,698 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 17:45:14,698 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 17:45:14,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 17:45:14,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 17:45:14,699 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 17:45:14,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 17:45:14,700 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 17:45:14,700 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 17:45:14,700 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 17:45:14,700 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 17:45:14,700 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 17:45:14,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 17:45:14,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 17:45:14,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 17:45:14,701 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 17:45:14,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 17:45:14,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 17:45:14,702 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 17:45:14,702 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 17:45:14,702 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 17:45:14,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 17:45:14,702 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 17:45:14,703 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 17:45:14,703 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 17:45:14,703 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 17:45:14,703 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 17:45:14,704 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 17:45:14,704 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 17:45:14,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 17:45:14,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 17:45:14,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 17:45:14,942 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 17:45:14,943 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 17:45:14,944 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01-1.i [2022-01-10 17:45:14,995 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b31ec21ce/b2ab0641c92243e7bf5aed703df4fb36/FLAG4fdb88167 [2022-01-10 17:45:15,445 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 17:45:15,445 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i [2022-01-10 17:45:15,468 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b31ec21ce/b2ab0641c92243e7bf5aed703df4fb36/FLAG4fdb88167 [2022-01-10 17:45:15,780 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b31ec21ce/b2ab0641c92243e7bf5aed703df4fb36 [2022-01-10 17:45:15,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 17:45:15,784 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 17:45:15,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 17:45:15,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 17:45:15,790 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 17:45:15,791 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:45:15" (1/1) ... [2022-01-10 17:45:15,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f2d1cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:45:15, skipping insertion in model container [2022-01-10 17:45:15,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:45:15" (1/1) ... [2022-01-10 17:45:15,800 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 17:45:15,845 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 17:45:16,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i[22034,22047] [2022-01-10 17:45:16,082 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i[22307,22320] [2022-01-10 17:45:16,085 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i[22516,22529] [2022-01-10 17:45:16,086 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i[22586,22599] [2022-01-10 17:45:16,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i[22853,22866] [2022-01-10 17:45:16,094 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i[22961,22974] [2022-01-10 17:45:16,095 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i[23192,23205] [2022-01-10 17:45:16,096 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i[23272,23285] [2022-01-10 17:45:16,097 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i[23351,23364] [2022-01-10 17:45:16,097 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i[23441,23454] [2022-01-10 17:45:16,099 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i[23619,23632] [2022-01-10 17:45:16,099 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i[23697,23710] [2022-01-10 17:45:16,100 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i[23774,23787] [2022-01-10 17:45:16,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 17:45:16,111 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 17:45:16,138 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i[22034,22047] [2022-01-10 17:45:16,141 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i[22307,22320] [2022-01-10 17:45:16,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i[22516,22529] [2022-01-10 17:45:16,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i[22586,22599] [2022-01-10 17:45:16,144 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i[22853,22866] [2022-01-10 17:45:16,145 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i[22961,22974] [2022-01-10 17:45:16,146 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i[23192,23205] [2022-01-10 17:45:16,147 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i[23272,23285] [2022-01-10 17:45:16,147 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i[23351,23364] [2022-01-10 17:45:16,148 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i[23441,23454] [2022-01-10 17:45:16,151 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i[23619,23632] [2022-01-10 17:45:16,151 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i[23697,23710] [2022-01-10 17:45:16,152 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-1.i[23774,23787] [2022-01-10 17:45:16,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 17:45:16,176 INFO L208 MainTranslator]: Completed translation [2022-01-10 17:45:16,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:45:16 WrapperNode [2022-01-10 17:45:16,177 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 17:45:16,178 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 17:45:16,178 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 17:45:16,178 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 17:45:16,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:45:16" (1/1) ... [2022-01-10 17:45:16,210 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:45:16" (1/1) ... [2022-01-10 17:45:16,230 INFO L137 Inliner]: procedures = 120, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 219 [2022-01-10 17:45:16,230 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 17:45:16,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 17:45:16,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 17:45:16,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 17:45:16,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:45:16" (1/1) ... [2022-01-10 17:45:16,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:45:16" (1/1) ... [2022-01-10 17:45:16,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:45:16" (1/1) ... [2022-01-10 17:45:16,241 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:45:16" (1/1) ... [2022-01-10 17:45:16,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:45:16" (1/1) ... [2022-01-10 17:45:16,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:45:16" (1/1) ... [2022-01-10 17:45:16,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:45:16" (1/1) ... [2022-01-10 17:45:16,261 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 17:45:16,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 17:45:16,261 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 17:45:16,262 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 17:45:16,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:45:16" (1/1) ... [2022-01-10 17:45:16,282 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 17:45:16,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:45:16,301 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 17:45:16,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 17:45:16,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 17:45:16,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 17:45:16,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 17:45:16,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 17:45:16,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 17:45:16,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 17:45:16,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 17:45:16,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 17:45:16,411 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 17:45:16,412 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 17:45:16,808 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 17:45:16,816 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 17:45:16,816 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-01-10 17:45:16,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:45:16 BoogieIcfgContainer [2022-01-10 17:45:16,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 17:45:16,818 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 17:45:16,819 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 17:45:16,820 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 17:45:16,823 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:45:16" (1/1) ... [2022-01-10 17:45:16,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 05:45:16 BasicIcfg [2022-01-10 17:45:16,901 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 17:45:16,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 17:45:16,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 17:45:16,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 17:45:16,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 05:45:15" (1/4) ... [2022-01-10 17:45:16,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693d9aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:45:16, skipping insertion in model container [2022-01-10 17:45:16,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:45:16" (2/4) ... [2022-01-10 17:45:16,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693d9aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:45:16, skipping insertion in model container [2022-01-10 17:45:16,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:45:16" (3/4) ... [2022-01-10 17:45:16,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693d9aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 05:45:16, skipping insertion in model container [2022-01-10 17:45:16,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 05:45:16" (4/4) ... [2022-01-10 17:45:16,907 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-1.iTransformedIcfg [2022-01-10 17:45:16,911 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 17:45:16,912 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2022-01-10 17:45:16,946 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 17:45:16,951 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 [2022-01-10 17:45:16,952 INFO L340 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-01-10 17:45:16,964 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 66 states have (on average 2.0) internal successors, (132), 79 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) [2022-01-10 17:45:16,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-01-10 17:45:16,967 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:16,968 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-01-10 17:45:16,968 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)] === [2022-01-10 17:45:16,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:16,973 INFO L85 PathProgramCache]: Analyzing trace with hash 10960166, now seen corresponding path program 1 times [2022-01-10 17:45:16,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:16,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185306546] [2022-01-10 17:45:16,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:16,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:17,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:17,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:17,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185306546] [2022-01-10 17:45:17,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185306546] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:45:17,183 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:45:17,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:45:17,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797425573] [2022-01-10 17:45:17,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:45:17,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:45:17,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:17,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:45:17,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:45:17,218 INFO L87 Difference]: Start difference. First operand has 80 states, 66 states have (on average 2.0) internal successors, (132), 79 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) 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) [2022-01-10 17:45:17,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:17,299 INFO L93 Difference]: Finished difference Result 174 states and 290 transitions. [2022-01-10 17:45:17,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:45:17,301 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 [2022-01-10 17:45:17,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:17,311 INFO L225 Difference]: With dead ends: 174 [2022-01-10 17:45:17,312 INFO L226 Difference]: Without dead ends: 92 [2022-01-10 17:45:17,320 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 [2022-01-10 17:45:17,326 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 80 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 99 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 [2022-01-10 17:45:17,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 99 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:45:17,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-01-10 17:45:17,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2022-01-10 17:45:17,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 73 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) [2022-01-10 17:45:17,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2022-01-10 17:45:17,363 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 4 [2022-01-10 17:45:17,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:17,364 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2022-01-10 17:45:17,364 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) [2022-01-10 17:45:17,364 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-01-10 17:45:17,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-10 17:45:17,365 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:17,365 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:45:17,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 17:45:17,365 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)] === [2022-01-10 17:45:17,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:17,368 INFO L85 PathProgramCache]: Analyzing trace with hash -212488373, now seen corresponding path program 1 times [2022-01-10 17:45:17,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:17,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892603656] [2022-01-10 17:45:17,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:17,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:17,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:17,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:17,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892603656] [2022-01-10 17:45:17,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892603656] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:45:17,455 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:45:17,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:45:17,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949856493] [2022-01-10 17:45:17,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:45:17,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:45:17,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:17,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:45:17,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:45:17,457 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:17,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:17,476 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2022-01-10 17:45:17,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:45:17,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-01-10 17:45:17,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:17,481 INFO L225 Difference]: With dead ends: 77 [2022-01-10 17:45:17,481 INFO L226 Difference]: Without dead ends: 75 [2022-01-10 17:45:17,481 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 [2022-01-10 17:45:17,483 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 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 [2022-01-10 17:45:17,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:45:17,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-01-10 17:45:17,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-01-10 17:45:17,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 63 states have (on average 1.3333333333333333) 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) [2022-01-10 17:45:17,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2022-01-10 17:45:17,497 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 9 [2022-01-10 17:45:17,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:17,497 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2022-01-10 17:45:17,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:17,498 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-01-10 17:45:17,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-10 17:45:17,498 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:17,498 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:45:17,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 17:45:17,498 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)] === [2022-01-10 17:45:17,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:17,499 INFO L85 PathProgramCache]: Analyzing trace with hash -212487412, now seen corresponding path program 1 times [2022-01-10 17:45:17,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:17,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572332114] [2022-01-10 17:45:17,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:17,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:17,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:17,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:17,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572332114] [2022-01-10 17:45:17,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572332114] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:45:17,597 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:45:17,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 17:45:17,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751980970] [2022-01-10 17:45:17,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:45:17,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 17:45:17,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:17,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 17:45:17,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 17:45:17,599 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:17,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:17,717 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2022-01-10 17:45:17,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 17:45:17,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-01-10 17:45:17,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:17,720 INFO L225 Difference]: With dead ends: 130 [2022-01-10 17:45:17,720 INFO L226 Difference]: Without dead ends: 128 [2022-01-10 17:45:17,721 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 [2022-01-10 17:45:17,723 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 54 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:45:17,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 193 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 17:45:17,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-01-10 17:45:17,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 77. [2022-01-10 17:45:17,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 76 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) [2022-01-10 17:45:17,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2022-01-10 17:45:17,732 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 9 [2022-01-10 17:45:17,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:17,732 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2022-01-10 17:45:17,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:17,732 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2022-01-10 17:45:17,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-10 17:45:17,733 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:17,733 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:45:17,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 17:45:17,733 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 17:45:17,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:17,734 INFO L85 PathProgramCache]: Analyzing trace with hash -211563891, now seen corresponding path program 1 times [2022-01-10 17:45:17,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:17,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11120891] [2022-01-10 17:45:17,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:17,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:17,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:17,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:17,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11120891] [2022-01-10 17:45:17,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11120891] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:45:17,965 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:45:18,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 17:45:18,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17314070] [2022-01-10 17:45:18,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:45:18,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 17:45:18,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:18,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 17:45:18,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 17:45:18,004 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:18,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:18,175 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2022-01-10 17:45:18,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 17:45:18,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-01-10 17:45:18,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:18,177 INFO L225 Difference]: With dead ends: 96 [2022-01-10 17:45:18,177 INFO L226 Difference]: Without dead ends: 94 [2022-01-10 17:45:18,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-01-10 17:45:18,178 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 138 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:45:18,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 200 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 17:45:18,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-01-10 17:45:18,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 72. [2022-01-10 17:45:18,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 61 states have (on average 1.3278688524590163) 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) [2022-01-10 17:45:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2022-01-10 17:45:18,183 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 9 [2022-01-10 17:45:18,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:18,184 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2022-01-10 17:45:18,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:18,184 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2022-01-10 17:45:18,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 17:45:18,185 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:18,185 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:45:18,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 17:45:18,185 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 17:45:18,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:18,186 INFO L85 PathProgramCache]: Analyzing trace with hash -377988359, now seen corresponding path program 1 times [2022-01-10 17:45:18,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:18,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929495094] [2022-01-10 17:45:18,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:18,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:18,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:18,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:18,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929495094] [2022-01-10 17:45:18,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929495094] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:45:18,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:45:18,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:45:18,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4715101] [2022-01-10 17:45:18,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:45:18,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:45:18,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:18,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:45:18,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:45:18,262 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:18,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:18,307 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2022-01-10 17:45:18,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:45:18,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-10 17:45:18,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:18,309 INFO L225 Difference]: With dead ends: 74 [2022-01-10 17:45:18,309 INFO L226 Difference]: Without dead ends: 70 [2022-01-10 17:45:18,309 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 [2022-01-10 17:45:18,310 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 14 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 119 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 [2022-01-10 17:45:18,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 119 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:45:18,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-10 17:45:18,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2022-01-10 17:45:18,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 59 states have (on average 1.305084745762712) internal successors, (77), 67 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:18,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-01-10 17:45:18,323 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 13 [2022-01-10 17:45:18,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:18,324 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-01-10 17:45:18,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:18,324 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-01-10 17:45:18,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 17:45:18,325 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:18,325 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:45:18,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 17:45:18,325 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)] === [2022-01-10 17:45:18,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:18,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1167231259, now seen corresponding path program 1 times [2022-01-10 17:45:18,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:18,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482847331] [2022-01-10 17:45:18,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:18,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:18,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:18,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:18,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482847331] [2022-01-10 17:45:18,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482847331] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:45:18,373 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:45:18,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 17:45:18,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049842400] [2022-01-10 17:45:18,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:45:18,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 17:45:18,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:18,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 17:45:18,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 17:45:18,374 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:18,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:18,454 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2022-01-10 17:45:18,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 17:45:18,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-01-10 17:45:18,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:18,456 INFO L225 Difference]: With dead ends: 127 [2022-01-10 17:45:18,456 INFO L226 Difference]: Without dead ends: 107 [2022-01-10 17:45:18,456 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 [2022-01-10 17:45:18,460 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 125 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 112 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.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:45:18,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 112 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 17:45:18,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-01-10 17:45:18,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 67. [2022-01-10 17:45:18,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 66 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:18,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2022-01-10 17:45:18,466 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 14 [2022-01-10 17:45:18,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:18,467 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2022-01-10 17:45:18,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:18,467 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2022-01-10 17:45:18,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 17:45:18,467 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:18,468 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:45:18,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 17:45:18,468 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)] === [2022-01-10 17:45:18,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:18,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1155519945, now seen corresponding path program 1 times [2022-01-10 17:45:18,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:18,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872615375] [2022-01-10 17:45:18,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:18,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:18,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:18,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:18,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872615375] [2022-01-10 17:45:18,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872615375] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:45:18,552 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:45:18,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 17:45:18,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047538540] [2022-01-10 17:45:18,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:45:18,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 17:45:18,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:18,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 17:45:18,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 17:45:18,555 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:18,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:18,658 INFO L93 Difference]: Finished difference Result 178 states and 200 transitions. [2022-01-10 17:45:18,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 17:45:18,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-10 17:45:18,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:18,659 INFO L225 Difference]: With dead ends: 178 [2022-01-10 17:45:18,659 INFO L226 Difference]: Without dead ends: 118 [2022-01-10 17:45:18,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 17:45:18,661 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 52 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:45:18,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 165 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 17:45:18,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-01-10 17:45:18,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 69. [2022-01-10 17:45:18,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 61 states have (on average 1.278688524590164) internal successors, (78), 68 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:18,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2022-01-10 17:45:18,667 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 18 [2022-01-10 17:45:18,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:18,667 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2022-01-10 17:45:18,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:18,667 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2022-01-10 17:45:18,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 17:45:18,668 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:18,668 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:45:18,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 17:45:18,668 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 17:45:18,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:18,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1026437226, now seen corresponding path program 1 times [2022-01-10 17:45:18,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:18,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081483477] [2022-01-10 17:45:18,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:18,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:18,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:18,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:18,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081483477] [2022-01-10 17:45:18,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081483477] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:45:18,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:45:18,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:45:18,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005717121] [2022-01-10 17:45:18,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:45:18,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:45:18,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:18,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:45:18,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:45:18,748 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:18,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:18,760 INFO L93 Difference]: Finished difference Result 134 states and 152 transitions. [2022-01-10 17:45:18,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:45:18,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-10 17:45:18,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:18,762 INFO L225 Difference]: With dead ends: 134 [2022-01-10 17:45:18,762 INFO L226 Difference]: Without dead ends: 93 [2022-01-10 17:45:18,762 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 [2022-01-10 17:45:18,763 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 24 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 143 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 [2022-01-10 17:45:18,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 143 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:45:18,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-01-10 17:45:18,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 72. [2022-01-10 17:45:18,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 64 states have (on average 1.28125) internal successors, (82), 71 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) [2022-01-10 17:45:18,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2022-01-10 17:45:18,775 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 18 [2022-01-10 17:45:18,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:18,775 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2022-01-10 17:45:18,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:18,775 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2022-01-10 17:45:18,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 17:45:18,776 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:18,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] [2022-01-10 17:45:18,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 17:45:18,776 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 17:45:18,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:18,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1754750646, now seen corresponding path program 1 times [2022-01-10 17:45:18,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:18,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418384559] [2022-01-10 17:45:18,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:18,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:18,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:18,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:18,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418384559] [2022-01-10 17:45:18,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418384559] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:45:18,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:45:18,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:45:18,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068040554] [2022-01-10 17:45:18,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:45:18,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:45:18,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:18,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:45:18,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:45:18,826 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:18,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:18,840 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2022-01-10 17:45:18,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:45:18,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-01-10 17:45:18,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:18,841 INFO L225 Difference]: With dead ends: 72 [2022-01-10 17:45:18,841 INFO L226 Difference]: Without dead ends: 70 [2022-01-10 17:45:18,842 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 [2022-01-10 17:45:18,844 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 13 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 123 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 [2022-01-10 17:45:18,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 123 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:45:18,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-10 17:45:18,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-01-10 17:45:18,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 69 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) [2022-01-10 17:45:18,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2022-01-10 17:45:18,854 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 19 [2022-01-10 17:45:18,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:18,854 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2022-01-10 17:45:18,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:18,855 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-01-10 17:45:18,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 17:45:18,855 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:18,855 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] [2022-01-10 17:45:18,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 17:45:18,856 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 17:45:18,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:18,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1942473314, now seen corresponding path program 1 times [2022-01-10 17:45:18,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:18,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330633880] [2022-01-10 17:45:18,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:18,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:18,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:18,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:18,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330633880] [2022-01-10 17:45:18,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330633880] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:45:18,896 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:45:18,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:45:18,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879661846] [2022-01-10 17:45:18,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:45:18,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:45:18,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:18,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:45:18,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:45:18,897 INFO L87 Difference]: Start difference. First operand 70 states and 80 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) [2022-01-10 17:45:18,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:18,908 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2022-01-10 17:45:18,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:45:18,908 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 [2022-01-10 17:45:18,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:18,909 INFO L225 Difference]: With dead ends: 73 [2022-01-10 17:45:18,909 INFO L226 Difference]: Without dead ends: 71 [2022-01-10 17:45:18,910 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 [2022-01-10 17:45:18,910 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 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 [2022-01-10 17:45:18,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:45:18,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-01-10 17:45:18,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-01-10 17:45:18,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.265625) 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) [2022-01-10 17:45:18,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-01-10 17:45:18,914 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 20 [2022-01-10 17:45:18,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:18,914 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-01-10 17:45:18,914 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) [2022-01-10 17:45:18,915 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-01-10 17:45:18,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 17:45:18,917 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:18,917 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] [2022-01-10 17:45:18,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 17:45:18,917 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 17:45:18,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:18,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1942474275, now seen corresponding path program 1 times [2022-01-10 17:45:18,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:18,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463762510] [2022-01-10 17:45:18,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:18,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:18,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:18,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:18,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463762510] [2022-01-10 17:45:18,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463762510] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:45:18,985 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:45:18,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 17:45:18,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488873616] [2022-01-10 17:45:18,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:45:18,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 17:45:18,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:18,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 17:45:18,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 17:45:18,987 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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) [2022-01-10 17:45:19,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:19,051 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2022-01-10 17:45:19,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 17:45:19,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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 [2022-01-10 17:45:19,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:19,052 INFO L225 Difference]: With dead ends: 72 [2022-01-10 17:45:19,052 INFO L226 Difference]: Without dead ends: 70 [2022-01-10 17:45:19,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 17:45:19,053 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:45:19,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 107 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 17:45:19,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-10 17:45:19,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2022-01-10 17:45:19,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 67 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:19,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2022-01-10 17:45:19,056 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 20 [2022-01-10 17:45:19,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:19,057 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-01-10 17:45:19,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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) [2022-01-10 17:45:19,057 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-01-10 17:45:19,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 17:45:19,057 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:19,058 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] [2022-01-10 17:45:19,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 17:45:19,058 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 17:45:19,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:19,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1728136734, now seen corresponding path program 1 times [2022-01-10 17:45:19,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:19,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656900192] [2022-01-10 17:45:19,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:19,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:19,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:19,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:19,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656900192] [2022-01-10 17:45:19,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656900192] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:45:19,226 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:45:19,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 17:45:19,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451054996] [2022-01-10 17:45:19,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:45:19,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 17:45:19,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:19,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 17:45:19,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 17:45:19,227 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:19,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:19,519 INFO L93 Difference]: Finished difference Result 193 states and 219 transitions. [2022-01-10 17:45:19,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 17:45:19,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-01-10 17:45:19,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:19,520 INFO L225 Difference]: With dead ends: 193 [2022-01-10 17:45:19,520 INFO L226 Difference]: Without dead ends: 151 [2022-01-10 17:45:19,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-01-10 17:45:19,521 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 233 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 17:45:19,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 227 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 17:45:19,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-01-10 17:45:19,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 87. [2022-01-10 17:45:19,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 86 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:19,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2022-01-10 17:45:19,527 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 22 [2022-01-10 17:45:19,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:19,559 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2022-01-10 17:45:19,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:19,560 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2022-01-10 17:45:19,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 17:45:19,560 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:19,560 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] [2022-01-10 17:45:19,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 17:45:19,561 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 17:45:19,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:19,561 INFO L85 PathProgramCache]: Analyzing trace with hash 2080292386, now seen corresponding path program 1 times [2022-01-10 17:45:19,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:19,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602104204] [2022-01-10 17:45:19,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:19,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:19,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:19,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:19,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602104204] [2022-01-10 17:45:19,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602104204] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:45:19,950 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:45:19,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 17:45:19,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204164487] [2022-01-10 17:45:19,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:45:19,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 17:45:19,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:19,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 17:45:19,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 17:45:19,952 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:20,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:20,515 INFO L93 Difference]: Finished difference Result 234 states and 262 transitions. [2022-01-10 17:45:20,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 17:45:20,516 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-01-10 17:45:20,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:20,518 INFO L225 Difference]: With dead ends: 234 [2022-01-10 17:45:20,518 INFO L226 Difference]: Without dead ends: 232 [2022-01-10 17:45:20,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-01-10 17:45:20,519 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 244 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 17:45:20,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 416 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 17:45:20,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-01-10 17:45:20,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 98. [2022-01-10 17:45:20,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 92 states have (on average 1.2391304347826086) internal successors, (114), 97 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:20,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 114 transitions. [2022-01-10 17:45:20,528 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 114 transitions. Word has length 22 [2022-01-10 17:45:20,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:20,528 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 114 transitions. [2022-01-10 17:45:20,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:20,528 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 114 transitions. [2022-01-10 17:45:20,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 17:45:20,532 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:20,532 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] [2022-01-10 17:45:20,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 17:45:20,532 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 17:45:20,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:20,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1571713419, now seen corresponding path program 1 times [2022-01-10 17:45:20,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:20,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141963736] [2022-01-10 17:45:20,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:20,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:20,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:45:20,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:20,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141963736] [2022-01-10 17:45:20,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141963736] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:45:20,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:45:20,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:45:20,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622220237] [2022-01-10 17:45:20,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:45:20,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:45:20,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:20,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:45:20,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:45:20,569 INFO L87 Difference]: Start difference. First operand 98 states and 114 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:20,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:20,620 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2022-01-10 17:45:20,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:45:20,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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 [2022-01-10 17:45:20,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:20,621 INFO L225 Difference]: With dead ends: 99 [2022-01-10 17:45:20,621 INFO L226 Difference]: Without dead ends: 97 [2022-01-10 17:45:20,621 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 [2022-01-10 17:45:20,622 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 47 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 70 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 [2022-01-10 17:45:20,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 70 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:45:20,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-01-10 17:45:20,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2022-01-10 17:45:20,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 91 states have (on average 1.2307692307692308) internal successors, (112), 95 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:20,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2022-01-10 17:45:20,629 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 24 [2022-01-10 17:45:20,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:20,629 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2022-01-10 17:45:20,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:20,629 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2022-01-10 17:45:20,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 17:45:20,631 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:20,631 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] [2022-01-10 17:45:20,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 17:45:20,631 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 17:45:20,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:20,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1908771830, now seen corresponding path program 1 times [2022-01-10 17:45:20,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:20,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769649888] [2022-01-10 17:45:20,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:20,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:20,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:20,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:20,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769649888] [2022-01-10 17:45:20,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769649888] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:45:20,889 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:45:20,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 17:45:20,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841083254] [2022-01-10 17:45:20,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:45:20,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 17:45:20,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:20,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 17:45:20,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 17:45:20,890 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:21,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:21,315 INFO L93 Difference]: Finished difference Result 217 states and 244 transitions. [2022-01-10 17:45:21,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 17:45:21,316 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-01-10 17:45:21,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:21,317 INFO L225 Difference]: With dead ends: 217 [2022-01-10 17:45:21,317 INFO L226 Difference]: Without dead ends: 215 [2022-01-10 17:45:21,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-01-10 17:45:21,318 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 219 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 17:45:21,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 388 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 17:45:21,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-01-10 17:45:21,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 99. [2022-01-10 17:45:21,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 98 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2022-01-10 17:45:21,325 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 25 [2022-01-10 17:45:21,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:21,326 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2022-01-10 17:45:21,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:21,326 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2022-01-10 17:45:21,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 17:45:21,326 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:21,326 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] [2022-01-10 17:45:21,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 17:45:21,327 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)] === [2022-01-10 17:45:21,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:21,327 INFO L85 PathProgramCache]: Analyzing trace with hash -817602824, now seen corresponding path program 1 times [2022-01-10 17:45:21,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:21,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814147057] [2022-01-10 17:45:21,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:21,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:21,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:45:21,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:21,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814147057] [2022-01-10 17:45:21,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814147057] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:45:21,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:45:21,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 17:45:21,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651538507] [2022-01-10 17:45:21,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:45:21,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 17:45:21,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:21,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 17:45:21,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 17:45:21,385 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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) [2022-01-10 17:45:21,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:21,483 INFO L93 Difference]: Finished difference Result 148 states and 170 transitions. [2022-01-10 17:45:21,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 17:45:21,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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 [2022-01-10 17:45:21,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:21,484 INFO L225 Difference]: With dead ends: 148 [2022-01-10 17:45:21,484 INFO L226 Difference]: Without dead ends: 132 [2022-01-10 17:45:21,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 17:45:21,485 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 20 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:45:21,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 173 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 17:45:21,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-01-10 17:45:21,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 124. [2022-01-10 17:45:21,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 119 states have (on average 1.2352941176470589) internal successors, (147), 123 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:21,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 147 transitions. [2022-01-10 17:45:21,494 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 147 transitions. Word has length 27 [2022-01-10 17:45:21,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:21,494 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 147 transitions. [2022-01-10 17:45:21,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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) [2022-01-10 17:45:21,494 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 147 transitions. [2022-01-10 17:45:21,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 17:45:21,495 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:21,495 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] [2022-01-10 17:45:21,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 17:45:21,495 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 17:45:21,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:21,495 INFO L85 PathProgramCache]: Analyzing trace with hash -555606655, now seen corresponding path program 1 times [2022-01-10 17:45:21,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:21,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636457858] [2022-01-10 17:45:21,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:21,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:21,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:21,572 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:21,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636457858] [2022-01-10 17:45:21,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636457858] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:45:21,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390040740] [2022-01-10 17:45:21,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:21,572 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:45:21,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:45:21,576 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:45:21,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 17:45:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:21,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-10 17:45:21,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:45:21,791 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 17:45:21,797 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 17:45:21,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:45:21,834 INFO L387 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 23 treesize of output 22 [2022-01-10 17:45:21,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:45:21,842 INFO L387 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 23 treesize of output 22 [2022-01-10 17:45:22,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:45:22,123 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:45:22,124 INFO L387 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 22 treesize of output 10 [2022-01-10 17:45:22,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:45:22,133 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:45:22,135 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:45:22,135 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 13 [2022-01-10 17:45:22,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:22,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:45:23,400 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt_3| Int)) (or (let ((.cse2 (mod (+ 8 |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt|) 18446744073709551616))) (let ((.cse0 (select (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) .cse2 0) |v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt_3|)) (.cse1 (select (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) .cse2 0) |v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt_3|))) (and (< 0 (+ .cse0 1)) (<= .cse1 0) (<= .cse0 0) (< 0 (+ .cse1 1))))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt_3| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt_3|)))) is different from false [2022-01-10 17:45:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:23,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390040740] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:45:23,507 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:45:23,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2022-01-10 17:45:23,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415229949] [2022-01-10 17:45:23,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:45:23,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 17:45:23,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:23,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 17:45:23,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=52, Unknown=1, NotChecked=14, Total=90 [2022-01-10 17:45:23,509 INFO L87 Difference]: Start difference. First operand 124 states and 147 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:24,021 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt|) 0) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt_3| Int)) (or (let ((.cse2 (mod (+ 8 |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt|) 18446744073709551616))) (let ((.cse0 (select (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) .cse2 0) |v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt_3|)) (.cse1 (select (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) .cse2 0) |v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt_3|))) (and (< 0 (+ .cse0 1)) (<= .cse1 0) (<= .cse0 0) (< 0 (+ .cse1 1))))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt_3| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt_3|)))) (= (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt|) 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt| 0)) is different from false [2022-01-10 17:45:24,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:24,240 INFO L93 Difference]: Finished difference Result 160 states and 184 transitions. [2022-01-10 17:45:24,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 17:45:24,240 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-10 17:45:24,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:24,241 INFO L225 Difference]: With dead ends: 160 [2022-01-10 17:45:24,241 INFO L226 Difference]: Without dead ends: 118 [2022-01-10 17:45:24,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=39, Invalid=77, Unknown=2, NotChecked=38, Total=156 [2022-01-10 17:45:24,241 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 34 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 17:45:24,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 334 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 130 Invalid, 0 Unknown, 74 Unchecked, 0.2s Time] [2022-01-10 17:45:24,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-01-10 17:45:24,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2022-01-10 17:45:24,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.2) internal successors, (126), 109 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:24,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 126 transitions. [2022-01-10 17:45:24,253 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 126 transitions. Word has length 27 [2022-01-10 17:45:24,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:24,254 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 126 transitions. [2022-01-10 17:45:24,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:24,254 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 126 transitions. [2022-01-10 17:45:24,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 17:45:24,254 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:24,254 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] [2022-01-10 17:45:24,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 17:45:24,455 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,SelfDestructingSolverStorable16 [2022-01-10 17:45:24,455 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)] === [2022-01-10 17:45:24,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:24,456 INFO L85 PathProgramCache]: Analyzing trace with hash 215810744, now seen corresponding path program 1 times [2022-01-10 17:45:24,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:24,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476996296] [2022-01-10 17:45:24,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:24,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:24,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:24,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:24,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476996296] [2022-01-10 17:45:24,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476996296] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:45:24,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:45:24,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 17:45:24,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901852674] [2022-01-10 17:45:24,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:45:24,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 17:45:24,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:24,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 17:45:24,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 17:45:24,780 INFO L87 Difference]: Start difference. First operand 110 states and 126 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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) [2022-01-10 17:45:25,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:25,146 INFO L93 Difference]: Finished difference Result 234 states and 264 transitions. [2022-01-10 17:45:25,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 17:45:25,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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 [2022-01-10 17:45:25,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:25,148 INFO L225 Difference]: With dead ends: 234 [2022-01-10 17:45:25,148 INFO L226 Difference]: Without dead ends: 194 [2022-01-10 17:45:25,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 17:45:25,149 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 194 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 17:45:25,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 316 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 17:45:25,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-01-10 17:45:25,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 110. [2022-01-10 17:45:25,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.1904761904761905) internal successors, (125), 109 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:25,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2022-01-10 17:45:25,158 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 27 [2022-01-10 17:45:25,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:25,158 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2022-01-10 17:45:25,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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) [2022-01-10 17:45:25,158 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2022-01-10 17:45:25,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 17:45:25,159 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:25,159 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] [2022-01-10 17:45:25,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 17:45:25,159 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 17:45:25,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:25,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1103786496, now seen corresponding path program 1 times [2022-01-10 17:45:25,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:25,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055645778] [2022-01-10 17:45:25,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:25,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:25,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:25,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:25,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055645778] [2022-01-10 17:45:25,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055645778] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:45:25,225 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:45:25,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:45:25,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661057586] [2022-01-10 17:45:25,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:45:25,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:45:25,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:25,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:45:25,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:45:25,226 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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) [2022-01-10 17:45:25,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:25,243 INFO L93 Difference]: Finished difference Result 147 states and 166 transitions. [2022-01-10 17:45:25,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:45:25,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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 [2022-01-10 17:45:25,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:25,245 INFO L225 Difference]: With dead ends: 147 [2022-01-10 17:45:25,245 INFO L226 Difference]: Without dead ends: 145 [2022-01-10 17:45:25,245 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 [2022-01-10 17:45:25,245 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 26 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 130 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 [2022-01-10 17:45:25,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 130 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:45:25,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-01-10 17:45:25,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 120. [2022-01-10 17:45:25,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 115 states have (on average 1.2) internal successors, (138), 119 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:25,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 138 transitions. [2022-01-10 17:45:25,255 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 138 transitions. Word has length 29 [2022-01-10 17:45:25,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:25,255 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 138 transitions. [2022-01-10 17:45:25,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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) [2022-01-10 17:45:25,256 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 138 transitions. [2022-01-10 17:45:25,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 17:45:25,256 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:25,256 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] [2022-01-10 17:45:25,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 17:45:25,256 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 17:45:25,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:25,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1156070488, now seen corresponding path program 1 times [2022-01-10 17:45:25,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:25,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981798434] [2022-01-10 17:45:25,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:25,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:25,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:45:25,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:25,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981798434] [2022-01-10 17:45:25,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981798434] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:45:25,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231459519] [2022-01-10 17:45:25,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:25,316 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:45:25,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:45:25,320 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:45:25,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 17:45:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:25,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-10 17:45:25,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:45:25,489 INFO L387 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 6 treesize of output 5 [2022-01-10 17:45:25,733 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:45:25,733 INFO L387 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-01-10 17:45:25,737 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:45:25,739 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:45:25,740 INFO L387 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 22 treesize of output 13 [2022-01-10 17:45:25,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:25,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:45:25,861 INFO L353 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-01-10 17:45:25,861 INFO L387 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 32 treesize of output 27 [2022-01-10 17:45:26,082 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 17:45:26,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:26,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231459519] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:45:26,098 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:45:26,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 8] total 12 [2022-01-10 17:45:26,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377243186] [2022-01-10 17:45:26,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:45:26,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 17:45:26,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:26,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 17:45:26,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-01-10 17:45:26,099 INFO L87 Difference]: Start difference. First operand 120 states and 138 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:26,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:26,248 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2022-01-10 17:45:26,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 17:45:26,248 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 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 30 [2022-01-10 17:45:26,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:26,249 INFO L225 Difference]: With dead ends: 144 [2022-01-10 17:45:26,249 INFO L226 Difference]: Without dead ends: 115 [2022-01-10 17:45:26,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-01-10 17:45:26,250 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 80 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:45:26,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 194 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 38 Unchecked, 0.1s Time] [2022-01-10 17:45:26,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-01-10 17:45:26,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2022-01-10 17:45:26,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.2115384615384615) internal successors, (126), 108 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:26,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2022-01-10 17:45:26,262 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 30 [2022-01-10 17:45:26,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:26,262 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2022-01-10 17:45:26,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:26,263 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2022-01-10 17:45:26,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 17:45:26,263 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:26,263 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, 1] [2022-01-10 17:45:26,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 17:45:26,486 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,SelfDestructingSolverStorable19 [2022-01-10 17:45:26,487 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)] === [2022-01-10 17:45:26,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:26,487 INFO L85 PathProgramCache]: Analyzing trace with hash -2855394, now seen corresponding path program 1 times [2022-01-10 17:45:26,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:26,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608839526] [2022-01-10 17:45:26,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:26,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:26,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:26,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:26,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608839526] [2022-01-10 17:45:26,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608839526] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:45:26,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196419458] [2022-01-10 17:45:26,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:26,853 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:45:26,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:45:26,856 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:45:26,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 17:45:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:27,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 68 conjunts are in the unsatisfiable core [2022-01-10 17:45:27,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:45:27,146 INFO L387 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 [2022-01-10 17:45:27,182 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 17:45:27,187 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 17:45:27,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:45:27,312 INFO L387 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 31 treesize of output 33 [2022-01-10 17:45:27,324 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 17:45:27,324 INFO L387 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 30 treesize of output 34 [2022-01-10 17:45:27,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:45:27,331 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2022-01-10 17:45:27,364 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 17:45:27,364 INFO L387 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 22 treesize of output 24 [2022-01-10 17:45:27,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:45:27,380 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2022-01-10 17:45:27,386 INFO L387 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 30 treesize of output 30 [2022-01-10 17:45:27,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:45:27,583 INFO L353 Elim1Store]: treesize reduction 91, result has 20.9 percent of original size [2022-01-10 17:45:27,583 INFO L387 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 2 case distinctions, treesize of input 149 treesize of output 93 [2022-01-10 17:45:27,655 INFO L353 Elim1Store]: treesize reduction 128, result has 30.4 percent of original size [2022-01-10 17:45:27,656 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 256 treesize of output 236 [2022-01-10 17:45:27,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:45:27,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:45:27,702 INFO L353 Elim1Store]: treesize reduction 80, result has 49.4 percent of original size [2022-01-10 17:45:27,703 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 187 [2022-01-10 17:45:27,731 INFO L353 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2022-01-10 17:45:27,731 INFO L387 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 49 treesize of output 49 [2022-01-10 17:45:27,744 INFO L387 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 111 treesize of output 87 [2022-01-10 17:45:27,752 INFO L387 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 111 treesize of output 87 [2022-01-10 17:45:28,022 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2022-01-10 17:45:28,137 INFO L387 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 35 treesize of output 27 [2022-01-10 17:45:28,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:45:28,528 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:45:28,531 INFO L353 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-01-10 17:45:28,532 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 22 [2022-01-10 17:45:28,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:45:28,540 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:45:28,542 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:45:28,542 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 13 [2022-01-10 17:45:28,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:28,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:45:30,850 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:45:30,851 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 247 treesize of output 246 [2022-01-10 17:45:30,949 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:30,955 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:30,970 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:31,005 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:31,012 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:31,029 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:31,078 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:31,085 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:31,115 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:31,390 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:31,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:31,418 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:31,457 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:31,465 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:31,482 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:31,545 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:31,554 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:31,585 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:31,629 INFO L387 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 143 treesize of output 101 [2022-01-10 17:45:31,637 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:31,644 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:31,663 INFO L387 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 141 treesize of output 99 [2022-01-10 17:45:31,668 INFO L387 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 125 treesize of output 89 [2022-01-10 17:45:31,676 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:31,704 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:31,714 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:31,722 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:31,744 INFO L387 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 141 treesize of output 99 [2022-01-10 17:45:31,752 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:31,759 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:31,841 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:31,850 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:31,869 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:31,913 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:31,920 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:31,938 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:31,994 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:32,002 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:32,034 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:32,381 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:32,391 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:32,410 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:32,450 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:32,458 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:32,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:32,531 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:32,540 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:32,573 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:32,610 INFO L387 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 143 treesize of output 101 [2022-01-10 17:45:32,615 INFO L387 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 127 treesize of output 91 [2022-01-10 17:45:32,623 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:32,644 INFO L387 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 141 treesize of output 99 [2022-01-10 17:45:32,653 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:32,661 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:32,688 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:32,698 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:32,706 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:32,730 INFO L387 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 141 treesize of output 99 [2022-01-10 17:45:32,735 INFO L387 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 125 treesize of output 89 [2022-01-10 17:45:32,739 INFO L387 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 109 treesize of output 79 [2022-01-10 17:45:32,804 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:32,814 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:32,823 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:32,930 INFO L387 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 141 treesize of output 99 [2022-01-10 17:45:32,940 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:32,948 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:33,040 INFO L387 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 143 treesize of output 101 [2022-01-10 17:45:33,045 INFO L387 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 127 treesize of output 91 [2022-01-10 17:45:33,053 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:33,150 INFO L387 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 141 treesize of output 99 [2022-01-10 17:45:33,161 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:33,170 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:33,986 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:34,006 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:34,017 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:34,060 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:34,074 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:34,098 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:34,163 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:34,194 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:34,208 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:34,531 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:34,551 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:34,562 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:34,597 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:34,609 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:34,624 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:34,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:34,696 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:34,707 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:34,739 INFO L387 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 141 treesize of output 99 [2022-01-10 17:45:34,747 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:34,754 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:34,774 INFO L387 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 143 treesize of output 101 [2022-01-10 17:45:34,779 INFO L387 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 127 treesize of output 91 [2022-01-10 17:45:34,783 INFO L387 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 111 treesize of output 81 [2022-01-10 17:45:34,803 INFO L387 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 141 treesize of output 99 [2022-01-10 17:45:34,808 INFO L387 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 125 treesize of output 89 [2022-01-10 17:45:34,812 INFO L387 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 109 treesize of output 79 [2022-01-10 17:45:34,837 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:34,846 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:34,854 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:34,915 INFO L387 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 141 treesize of output 99 [2022-01-10 17:45:34,925 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:34,935 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:35,034 INFO L387 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 143 treesize of output 101 [2022-01-10 17:45:35,043 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:35,051 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:35,147 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:35,157 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:35,165 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:35,263 INFO L387 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 141 treesize of output 99 [2022-01-10 17:45:35,269 INFO L387 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 125 treesize of output 89 [2022-01-10 17:45:35,274 INFO L387 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 109 treesize of output 79 [2022-01-10 17:45:39,954 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:39,982 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:39,999 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:40,043 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:40,057 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:40,076 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:40,141 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:40,180 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:40,196 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:40,492 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:40,514 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:40,525 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:40,560 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:40,572 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:40,589 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:40,640 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:40,667 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:40,679 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:40,707 INFO L387 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 141 treesize of output 99 [2022-01-10 17:45:40,716 INFO L387 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 125 treesize of output 89 [2022-01-10 17:45:40,721 INFO L387 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 109 treesize of output 79 [2022-01-10 17:45:40,742 INFO L387 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 143 treesize of output 101 [2022-01-10 17:45:40,748 INFO L387 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 127 treesize of output 91 [2022-01-10 17:45:40,752 INFO L387 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 111 treesize of output 81 [2022-01-10 17:45:40,772 INFO L387 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 141 treesize of output 99 [2022-01-10 17:45:40,777 INFO L387 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 125 treesize of output 89 [2022-01-10 17:45:40,780 INFO L387 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 109 treesize of output 79 [2022-01-10 17:45:40,803 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:40,813 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:40,821 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:40,881 INFO L387 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 141 treesize of output 99 [2022-01-10 17:45:40,891 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:40,899 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:40,982 INFO L387 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 143 treesize of output 101 [2022-01-10 17:45:40,990 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:40,996 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:41,083 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:41,093 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:41,103 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:41,214 INFO L387 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 141 treesize of output 99 [2022-01-10 17:45:41,224 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:41,233 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:41,423 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:41,443 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:41,453 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:41,485 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:41,501 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:41,517 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:41,559 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:41,583 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:41,594 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:41,856 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:41,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:41,894 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:41,929 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:41,940 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:41,956 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:41,997 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:42,019 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:42,028 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:42,052 INFO L387 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 141 treesize of output 99 [2022-01-10 17:45:42,058 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:42,064 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:42,080 INFO L387 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 143 treesize of output 101 [2022-01-10 17:45:42,084 INFO L387 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 127 treesize of output 91 [2022-01-10 17:45:42,089 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:42,103 INFO L387 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 141 treesize of output 99 [2022-01-10 17:45:42,109 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:42,113 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:42,130 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:42,137 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:42,143 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:42,194 INFO L387 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 141 treesize of output 99 [2022-01-10 17:45:42,203 INFO L387 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 125 treesize of output 89 [2022-01-10 17:45:42,210 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:42,302 INFO L387 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 143 treesize of output 101 [2022-01-10 17:45:42,306 INFO L387 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 127 treesize of output 91 [2022-01-10 17:45:42,311 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:42,402 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:42,415 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:42,425 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:42,534 INFO L387 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 141 treesize of output 99 [2022-01-10 17:45:42,540 INFO L387 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 125 treesize of output 89 [2022-01-10 17:45:42,549 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:42,707 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:42,728 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:42,738 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:42,773 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:42,784 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:42,810 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:42,867 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:42,896 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:42,908 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:43,183 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:43,198 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:43,207 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:43,234 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:43,245 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:43,270 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:43,313 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:43,336 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:43,345 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:43,369 INFO L387 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 141 treesize of output 99 [2022-01-10 17:45:43,376 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:43,381 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:43,397 INFO L387 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 143 treesize of output 101 [2022-01-10 17:45:43,400 INFO L387 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 127 treesize of output 91 [2022-01-10 17:45:43,405 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:43,419 INFO L387 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 141 treesize of output 99 [2022-01-10 17:45:43,426 INFO L387 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 125 treesize of output 89 [2022-01-10 17:45:43,435 INFO L387 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 109 treesize of output 79 [2022-01-10 17:45:43,460 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:43,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:43,473 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:43,520 INFO L387 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 141 treesize of output 99 [2022-01-10 17:45:43,525 INFO L387 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 125 treesize of output 89 [2022-01-10 17:45:43,532 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:43,638 INFO L387 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 143 treesize of output 101 [2022-01-10 17:45:43,644 INFO L387 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 127 treesize of output 91 [2022-01-10 17:45:43,652 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:43,761 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:43,772 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:43,782 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:43,885 INFO L387 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 141 treesize of output 99 [2022-01-10 17:45:43,892 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:43,897 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:44,067 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:44,093 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:44,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:44,159 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:44,176 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:44,198 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:44,264 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:44,298 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:44,318 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:44,641 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:44,662 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:44,674 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:44,712 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:44,725 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:44,769 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:44,821 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:44,849 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:44,862 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:44,889 INFO L387 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 141 treesize of output 99 [2022-01-10 17:45:44,893 INFO L387 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 125 treesize of output 89 [2022-01-10 17:45:44,900 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:44,921 INFO L387 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 143 treesize of output 101 [2022-01-10 17:45:44,925 INFO L387 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 127 treesize of output 91 [2022-01-10 17:45:44,929 INFO L387 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 111 treesize of output 81 [2022-01-10 17:45:44,945 INFO L387 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 141 treesize of output 99 [2022-01-10 17:45:44,948 INFO L387 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 125 treesize of output 89 [2022-01-10 17:45:44,951 INFO L387 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 109 treesize of output 79 [2022-01-10 17:45:44,979 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:44,988 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:44,996 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:45,059 INFO L387 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 141 treesize of output 99 [2022-01-10 17:45:45,065 INFO L387 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 125 treesize of output 89 [2022-01-10 17:45:45,072 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:45,180 INFO L387 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 143 treesize of output 101 [2022-01-10 17:45:45,186 INFO L387 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 127 treesize of output 91 [2022-01-10 17:45:45,191 INFO L387 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 111 treesize of output 81 [2022-01-10 17:45:45,295 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:45,306 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:45,313 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 17:45:45,398 INFO L387 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 141 treesize of output 99 [2022-01-10 17:45:45,402 INFO L387 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 125 treesize of output 89 [2022-01-10 17:45:45,407 INFO L387 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 109 treesize of output 79 [2022-01-10 17:45:45,568 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:45:45,580 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:45:45,581 INFO L387 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 309 treesize of output 240 [2022-01-10 17:45:45,589 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:45:45,599 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:45:45,600 INFO L387 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 240 treesize of output 230 [2022-01-10 17:45:45,611 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:45:45,626 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:45:45,656 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:45:45,656 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2607 treesize of output 2527 [2022-01-10 17:45:45,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:45:45,735 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:45:45,736 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3098 treesize of output 3082 [2022-01-10 17:45:45,804 INFO L387 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 3098 treesize of output 2996 [2022-01-10 17:45:45,832 INFO L387 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 3058 treesize of output 2632 [2022-01-10 17:45:45,872 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:45:45,873 INFO L387 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 2632 treesize of output 2474 [2022-01-10 17:45:45,914 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:45:45,915 INFO L387 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 2474 treesize of output 2352 [2022-01-10 17:45:45,968 INFO L387 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 2217 treesize of output 2121 [2022-01-10 17:45:45,997 INFO L387 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 2121 treesize of output 2073 [2022-01-10 17:45:46,025 INFO L387 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 2073 treesize of output 1977 [2022-01-10 17:45:46,053 INFO L387 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 1977 treesize of output 1929 [2022-01-10 17:45:46,082 INFO L387 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 1929 treesize of output 1905 [2022-01-10 17:45:46,110 INFO L387 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 1905 treesize of output 1713 [2022-01-10 17:45:46,141 INFO L387 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 1713 treesize of output 1701 [2022-01-10 17:45:46,172 INFO L387 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 1701 treesize of output 1677 [2022-01-10 17:45:46,212 INFO L387 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 1677 treesize of output 1665 [2022-01-10 17:45:46,235 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2022-01-10 17:45:46,235 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-01-10 17:45:46,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-01-10 17:45:46,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872721110] [2022-01-10 17:45:46,238 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-01-10 17:45:46,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 17:45:46,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:46,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 17:45:46,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=263, Unknown=4, NotChecked=0, Total=342 [2022-01-10 17:45:46,239 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:46,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:46,774 INFO L93 Difference]: Finished difference Result 244 states and 282 transitions. [2022-01-10 17:45:46,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 17:45:46,775 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-01-10 17:45:46,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:46,779 INFO L225 Difference]: With dead ends: 244 [2022-01-10 17:45:46,779 INFO L226 Difference]: Without dead ends: 194 [2022-01-10 17:45:46,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=160, Invalid=538, Unknown=4, NotChecked=0, Total=702 [2022-01-10 17:45:46,780 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 364 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 17:45:46,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [364 Valid, 298 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 17:45:46,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-01-10 17:45:46,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 109. [2022-01-10 17:45:46,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.2115384615384615) internal successors, (126), 108 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:46,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2022-01-10 17:45:46,791 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 32 [2022-01-10 17:45:46,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:46,791 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2022-01-10 17:45:46,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:46,791 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2022-01-10 17:45:46,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 17:45:46,792 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:46,792 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, 1] [2022-01-10 17:45:46,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-10 17:45:46,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:45:46,996 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 17:45:46,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:46,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1641921443, now seen corresponding path program 1 times [2022-01-10 17:45:46,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:46,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341425850] [2022-01-10 17:45:46,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:46,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:47,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:47,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341425850] [2022-01-10 17:45:47,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341425850] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:45:47,060 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:45:47,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 17:45:47,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5539843] [2022-01-10 17:45:47,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:45:47,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 17:45:47,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:47,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 17:45:47,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 17:45:47,062 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:47,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:47,163 INFO L93 Difference]: Finished difference Result 200 states and 235 transitions. [2022-01-10 17:45:47,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 17:45:47,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-01-10 17:45:47,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:47,164 INFO L225 Difference]: With dead ends: 200 [2022-01-10 17:45:47,164 INFO L226 Difference]: Without dead ends: 121 [2022-01-10 17:45:47,164 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 [2022-01-10 17:45:47,165 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 4 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:45:47,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 175 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 17:45:47,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-01-10 17:45:47,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 113. [2022-01-10 17:45:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.2037037037037037) internal successors, (130), 112 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:47,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2022-01-10 17:45:47,172 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 32 [2022-01-10 17:45:47,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:47,172 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 130 transitions. [2022-01-10 17:45:47,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:47,173 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions. [2022-01-10 17:45:47,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 17:45:47,173 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:47,173 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, 1] [2022-01-10 17:45:47,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 17:45:47,173 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 17:45:47,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:47,174 INFO L85 PathProgramCache]: Analyzing trace with hash -134369634, now seen corresponding path program 1 times [2022-01-10 17:45:47,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:47,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476448599] [2022-01-10 17:45:47,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:47,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:47,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:47,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:47,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476448599] [2022-01-10 17:45:47,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476448599] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:45:47,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513741004] [2022-01-10 17:45:47,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:47,657 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:45:47,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:45:47,659 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:45:47,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 17:45:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:48,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 106 conjunts are in the unsatisfiable core [2022-01-10 17:45:48,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:45:48,090 INFO L387 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 [2022-01-10 17:45:48,183 INFO L353 Elim1Store]: treesize reduction 122, result has 18.7 percent of original size [2022-01-10 17:45:48,183 INFO L387 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 672 treesize of output 555 [2022-01-10 17:45:48,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:45:48,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:45:48,282 INFO L353 Elim1Store]: treesize reduction 1424, result has 1.3 percent of original size [2022-01-10 17:45:48,283 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 537 treesize of output 466 [2022-01-10 17:45:48,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:45:48,291 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 256 [2022-01-10 17:45:48,349 INFO L353 Elim1Store]: treesize reduction 130, result has 21.7 percent of original size [2022-01-10 17:45:48,349 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 625 treesize of output 580 [2022-01-10 17:45:48,363 INFO L387 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 182 treesize of output 146 [2022-01-10 17:45:48,376 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-01-10 17:45:48,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:45:48,391 INFO L387 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 140 [2022-01-10 17:45:48,402 INFO L387 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 181 treesize of output 163 [2022-01-10 17:45:48,414 INFO L387 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 78 treesize of output 60 [2022-01-10 17:45:48,450 INFO L353 Elim1Store]: treesize reduction 34, result has 34.6 percent of original size [2022-01-10 17:45:48,450 INFO L387 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 33 treesize of output 37 [2022-01-10 17:45:48,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:45:48,467 INFO L387 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 55 treesize of output 42 [2022-01-10 17:45:48,478 INFO L387 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 0 case distinctions, treesize of input 74 treesize of output 62 [2022-01-10 17:45:48,934 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:45:48,934 INFO L387 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 312 treesize of output 310 [2022-01-10 17:45:49,106 INFO L387 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 35 treesize of output 23 [2022-01-10 17:45:49,111 INFO L387 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 17 treesize of output 3 [2022-01-10 17:45:49,123 INFO L387 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 100 treesize of output 80 [2022-01-10 17:45:49,128 INFO L387 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 17 treesize of output 3 [2022-01-10 17:45:49,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:45:49,397 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:45:49,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:45:49,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:45:49,409 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-01-10 17:45:49,410 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 124 treesize of output 95 [2022-01-10 17:45:49,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:45:49,417 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 17:45:49,417 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 90 [2022-01-10 17:45:49,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:45:49,429 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 17:45:49,429 INFO L387 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 92 treesize of output 82 [2022-01-10 17:45:49,448 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-01-10 17:45:49,448 INFO L387 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 29 treesize of output 29 [2022-01-10 17:45:49,454 INFO L387 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 55 treesize of output 48 [2022-01-10 17:45:49,649 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 17:45:49,649 INFO L387 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 91 treesize of output 81 [2022-01-10 17:45:49,656 INFO L387 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 55 treesize of output 48 [2022-01-10 17:45:50,652 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:45:50,655 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:45:50,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:45:50,657 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:45:50,667 INFO L353 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-01-10 17:45:50,668 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 127 treesize of output 56 [2022-01-10 17:45:50,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:45:50,676 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:45:50,682 INFO L353 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-01-10 17:45:50,683 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 26 [2022-01-10 17:45:50,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:50,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:45:51,258 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt_20| Int) (v_ArrVal_1683 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt_20| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt_20|)) (not (<= 0 (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt| v_ArrVal_1683) |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt_20| 8) 18446744073709551616)))) (and (forall ((v_ArrVal_1684 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt| v_ArrVal_1683)) (.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt_20| 8) 18446744073709551616))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt| v_ArrVal_1684) |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) .cse1)) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) .cse1))) (+ (* (- 18446744073709551616) (div (+ 8 .cse2) 18446744073709551616)) 8 .cse2)))) 0)) (forall ((v_ArrVal_1684 (Array Int Int))) (= (let ((.cse4 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt_20| 8) 18446744073709551616))) (select (let ((.cse3 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt| v_ArrVal_1684))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) .cse4))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt| v_ArrVal_1683) |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) .cse4))) (+ (* (- 18446744073709551616) (div (+ 8 .cse5) 18446744073709551616)) 8 .cse5)))) 0))))) is different from false [2022-01-10 17:45:52,290 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt_20| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt_20| Int) (v_ArrVal_1683 (Array Int Int))) (let ((.cse6 (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt_20|))) (or (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt_20| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt|)) (not (<= 0 (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt| 0)) |v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt_20| v_ArrVal_1683) |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt_20| 8) 18446744073709551616)))) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt_20|)) (and (forall ((v_ArrVal_1681 Int) (v_ArrVal_1684 (Array Int Int))) (= (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt_20| 8) 18446744073709551616))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt| v_ArrVal_1681)) |v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt_20| v_ArrVal_1684))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) .cse1))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt| 0)) |v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt_20| v_ArrVal_1683) |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) .cse1))) (+ .cse2 (* (div (+ .cse2 8) 18446744073709551616) (- 18446744073709551616)) 8)))) 0)) (forall ((v_ArrVal_1681 Int) (v_ArrVal_1684 (Array Int Int))) (= (let ((.cse3 (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt| 0)) |v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt_20| v_ArrVal_1683)) (.cse4 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt_20| 8) 18446744073709551616))) (select (select .cse3 (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt| v_ArrVal_1681)) |v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt_20| v_ArrVal_1684) |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) .cse4)) (let ((.cse5 (select (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) .cse4))) (+ .cse5 (* (div (+ .cse5 8) 18446744073709551616) (- 18446744073709551616)) 8)))) 0))) (not (<= .cse6 0)) (not (<= 0 .cse6))))) is different from false [2022-01-10 17:45:55,312 INFO L353 Elim1Store]: treesize reduction 63, result has 61.8 percent of original size [2022-01-10 17:45:55,313 INFO L387 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 4 case distinctions, treesize of input 17898 treesize of output 13943 [2022-01-10 17:45:57,994 INFO L353 Elim1Store]: treesize reduction 322, result has 74.7 percent of original size [2022-01-10 17:45:57,999 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 25525367 treesize of output 24631445 [2022-01-10 17:46:01,489 INFO L353 Elim1Store]: treesize reduction 23, result has 67.1 percent of original size [2022-01-10 17:46:01,494 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33998485 treesize of output 18690803 [2022-01-10 17:46:09,004 WARN L228 SmtUtils]: Spent 7.50s on a formula simplification that was a NOOP. DAG size: 4935 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)