./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-queue-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/sll-queue-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af4a0e4f738e916feae01fb2c2f056f4ba7834b8a7b8d69765614c5417c16c63 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:24:53,473 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:24:53,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:24:53,518 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:24:53,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:24:53,520 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:24:53,522 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:24:53,527 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:24:53,528 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:24:53,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:24:53,533 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:24:53,535 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:24:53,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:24:53,537 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:24:53,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:24:53,540 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:24:53,541 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:24:53,542 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:24:53,543 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:24:53,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:24:53,550 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:24:53,551 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:24:53,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:24:53,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:24:53,554 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:24:53,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:24:53,560 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:24:53,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:24:53,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:24:53,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:24:53,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:24:53,563 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:24:53,565 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:24:53,565 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:24:53,566 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:24:53,567 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:24:53,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:24:53,567 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:24:53,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:24:53,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:24:53,568 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:24:53,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:24:53,571 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:24:53,598 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:24:53,599 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:24:53,599 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:24:53,600 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:24:53,600 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:24:53,600 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:24:53,601 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:24:53,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:24:53,601 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:24:53,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:24:53,602 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:24:53,602 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:24:53,603 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:24:53,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:24:53,603 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:24:53,603 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:24:53,603 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:24:53,604 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:24:53,604 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:24:53,605 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:24:53,605 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:24:53,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:24:53,605 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:24:53,606 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:24:53,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:24:53,606 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:24:53,606 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:24:53,606 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:24:53,607 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:24:53,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:24:53,607 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:24:53,607 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:24:53,608 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:24:53,608 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> af4a0e4f738e916feae01fb2c2f056f4ba7834b8a7b8d69765614c5417c16c63 [2022-07-12 03:24:53,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:24:53,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:24:53,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:24:53,849 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:24:53,849 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:24:53,850 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-queue-2.i [2022-07-12 03:24:53,913 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c61298c16/11eb35a62ca541459e8caf8285f45b6b/FLAGf0e7a956f [2022-07-12 03:24:54,445 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:24:54,449 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i [2022-07-12 03:24:54,465 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c61298c16/11eb35a62ca541459e8caf8285f45b6b/FLAGf0e7a956f [2022-07-12 03:24:54,757 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c61298c16/11eb35a62ca541459e8caf8285f45b6b [2022-07-12 03:24:54,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:24:54,760 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:24:54,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:24:54,762 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:24:54,765 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:24:54,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:24:54" (1/1) ... [2022-07-12 03:24:54,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19d939d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:24:54, skipping insertion in model container [2022-07-12 03:24:54,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:24:54" (1/1) ... [2022-07-12 03:24:54,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:24:54,822 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:24:55,067 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22387,22400] [2022-07-12 03:24:55,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22458,22471] [2022-07-12 03:24:55,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22532,22545] [2022-07-12 03:24:55,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22624,22637] [2022-07-12 03:24:55,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22701,22714] [2022-07-12 03:24:55,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22796,22809] [2022-07-12 03:24:55,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22873,22886] [2022-07-12 03:24:55,079 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22956,22969] [2022-07-12 03:24:55,081 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23051,23064] [2022-07-12 03:24:55,082 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23128,23141] [2022-07-12 03:24:55,084 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23211,23224] [2022-07-12 03:24:55,085 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23300,23313] [2022-07-12 03:24:55,086 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23386,23399] [2022-07-12 03:24:55,088 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23532,23545] [2022-07-12 03:24:55,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:24:55,097 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:24:55,134 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22387,22400] [2022-07-12 03:24:55,135 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22458,22471] [2022-07-12 03:24:55,135 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22532,22545] [2022-07-12 03:24:55,136 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22624,22637] [2022-07-12 03:24:55,136 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22701,22714] [2022-07-12 03:24:55,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22796,22809] [2022-07-12 03:24:55,140 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22873,22886] [2022-07-12 03:24:55,144 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22956,22969] [2022-07-12 03:24:55,145 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23051,23064] [2022-07-12 03:24:55,145 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23128,23141] [2022-07-12 03:24:55,146 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23211,23224] [2022-07-12 03:24:55,146 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23300,23313] [2022-07-12 03:24:55,147 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23386,23399] [2022-07-12 03:24:55,148 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23532,23545] [2022-07-12 03:24:55,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:24:55,170 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:24:55,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:24:55 WrapperNode [2022-07-12 03:24:55,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:24:55,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:24:55,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:24:55,172 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:24:55,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:24:55" (1/1) ... [2022-07-12 03:24:55,199 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:24:55" (1/1) ... [2022-07-12 03:24:55,220 INFO L137 Inliner]: procedures = 119, calls = 35, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 219 [2022-07-12 03:24:55,221 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:24:55,221 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:24:55,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:24:55,222 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:24:55,227 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:24:55" (1/1) ... [2022-07-12 03:24:55,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:24:55" (1/1) ... [2022-07-12 03:24:55,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:24:55" (1/1) ... [2022-07-12 03:24:55,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:24:55" (1/1) ... [2022-07-12 03:24:55,243 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:24:55" (1/1) ... [2022-07-12 03:24:55,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:24:55" (1/1) ... [2022-07-12 03:24:55,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:24:55" (1/1) ... [2022-07-12 03:24:55,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:24:55,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:24:55,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:24:55,265 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:24:55,266 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:24:55" (1/1) ... [2022-07-12 03:24:55,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:24:55,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:24:55,303 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 03:24:55,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 03:24:55,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 03:24:55,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 03:24:55,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:24:55,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:24:55,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:24:55,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:24:55,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:24:55,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:24:55,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:24:55,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:24:55,487 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:24:55,489 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:24:55,826 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:24:55,836 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:24:55,836 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2022-07-12 03:24:55,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:24:55 BoogieIcfgContainer [2022-07-12 03:24:55,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:24:55,840 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:24:55,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:24:55,845 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:24:55,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:24:54" (1/3) ... [2022-07-12 03:24:55,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13bf09af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:24:55, skipping insertion in model container [2022-07-12 03:24:55,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:24:55" (2/3) ... [2022-07-12 03:24:55,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13bf09af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:24:55, skipping insertion in model container [2022-07-12 03:24:55,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:24:55" (3/3) ... [2022-07-12 03:24:55,848 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-queue-2.i [2022-07-12 03:24:55,860 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:24:55,861 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-07-12 03:24:55,924 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:24:55,932 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@268a834, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3b70b236 [2022-07-12 03:24:55,933 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-07-12 03:24:55,946 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 70 states have (on average 2.0) internal successors, (140), 84 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:24:55,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 03:24:55,953 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:24:55,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 03:24:55,954 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-12 03:24:55,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:24:55,960 INFO L85 PathProgramCache]: Analyzing trace with hash 28752478, now seen corresponding path program 1 times [2022-07-12 03:24:55,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:24:55,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400977607] [2022-07-12 03:24:55,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:24:55,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:24:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:24:56,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:24:56,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:24:56,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400977607] [2022-07-12 03:24:56,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400977607] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:24:56,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:24:56,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:24:56,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650740604] [2022-07-12 03:24:56,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:24:56,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:24:56,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:24:56,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:24:56,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:24:56,170 INFO L87 Difference]: Start difference. First operand has 85 states, 70 states have (on average 2.0) internal successors, (140), 84 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:24:56,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:24:56,201 INFO L93 Difference]: Finished difference Result 168 states and 278 transitions. [2022-07-12 03:24:56,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:24:56,204 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-07-12 03:24:56,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:24:56,212 INFO L225 Difference]: With dead ends: 168 [2022-07-12 03:24:56,212 INFO L226 Difference]: Without dead ends: 80 [2022-07-12 03:24:56,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:24:56,219 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:24:56,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:24:56,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-12 03:24:56,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-12 03:24:56,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 79 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:24:56,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2022-07-12 03:24:56,266 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 5 [2022-07-12 03:24:56,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:24:56,268 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2022-07-12 03:24:56,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:24:56,268 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-07-12 03:24:56,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 03:24:56,269 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:24:56,269 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 03:24:56,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:24:56,270 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-12 03:24:56,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:24:56,271 INFO L85 PathProgramCache]: Analyzing trace with hash 889571111, now seen corresponding path program 1 times [2022-07-12 03:24:56,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:24:56,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306546482] [2022-07-12 03:24:56,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:24:56,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:24:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:24:56,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:24:56,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:24:56,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306546482] [2022-07-12 03:24:56,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306546482] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:24:56,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:24:56,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:24:56,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923711658] [2022-07-12 03:24:56,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:24:56,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:24:56,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:24:56,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:24:56,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:24:56,338 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:24:56,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:24:56,371 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2022-07-12 03:24:56,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:24:56,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-07-12 03:24:56,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:24:56,376 INFO L225 Difference]: With dead ends: 80 [2022-07-12 03:24:56,376 INFO L226 Difference]: Without dead ends: 70 [2022-07-12 03:24:56,376 INFO L412 NwaCegarLoop]: 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-07-12 03:24:56,378 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 75 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:24:56,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 67 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:24:56,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-12 03:24:56,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-07-12 03:24:56,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 69 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:24:56,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2022-07-12 03:24:56,393 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 6 [2022-07-12 03:24:56,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:24:56,394 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2022-07-12 03:24:56,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:24:56,395 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2022-07-12 03:24:56,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 03:24:56,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:24:56,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:24:56,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:24:56,396 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-12 03:24:56,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:24:56,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1270244236, now seen corresponding path program 1 times [2022-07-12 03:24:56,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:24:56,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686585138] [2022-07-12 03:24:56,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:24:56,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:24:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:24:56,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:24:56,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:24:56,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686585138] [2022-07-12 03:24:56,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686585138] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:24:56,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:24:56,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:24:56,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769254395] [2022-07-12 03:24:56,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:24:56,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:24:56,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:24:56,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:24:56,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:24:56,478 INFO L87 Difference]: Start difference. First operand 70 states and 79 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-07-12 03:24:56,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:24:56,515 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2022-07-12 03:24:56,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:24:56,515 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-07-12 03:24:56,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:24:56,516 INFO L225 Difference]: With dead ends: 70 [2022-07-12 03:24:56,517 INFO L226 Difference]: Without dead ends: 68 [2022-07-12 03:24:56,517 INFO L412 NwaCegarLoop]: 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-07-12 03:24:56,518 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 58 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:24:56,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 82 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:24:56,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-12 03:24:56,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-07-12 03:24:56,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 67 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:24:56,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-07-12 03:24:56,525 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 9 [2022-07-12 03:24:56,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:24:56,526 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-07-12 03:24:56,526 INFO L496 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-07-12 03:24:56,527 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-07-12 03:24:56,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 03:24:56,528 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:24:56,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:24:56,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 03:24:56,529 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-12 03:24:56,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:24:56,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1286414876, now seen corresponding path program 1 times [2022-07-12 03:24:56,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:24:56,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064109896] [2022-07-12 03:24:56,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:24:56,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:24:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:24:56,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:24:56,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:24:56,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064109896] [2022-07-12 03:24:56,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064109896] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:24:56,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:24:56,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:24:56,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333940536] [2022-07-12 03:24:56,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:24:56,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:24:56,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:24:56,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:24:56,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:24:56,574 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:24:56,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:24:56,599 INFO L93 Difference]: Finished difference Result 153 states and 178 transitions. [2022-07-12 03:24:56,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:24:56,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-07-12 03:24:56,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:24:56,601 INFO L225 Difference]: With dead ends: 153 [2022-07-12 03:24:56,601 INFO L226 Difference]: Without dead ends: 87 [2022-07-12 03:24:56,601 INFO L412 NwaCegarLoop]: 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-07-12 03:24:56,602 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 17 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:24:56,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 135 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:24:56,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-12 03:24:56,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2022-07-12 03:24:56,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 75 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:24:56,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2022-07-12 03:24:56,608 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 12 [2022-07-12 03:24:56,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:24:56,609 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2022-07-12 03:24:56,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:24:56,609 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2022-07-12 03:24:56,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 03:24:56,610 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:24:56,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:24:56,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 03:24:56,610 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-12 03:24:56,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:24:56,611 INFO L85 PathProgramCache]: Analyzing trace with hash -138012862, now seen corresponding path program 1 times [2022-07-12 03:24:56,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:24:56,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300641799] [2022-07-12 03:24:56,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:24:56,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:24:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:24:56,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:24:56,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:24:56,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300641799] [2022-07-12 03:24:56,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300641799] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:24:56,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:24:56,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:24:56,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564489891] [2022-07-12 03:24:56,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:24:56,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:24:56,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:24:56,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:24:56,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:24:56,679 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:24:56,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:24:56,744 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2022-07-12 03:24:56,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:24:56,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-12 03:24:56,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:24:56,745 INFO L225 Difference]: With dead ends: 91 [2022-07-12 03:24:56,745 INFO L226 Difference]: Without dead ends: 71 [2022-07-12 03:24:56,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:24:56,747 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 6 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:24:56,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 265 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:24:56,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-12 03:24:56,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-07-12 03:24:56,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 63 states have (on average 1.253968253968254) internal successors, (79), 70 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:24:56,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2022-07-12 03:24:56,752 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 17 [2022-07-12 03:24:56,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:24:56,752 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2022-07-12 03:24:56,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:24:56,753 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2022-07-12 03:24:56,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 03:24:56,753 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:24:56,754 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:24:56,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 03:24:56,754 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-12 03:24:56,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:24:56,754 INFO L85 PathProgramCache]: Analyzing trace with hash -472870040, now seen corresponding path program 1 times [2022-07-12 03:24:56,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:24:56,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591988162] [2022-07-12 03:24:56,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:24:56,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:24:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:24:56,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:24:56,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:24:56,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591988162] [2022-07-12 03:24:56,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591988162] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:24:56,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089117872] [2022-07-12 03:24:56,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:24:56,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:24:56,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:24:56,855 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:24:56,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 03:24:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:24:56,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 03:24:56,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:24:57,008 INFO L390 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-07-12 03:24:57,054 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:24:57,054 INFO L390 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 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 03:24:57,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-12 03:24:57,063 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:24:57,096 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:24:57,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-12 03:24:57,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-12 03:24:57,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:24:57,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:24:57,225 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_163 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-12 03:24:57,241 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:24:57,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2022-07-12 03:24:57,251 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:24:57,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2022-07-12 03:24:57,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-07-12 03:24:57,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:24:57,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089117872] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:24:57,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:24:57,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-07-12 03:24:57,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684735353] [2022-07-12 03:24:57,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:24:57,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 03:24:57,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:24:57,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 03:24:57,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=81, Unknown=1, NotChecked=18, Total=132 [2022-07-12 03:24:57,357 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:24:57,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:24:57,501 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2022-07-12 03:24:57,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:24:57,501 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-12 03:24:57,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:24:57,502 INFO L225 Difference]: With dead ends: 144 [2022-07-12 03:24:57,502 INFO L226 Difference]: Without dead ends: 142 [2022-07-12 03:24:57,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=95, Unknown=1, NotChecked=20, Total=156 [2022-07-12 03:24:57,503 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 124 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:24:57,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 455 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 133 Invalid, 0 Unknown, 133 Unchecked, 0.1s Time] [2022-07-12 03:24:57,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-12 03:24:57,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 84. [2022-07-12 03:24:57,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.236842105263158) internal successors, (94), 83 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:24:57,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2022-07-12 03:24:57,509 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 19 [2022-07-12 03:24:57,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:24:57,510 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2022-07-12 03:24:57,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:24:57,510 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2022-07-12 03:24:57,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 03:24:57,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:24:57,510 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:24:57,539 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-07-12 03:24:57,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-12 03:24:57,729 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-12 03:24:57,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:24:57,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1456359625, now seen corresponding path program 1 times [2022-07-12 03:24:57,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:24:57,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501593179] [2022-07-12 03:24:57,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:24:57,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:24:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:24:57,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:24:57,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:24:57,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501593179] [2022-07-12 03:24:57,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501593179] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:24:57,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:24:57,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:24:57,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311290211] [2022-07-12 03:24:57,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:24:57,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:24:57,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:24:57,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:24:57,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:24:57,785 INFO L87 Difference]: Start difference. First operand 84 states and 94 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-07-12 03:24:57,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:24:57,815 INFO L93 Difference]: Finished difference Result 174 states and 199 transitions. [2022-07-12 03:24:57,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:24:57,816 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-07-12 03:24:57,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:24:57,818 INFO L225 Difference]: With dead ends: 174 [2022-07-12 03:24:57,818 INFO L226 Difference]: Without dead ends: 108 [2022-07-12 03:24:57,819 INFO L412 NwaCegarLoop]: 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-07-12 03:24:57,820 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 24 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:24:57,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 127 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:24:57,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-12 03:24:57,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2022-07-12 03:24:57,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 89 states have (on average 1.202247191011236) internal successors, (107), 96 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:24:57,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2022-07-12 03:24:57,832 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 20 [2022-07-12 03:24:57,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:24:57,833 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2022-07-12 03:24:57,833 INFO L496 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-07-12 03:24:57,833 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2022-07-12 03:24:57,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 03:24:57,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:24:57,834 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:24:57,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 03:24:57,834 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-12 03:24:57,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:24:57,834 INFO L85 PathProgramCache]: Analyzing trace with hash 886899864, now seen corresponding path program 1 times [2022-07-12 03:24:57,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:24:57,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331760313] [2022-07-12 03:24:57,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:24:57,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:24:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:24:57,909 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 03:24:57,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:24:57,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331760313] [2022-07-12 03:24:57,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331760313] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:24:57,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:24:57,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:24:57,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736398163] [2022-07-12 03:24:57,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:24:57,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:24:57,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:24:57,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:24:57,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:24:57,912 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-07-12 03:24:57,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:24:57,942 INFO L93 Difference]: Finished difference Result 201 states and 228 transitions. [2022-07-12 03:24:57,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:24:57,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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 27 [2022-07-12 03:24:57,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:24:57,944 INFO L225 Difference]: With dead ends: 201 [2022-07-12 03:24:57,944 INFO L226 Difference]: Without dead ends: 122 [2022-07-12 03:24:57,946 INFO L412 NwaCegarLoop]: 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-07-12 03:24:57,947 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 30 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:24:57,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 142 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:24:57,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-12 03:24:57,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2022-07-12 03:24:57,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 109 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:24:57,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-07-12 03:24:57,954 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 27 [2022-07-12 03:24:57,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:24:57,955 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-07-12 03:24:57,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-07-12 03:24:57,955 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-07-12 03:24:57,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 03:24:57,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:24:57,956 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:24:57,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 03:24:57,956 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-12 03:24:57,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:24:57,957 INFO L85 PathProgramCache]: Analyzing trace with hash 2041801735, now seen corresponding path program 1 times [2022-07-12 03:24:57,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:24:57,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084792630] [2022-07-12 03:24:57,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:24:57,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:24:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:24:58,119 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:24:58,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:24:58,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084792630] [2022-07-12 03:24:58,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084792630] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:24:58,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150162938] [2022-07-12 03:24:58,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:24:58,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:24:58,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:24:58,124 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:24:58,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 03:24:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:24:58,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-12 03:24:58,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:24:58,240 INFO L390 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-07-12 03:24:58,289 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 03:24:58,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 03:24:58,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-12 03:24:58,310 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:24:58,337 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:24:58,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:24:58,427 INFO L356 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-07-12 03:24:58,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 40 [2022-07-12 03:24:58,441 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-12 03:24:58,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-07-12 03:24:58,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-07-12 03:24:58,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-12 03:24:58,568 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:24:58,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:24:58,594 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_388 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_388) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-12 03:24:58,610 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_21| Int) (v_ArrVal_386 (Array Int Int)) (v_ArrVal_388 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_386) |v_ULTIMATE.start_main_~item~0#1.base_21| v_ArrVal_388) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_21|) 0)))) is different from false [2022-07-12 03:24:58,686 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:24:58,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-12 03:24:58,696 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:24:58,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 185 treesize of output 144 [2022-07-12 03:24:58,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 106 [2022-07-12 03:24:58,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2022-07-12 03:24:58,852 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-12 03:24:58,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150162938] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:24:58,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:24:58,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 16 [2022-07-12 03:24:58,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352581658] [2022-07-12 03:24:58,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:24:58,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 03:24:58,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:24:58,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 03:24:58,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=140, Unknown=2, NotChecked=50, Total=240 [2022-07-12 03:24:58,855 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:24:59,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:24:59,096 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2022-07-12 03:24:59,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 03:24:59,096 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-12 03:24:59,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:24:59,097 INFO L225 Difference]: With dead ends: 170 [2022-07-12 03:24:59,097 INFO L226 Difference]: Without dead ends: 168 [2022-07-12 03:24:59,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=230, Unknown=2, NotChecked=66, Total=380 [2022-07-12 03:24:59,098 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 186 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 248 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:24:59,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 455 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 153 Invalid, 0 Unknown, 248 Unchecked, 0.1s Time] [2022-07-12 03:24:59,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-12 03:24:59,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 126. [2022-07-12 03:24:59,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 125 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-07-12 03:24:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2022-07-12 03:24:59,104 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 28 [2022-07-12 03:24:59,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:24:59,104 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2022-07-12 03:24:59,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:24:59,104 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2022-07-12 03:24:59,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 03:24:59,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:24:59,105 INFO L195 NwaCegarLoop]: 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] [2022-07-12 03:24:59,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 03:24:59,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-12 03:24:59,324 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-12 03:24:59,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:24:59,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1259768676, now seen corresponding path program 1 times [2022-07-12 03:24:59,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:24:59,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617067807] [2022-07-12 03:24:59,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:24:59,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:24:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:24:59,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 03:24:59,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:24:59,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617067807] [2022-07-12 03:24:59,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617067807] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:24:59,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:24:59,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:24:59,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693482982] [2022-07-12 03:24:59,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:24:59,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:24:59,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:24:59,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:24:59,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:24:59,366 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:24:59,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:24:59,376 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2022-07-12 03:24:59,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:24:59,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-12 03:24:59,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:24:59,377 INFO L225 Difference]: With dead ends: 129 [2022-07-12 03:24:59,377 INFO L226 Difference]: Without dead ends: 127 [2022-07-12 03:24:59,377 INFO L412 NwaCegarLoop]: 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-07-12 03:24:59,378 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 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-07-12 03:24:59,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:24:59,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-12 03:24:59,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-07-12 03:24:59,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 119 states have (on average 1.1680672268907564) internal successors, (139), 126 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:24:59,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 139 transitions. [2022-07-12 03:24:59,383 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 139 transitions. Word has length 29 [2022-07-12 03:24:59,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:24:59,384 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 139 transitions. [2022-07-12 03:24:59,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:24:59,384 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 139 transitions. [2022-07-12 03:24:59,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 03:24:59,388 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:24:59,388 INFO L195 NwaCegarLoop]: 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] [2022-07-12 03:24:59,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 03:24:59,389 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-12 03:24:59,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:24:59,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1259766754, now seen corresponding path program 1 times [2022-07-12 03:24:59,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:24:59,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064666315] [2022-07-12 03:24:59,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:24:59,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:24:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:24:59,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:24:59,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:24:59,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064666315] [2022-07-12 03:24:59,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064666315] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:24:59,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182692586] [2022-07-12 03:24:59,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:24:59,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:24:59,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:24:59,672 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:24:59,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 03:24:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:24:59,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-12 03:24:59,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:24:59,775 INFO L390 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-07-12 03:24:59,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-12 03:24:59,804 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:24:59,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 03:24:59,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:24:59,817 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:24:59,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 03:24:59,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-12 03:24:59,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:24:59,863 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:24:59,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 45 [2022-07-12 03:24:59,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 03:24:59,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-07-12 03:25:00,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-12 03:25:00,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-07-12 03:25:00,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:25:00,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:25:00,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:25:00,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 60 [2022-07-12 03:25:00,144 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_506 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_506) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)) (forall ((v_ArrVal_509 (Array Int Int))) (= |c_ULTIMATE.start_main_~item~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_509) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-12 03:25:00,155 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:25:00,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-12 03:25:00,161 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:25:00,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-07-12 03:25:00,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-12 03:25:00,177 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 03:25:00,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 1 [2022-07-12 03:25:00,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:25:00,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182692586] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:25:00,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:25:00,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2022-07-12 03:25:00,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260148568] [2022-07-12 03:25:00,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:25:00,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 03:25:00,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:25:00,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 03:25:00,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=152, Unknown=1, NotChecked=24, Total=210 [2022-07-12 03:25:00,222 INFO L87 Difference]: Start difference. First operand 127 states and 139 transitions. Second operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 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-07-12 03:25:00,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:25:00,641 INFO L93 Difference]: Finished difference Result 218 states and 236 transitions. [2022-07-12 03:25:00,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 03:25:00,642 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 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) Word has length 29 [2022-07-12 03:25:00,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:25:00,643 INFO L225 Difference]: With dead ends: 218 [2022-07-12 03:25:00,643 INFO L226 Difference]: Without dead ends: 216 [2022-07-12 03:25:00,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=296, Unknown=1, NotChecked=36, Total=420 [2022-07-12 03:25:00,644 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 273 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:25:00,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 649 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 217 Invalid, 0 Unknown, 147 Unchecked, 0.2s Time] [2022-07-12 03:25:00,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-12 03:25:00,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 136. [2022-07-12 03:25:00,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 128 states have (on average 1.1640625) internal successors, (149), 135 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:25:00,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 149 transitions. [2022-07-12 03:25:00,653 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 149 transitions. Word has length 29 [2022-07-12 03:25:00,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:25:00,653 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 149 transitions. [2022-07-12 03:25:00,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 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-07-12 03:25:00,654 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 149 transitions. [2022-07-12 03:25:00,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 03:25:00,656 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:25:00,657 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:25:00,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 03:25:00,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:25:00,872 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-12 03:25:00,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:25:00,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1992708989, now seen corresponding path program 1 times [2022-07-12 03:25:00,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:25:00,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147443972] [2022-07-12 03:25:00,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:25:00,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:25:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:25:01,055 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:25:01,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:25:01,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147443972] [2022-07-12 03:25:01,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147443972] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:25:01,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123568350] [2022-07-12 03:25:01,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:25:01,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:25:01,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:25:01,057 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:25:01,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 03:25:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:25:01,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-12 03:25:01,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:25:01,174 INFO L390 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-07-12 03:25:01,211 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 03:25:01,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 03:25:01,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-12 03:25:01,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:25:01,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-12 03:25:01,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:25:01,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:25:01,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:25:01,354 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 03:25:01,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 42 [2022-07-12 03:25:01,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:25:01,367 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 03:25:01,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 50 [2022-07-12 03:25:01,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:25:01,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:25:01,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-07-12 03:25:01,392 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-12 03:25:01,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-07-12 03:25:01,458 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-12 03:25:01,458 INFO L390 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 54 [2022-07-12 03:25:01,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-12 03:25:01,609 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 03:25:01,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 26 [2022-07-12 03:25:01,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 3 [2022-07-12 03:25:01,615 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:25:01,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:25:01,648 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_649 (Array Int Int)) (v_ArrVal_650 (Array Int Int))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_649))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_650) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))) is different from false [2022-07-12 03:25:01,775 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:25:01,776 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2022-07-12 03:25:01,785 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_649 (Array Int Int)) (v_ArrVal_650 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_12 |c_ULTIMATE.start_main_~item~0#1.offset|))) (or (= .cse0 0) (not (= (select |c_#valid| .cse0) 0)) (not (= 0 (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_12) .cse0 v_ArrVal_649))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_645) .cse0 v_ArrVal_650) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2022-07-12 03:25:01,805 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:25:01,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 65 [2022-07-12 03:25:01,812 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:25:01,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 49 [2022-07-12 03:25:01,864 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:25:01,868 INFO L390 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 7 new quantified variables, introduced 10 case distinctions, treesize of input 734 treesize of output 649 [2022-07-12 03:25:01,910 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:25:01,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1711 treesize of output 1646 [2022-07-12 03:25:02,009 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:25:02,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1145 treesize of output 1117 [2022-07-12 03:25:02,090 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:25:02,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1583 treesize of output 1431 [2022-07-12 03:25:02,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 759 treesize of output 721 [2022-07-12 03:25:02,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 731 treesize of output 669 [2022-07-12 03:27:04,475 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-12 03:27:04,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123568350] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:27:04,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:27:04,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 18 [2022-07-12 03:27:04,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949450288] [2022-07-12 03:27:04,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:27:04,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 03:27:04,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:27:04,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 03:27:04,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=196, Unknown=3, NotChecked=58, Total=306 [2022-07-12 03:27:04,477 INFO L87 Difference]: Start difference. First operand 136 states and 149 transitions. Second operand has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:27:04,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:27:04,750 INFO L93 Difference]: Finished difference Result 158 states and 172 transitions. [2022-07-12 03:27:04,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 03:27:04,750 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-12 03:27:04,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:27:04,751 INFO L225 Difference]: With dead ends: 158 [2022-07-12 03:27:04,751 INFO L226 Difference]: Without dead ends: 156 [2022-07-12 03:27:04,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=308, Unknown=3, NotChecked=74, Total=462 [2022-07-12 03:27:04,753 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 88 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 222 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:27:04,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 629 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 222 Invalid, 0 Unknown, 222 Unchecked, 0.1s Time] [2022-07-12 03:27:04,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-12 03:27:04,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 139. [2022-07-12 03:27:04,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 131 states have (on average 1.1603053435114503) internal successors, (152), 138 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:27:04,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 152 transitions. [2022-07-12 03:27:04,759 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 152 transitions. Word has length 31 [2022-07-12 03:27:04,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:27:04,759 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 152 transitions. [2022-07-12 03:27:04,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:27:04,760 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 152 transitions. [2022-07-12 03:27:04,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 03:27:04,760 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:27:04,760 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:27:04,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 03:27:04,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:27:04,972 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-12 03:27:04,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:27:04,972 INFO L85 PathProgramCache]: Analyzing trace with hash 509365297, now seen corresponding path program 1 times [2022-07-12 03:27:04,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:27:04,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294554123] [2022-07-12 03:27:04,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:27:04,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:27:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:05,026 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 03:27:05,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:27:05,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294554123] [2022-07-12 03:27:05,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294554123] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:27:05,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:27:05,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:27:05,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063057366] [2022-07-12 03:27:05,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:27:05,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:27:05,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:27:05,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:27:05,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:27:05,027 INFO L87 Difference]: Start difference. First operand 139 states and 152 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-07-12 03:27:05,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:27:05,051 INFO L93 Difference]: Finished difference Result 204 states and 226 transitions. [2022-07-12 03:27:05,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:27:05,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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 36 [2022-07-12 03:27:05,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:27:05,052 INFO L225 Difference]: With dead ends: 204 [2022-07-12 03:27:05,052 INFO L226 Difference]: Without dead ends: 111 [2022-07-12 03:27:05,052 INFO L412 NwaCegarLoop]: 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-07-12 03:27:05,053 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 41 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:27:05,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 122 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:27:05,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-12 03:27:05,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 96. [2022-07-12 03:27:05,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 91 states have (on average 1.120879120879121) internal successors, (102), 95 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:27:05,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2022-07-12 03:27:05,057 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 36 [2022-07-12 03:27:05,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:27:05,057 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2022-07-12 03:27:05,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-07-12 03:27:05,058 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2022-07-12 03:27:05,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 03:27:05,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:27:05,058 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:27:05,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 03:27:05,058 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-12 03:27:05,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:27:05,059 INFO L85 PathProgramCache]: Analyzing trace with hash 525270376, now seen corresponding path program 1 times [2022-07-12 03:27:05,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:27:05,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799809537] [2022-07-12 03:27:05,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:27:05,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:27:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:05,095 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:27:05,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:27:05,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799809537] [2022-07-12 03:27:05,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799809537] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:27:05,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:27:05,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:27:05,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033448067] [2022-07-12 03:27:05,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:27:05,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:27:05,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:27:05,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:27:05,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:27:05,097 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:27:05,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:27:05,123 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2022-07-12 03:27:05,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:27:05,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-12 03:27:05,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:27:05,125 INFO L225 Difference]: With dead ends: 118 [2022-07-12 03:27:05,125 INFO L226 Difference]: Without dead ends: 107 [2022-07-12 03:27:05,125 INFO L412 NwaCegarLoop]: 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-07-12 03:27:05,125 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 8 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:27:05,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 175 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:27:05,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-12 03:27:05,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2022-07-12 03:27:05,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.11) internal successors, (111), 104 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:27:05,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2022-07-12 03:27:05,132 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 37 [2022-07-12 03:27:05,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:27:05,132 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2022-07-12 03:27:05,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:27:05,132 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2022-07-12 03:27:05,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 03:27:05,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:27:05,133 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:27:05,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 03:27:05,133 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-12 03:27:05,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:27:05,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1226334954, now seen corresponding path program 1 times [2022-07-12 03:27:05,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:27:05,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247723722] [2022-07-12 03:27:05,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:27:05,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:27:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:05,312 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:27:05,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:27:05,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247723722] [2022-07-12 03:27:05,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247723722] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:27:05,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057887946] [2022-07-12 03:27:05,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:27:05,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:27:05,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:27:05,314 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:27:05,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 03:27:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:05,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-12 03:27:05,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:27:05,428 INFO L390 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-07-12 03:27:05,456 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:27:05,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 03:27:05,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:05,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-12 03:27:05,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-07-12 03:27:05,467 INFO L390 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 8 treesize of output 7 [2022-07-12 03:27:05,470 INFO L390 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 8 treesize of output 7 [2022-07-12 03:27:05,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:05,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-12 03:27:05,481 INFO L390 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 8 treesize of output 7 [2022-07-12 03:27:05,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-12 03:27:05,511 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 03:27:05,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 50 [2022-07-12 03:27:05,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-07-12 03:27:05,765 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-07-12 03:27:05,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 35 [2022-07-12 03:27:05,771 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 03:27:05,772 INFO L390 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-07-12 03:27:05,777 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:27:05,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:27:07,219 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_857 Int) (v_ArrVal_854 Int)) (= 0 (let ((.cse1 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) .cse1 v_ArrVal_854)))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) .cse1 v_ArrVal_857)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_857 Int) (v_ArrVal_854 Int)) (= (let ((.cse3 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) .cse3 v_ArrVal_857)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) .cse3 v_ArrVal_854)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0))) is different from false [2022-07-12 03:27:07,263 INFO L356 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2022-07-12 03:27:07,264 INFO L390 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 164 treesize of output 174 [2022-07-12 03:27:07,298 INFO L356 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2022-07-12 03:27:07,298 INFO L390 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 270 treesize of output 226 [2022-07-12 03:27:07,315 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:07,316 INFO L390 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 99 [2022-07-12 03:27:07,344 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:07,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 362 treesize of output 374 [2022-07-12 03:27:07,361 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:07,362 INFO L390 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 334 treesize of output 298 [2022-07-12 03:27:07,453 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:07,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 938 treesize of output 996 [2022-07-12 03:27:07,537 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:07,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 796 treesize of output 806 [2022-07-12 03:27:07,603 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:07,603 INFO L390 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 866 treesize of output 828 [2022-07-12 03:27:07,885 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:07,886 INFO L390 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 1 case distinctions, treesize of input 7 treesize of output 6 [2022-07-12 03:27:12,344 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:12,370 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:12,398 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:12,432 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:12,513 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:12,542 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:12,580 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:12,622 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:12,901 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:12,937 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:12,989 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:13,066 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:19,510 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:27:19,511 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:27:19,511 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:27:19,512 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:27:19,515 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:20,567 INFO L356 Elim1Store]: treesize reduction 88, result has 1.1 percent of original size [2022-07-12 03:27:20,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 456 treesize of output 1 [2022-07-12 03:27:22,070 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:23,384 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:23,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 33 [2022-07-12 03:27:23,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:27:23,457 INFO L356 Elim1Store]: treesize reduction 5, result has 16.7 percent of original size [2022-07-12 03:27:23,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 1 [2022-07-12 03:27:23,490 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:23,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 33 [2022-07-12 03:27:23,532 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:23,562 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:23,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 33 [2022-07-12 03:27:23,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:27:23,713 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:23,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 33 [2022-07-12 03:27:23,844 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:23,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 33 [2022-07-12 03:27:23,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:27:24,148 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:24,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 33 [2022-07-12 03:27:24,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:27:24,469 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:24,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 33 [2022-07-12 03:27:24,515 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:24,608 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:24,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 33 [2022-07-12 03:27:24,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:27:24,793 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:24,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 33 [2022-07-12 03:27:24,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:27:25,038 INFO L356 Elim1Store]: treesize reduction 5, result has 16.7 percent of original size [2022-07-12 03:27:25,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 1 [2022-07-12 03:27:25,136 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:25,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 33 [2022-07-12 03:27:25,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:27:25,462 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:25,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 33 [2022-07-12 03:27:25,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:27:25,586 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:25,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 33 [2022-07-12 03:27:25,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:27:25,736 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:25,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 33 [2022-07-12 03:27:25,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:27:26,019 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:26,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 33 [2022-07-12 03:27:26,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:27:26,546 INFO L356 Elim1Store]: treesize reduction 14, result has 61.1 percent of original size [2022-07-12 03:27:26,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 193 treesize of output 201 [2022-07-12 03:27:27,253 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:27,998 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:27,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 33 [2022-07-12 03:27:28,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:27:28,310 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:28,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 33 [2022-07-12 03:27:28,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:27:28,678 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:27:28,678 INFO L390 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 32 treesize of output 1 [2022-07-12 03:27:28,735 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:28,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 33 [2022-07-12 03:27:28,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:27:29,816 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-07-12 03:27:29,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 3371 treesize of output 3345 [2022-07-12 03:27:29,881 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:29,881 INFO L390 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 18 treesize of output 22 [2022-07-12 03:27:33,303 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-07-12 03:27:33,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 3371 treesize of output 3345 [2022-07-12 03:27:33,355 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:33,355 INFO L390 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 18 treesize of output 22 [2022-07-12 03:27:35,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:27:35,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:27:35,876 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:35,920 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:36,448 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 03:27:36,448 INFO L390 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 65 treesize of output 1 [2022-07-12 03:27:36,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:27:36,538 INFO L390 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 5 treesize of output 3 [2022-07-12 03:27:36,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:27:36,707 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:36,716 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:36,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:27:36,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:27:36,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:27:36,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:27:36,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:27:37,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:27:37,403 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:37,403 INFO L390 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 24 treesize of output 28 [2022-07-12 03:27:37,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:27:37,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:27:37,690 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:37,690 INFO L390 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 1393 treesize of output 1309 [2022-07-12 03:27:38,423 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 03:27:38,423 INFO L390 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 17 treesize of output 14 [2022-07-12 03:27:38,435 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 03:27:38,435 INFO L390 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 41 treesize of output 34 [2022-07-12 03:27:38,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:27:38,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:27:38,480 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 03:27:38,480 INFO L390 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 12 treesize of output 11 [2022-07-12 03:27:38,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:27:38,502 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:38,508 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:38,517 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:38,519 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:38,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:27:38,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2022-07-12 03:27:38,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:38,547 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 1 [2022-07-12 03:27:38,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:38,553 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 45 [2022-07-12 03:27:38,563 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 03:27:38,564 INFO L390 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 1 case distinctions, treesize of input 33 treesize of output 1 [2022-07-12 03:27:38,569 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:38,574 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:38,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2022-07-12 03:27:38,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:27:38,632 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:38,644 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:38,656 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:38,663 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:38,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-12 03:27:38,740 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:38,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 24 treesize of output 68 [2022-07-12 03:27:38,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 114 [2022-07-12 03:27:38,922 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:38,922 INFO L390 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 104 treesize of output 88 [2022-07-12 03:27:38,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:38,988 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 03:27:38,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 132 treesize of output 1 [2022-07-12 03:27:39,007 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:39,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 44 [2022-07-12 03:27:39,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2022-07-12 03:27:39,144 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:39,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 146 [2022-07-12 03:27:39,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2022-07-12 03:27:39,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:27:39,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:27:39,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:27:39,638 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:39,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:27:39,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:39,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2022-07-12 03:27:39,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:27:39,676 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:39,676 INFO L390 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 28 treesize of output 32 [2022-07-12 03:27:39,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 99 [2022-07-12 03:27:39,775 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:39,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:27:39,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:39,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2022-07-12 03:27:39,818 INFO L356 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2022-07-12 03:27:39,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 128 treesize of output 1 [2022-07-12 03:27:40,156 INFO L356 Elim1Store]: treesize reduction 26, result has 38.1 percent of original size [2022-07-12 03:27:40,157 INFO L390 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 156 treesize of output 135 [2022-07-12 03:27:40,192 INFO L356 Elim1Store]: treesize reduction 26, result has 38.1 percent of original size [2022-07-12 03:27:40,192 INFO L390 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 242 treesize of output 221 [2022-07-12 03:27:40,210 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:40,210 INFO L390 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 89 [2022-07-12 03:27:40,222 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:40,223 INFO L390 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 194 treesize of output 194 [2022-07-12 03:27:40,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:40,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:40,314 INFO L356 Elim1Store]: treesize reduction 83, result has 41.1 percent of original size [2022-07-12 03:27:40,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 1309 treesize of output 1262 [2022-07-12 03:27:40,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:40,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:40,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 754 treesize of output 752 [2022-07-12 03:27:40,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:40,391 INFO L356 Elim1Store]: treesize reduction 30, result has 16.7 percent of original size [2022-07-12 03:27:40,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 841 treesize of output 823 [2022-07-12 03:27:40,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:40,423 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 789 treesize of output 759 [2022-07-12 03:27:40,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:40,446 INFO L390 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 793 treesize of output 757 [2022-07-12 03:27:40,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:27:40,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:27:40,659 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 03:27:40,786 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:27:40,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057887946] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:27:40,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:27:40,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2022-07-12 03:27:40,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462926083] [2022-07-12 03:27:40,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:27:40,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 03:27:40,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:27:40,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 03:27:40,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=214, Unknown=1, NotChecked=30, Total=306 [2022-07-12 03:27:40,790 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:27:40,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:27:40,998 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2022-07-12 03:27:40,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:27:40,999 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-12 03:27:40,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:27:40,999 INFO L225 Difference]: With dead ends: 111 [2022-07-12 03:27:40,999 INFO L226 Difference]: Without dead ends: 80 [2022-07-12 03:27:40,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=84, Invalid=299, Unknown=1, NotChecked=36, Total=420 [2022-07-12 03:27:41,000 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 163 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:27:41,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 445 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 173 Invalid, 0 Unknown, 129 Unchecked, 0.1s Time] [2022-07-12 03:27:41,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-12 03:27:41,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-12 03:27:41,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.12) internal successors, (84), 79 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-07-12 03:27:41,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-07-12 03:27:41,004 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 37 [2022-07-12 03:27:41,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:27:41,004 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-07-12 03:27:41,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:27:41,004 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-07-12 03:27:41,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 03:27:41,004 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:27:41,004 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:27:41,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 03:27:41,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-12 03:27:41,207 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-12 03:27:41,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:27:41,208 INFO L85 PathProgramCache]: Analyzing trace with hash 778254669, now seen corresponding path program 1 times [2022-07-12 03:27:41,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:27:41,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569014736] [2022-07-12 03:27:41,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:27:41,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:27:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:41,370 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:27:41,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:27:41,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569014736] [2022-07-12 03:27:41,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569014736] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:27:41,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599600176] [2022-07-12 03:27:41,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:27:41,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:27:41,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:27:41,373 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:27:41,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 03:27:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:41,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-12 03:27:41,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:27:41,513 INFO L390 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-07-12 03:27:41,546 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 03:27:41,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 03:27:41,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-12 03:27:41,555 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:27:41,576 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:27:41,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:41,677 INFO L356 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-07-12 03:27:41,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 40 [2022-07-12 03:27:41,702 INFO L356 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-07-12 03:27:41,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2022-07-12 03:27:41,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2022-07-12 03:27:41,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:41,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:41,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2022-07-12 03:27:41,855 INFO L356 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2022-07-12 03:27:41,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2022-07-12 03:27:41,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-07-12 03:27:41,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-12 03:27:41,956 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:27:41,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:27:41,973 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1040 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-12 03:27:41,993 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_42| Int) (v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_42|) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1039) |v_ULTIMATE.start_main_~item~0#1.base_42| v_ArrVal_1040) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)))) is different from false [2022-07-12 03:27:42,051 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_main_~status~0#1| 0) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_42| Int) (v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_42|) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1039) |v_ULTIMATE.start_main_~item~0#1.base_42| v_ArrVal_1040) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))))) is different from false [2022-07-12 03:27:42,062 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_main_~status~0#1| 0) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_42| Int) (|v_ULTIMATE.start_main_~item~0#1.base_43| Int) (v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_43|) 0)) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1036) |v_ULTIMATE.start_main_~item~0#1.base_43| v_ArrVal_1039) |v_ULTIMATE.start_main_~item~0#1.base_42| v_ArrVal_1040) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_43| 1) |v_ULTIMATE.start_main_~item~0#1.base_42|) 0))))) is different from false [2022-07-12 03:27:42,115 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_42| Int) (|v_ULTIMATE.start_main_~item~0#1.base_43| Int) (v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_43|) 0)) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1036) |v_ULTIMATE.start_main_~item~0#1.base_43| v_ArrVal_1039) |v_ULTIMATE.start_main_~item~0#1.base_42| v_ArrVal_1040) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_43| 1) |v_ULTIMATE.start_main_~item~0#1.base_42|) 0)))) is different from false [2022-07-12 03:27:42,124 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:42,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-07-12 03:27:42,132 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:42,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 685 treesize of output 536 [2022-07-12 03:27:42,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 494 treesize of output 486 [2022-07-12 03:27:42,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 486 treesize of output 454 [2022-07-12 03:27:42,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 454 treesize of output 438 [2022-07-12 03:27:42,347 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 26 not checked. [2022-07-12 03:27:42,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599600176] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:27:42,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:27:42,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2022-07-12 03:27:42,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770900167] [2022-07-12 03:27:42,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:27:42,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 03:27:42,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:27:42,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 03:27:42,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=239, Unknown=5, NotChecked=180, Total=506 [2022-07-12 03:27:42,351 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 23 states, 23 states have (on average 4.086956521739131) internal successors, (94), 23 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:27:42,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:27:42,586 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2022-07-12 03:27:42,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 03:27:42,587 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.086956521739131) internal successors, (94), 23 states have internal predecessors, (94), 0 states have call successors, (0), 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 38 [2022-07-12 03:27:42,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:27:42,587 INFO L225 Difference]: With dead ends: 91 [2022-07-12 03:27:42,588 INFO L226 Difference]: Without dead ends: 89 [2022-07-12 03:27:42,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=327, Unknown=5, NotChecked=210, Total=650 [2022-07-12 03:27:42,592 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 104 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 412 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:27:42,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 274 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 158 Invalid, 0 Unknown, 412 Unchecked, 0.1s Time] [2022-07-12 03:27:42,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-12 03:27:42,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2022-07-12 03:27:42,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 74 states have (on average 1.1081081081081081) internal successors, (82), 77 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-07-12 03:27:42,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2022-07-12 03:27:42,599 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 38 [2022-07-12 03:27:42,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:27:42,599 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2022-07-12 03:27:42,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.086956521739131) internal successors, (94), 23 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:27:42,600 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2022-07-12 03:27:42,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 03:27:42,601 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:27:42,601 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:27:42,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 03:27:42,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-12 03:27:42,808 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-12 03:27:42,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:27:42,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1793269558, now seen corresponding path program 1 times [2022-07-12 03:27:42,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:27:42,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119556024] [2022-07-12 03:27:42,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:27:42,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:27:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:43,147 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:27:43,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:27:43,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119556024] [2022-07-12 03:27:43,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119556024] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:27:43,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598909865] [2022-07-12 03:27:43,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:27:43,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:27:43,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:27:43,152 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:27:43,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 03:27:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:43,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-12 03:27:43,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:27:43,281 INFO L390 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-07-12 03:27:43,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-12 03:27:43,307 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:27:43,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 03:27:43,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:27:43,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-12 03:27:43,325 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:27:43,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 03:27:43,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:27:43,350 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 03:27:43,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 03:27:43,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:27:43,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:27:43,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:27:43,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:43,519 INFO L356 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-07-12 03:27:43,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 72 [2022-07-12 03:27:43,527 INFO L390 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 34 treesize of output 32 [2022-07-12 03:27:43,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:43,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:43,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-07-12 03:27:43,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:43,539 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 03:27:43,549 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-12 03:27:43,549 INFO L390 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 20 treesize of output 22 [2022-07-12 03:27:43,597 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:27:43,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-07-12 03:27:43,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 03:27:43,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-12 03:27:43,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-07-12 03:27:43,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:27:43,812 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:27:43,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:27:43,880 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1185) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1184) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1186) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4)))) is different from false [2022-07-12 03:27:43,895 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1183 Int) (v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1178 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_49| Int) (v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (or (< 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_1183)) |v_ULTIMATE.start_main_~item~0#1.base_49| v_ArrVal_1185) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1180) |v_ULTIMATE.start_main_~item~0#1.base_49| v_ArrVal_1184) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1178) |v_ULTIMATE.start_main_~item~0#1.base_49| v_ArrVal_1186) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_49|) 0)))) is different from false [2022-07-12 03:27:43,947 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-07-12 03:27:43,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 51 [2022-07-12 03:27:43,957 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:43,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 89 [2022-07-12 03:27:43,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2022-07-12 03:27:44,058 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:44,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-07-12 03:27:44,067 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:44,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 121 [2022-07-12 03:27:44,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2022-07-12 03:27:44,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2022-07-12 03:27:44,120 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:44,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-12 03:27:44,123 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:27:44,128 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:44,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2022-07-12 03:27:44,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-07-12 03:27:44,152 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:44,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-07-12 03:27:44,155 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:27:44,160 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:44,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-07-12 03:27:44,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-12 03:27:44,271 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-12 03:27:44,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598909865] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:27:44,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:27:44,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-07-12 03:27:44,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084692074] [2022-07-12 03:27:44,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:27:44,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 03:27:44,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:27:44,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 03:27:44,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=258, Unknown=2, NotChecked=66, Total=380 [2022-07-12 03:27:44,274 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 20 states, 20 states have (on average 5.55) internal successors, (111), 20 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:27:44,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:27:44,773 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2022-07-12 03:27:44,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 03:27:44,773 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.55) internal successors, (111), 20 states have internal predecessors, (111), 0 states have call successors, (0), 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 40 [2022-07-12 03:27:44,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:27:44,774 INFO L225 Difference]: With dead ends: 101 [2022-07-12 03:27:44,774 INFO L226 Difference]: Without dead ends: 99 [2022-07-12 03:27:44,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=575, Unknown=3, NotChecked=102, Total=812 [2022-07-12 03:27:44,775 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 201 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 183 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:27:44,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 425 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 178 Invalid, 0 Unknown, 183 Unchecked, 0.2s Time] [2022-07-12 03:27:44,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-12 03:27:44,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 84. [2022-07-12 03:27:44,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 80 states have (on average 1.1125) internal successors, (89), 83 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:27:44,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2022-07-12 03:27:44,782 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 40 [2022-07-12 03:27:44,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:27:44,782 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2022-07-12 03:27:44,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.55) internal successors, (111), 20 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:27:44,783 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2022-07-12 03:27:44,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 03:27:44,783 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:27:44,783 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:27:44,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 03:27:44,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:27:45,000 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-12 03:27:45,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:27:45,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1428751921, now seen corresponding path program 1 times [2022-07-12 03:27:45,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:27:45,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101960354] [2022-07-12 03:27:45,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:27:45,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:27:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:45,039 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 03:27:45,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:27:45,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101960354] [2022-07-12 03:27:45,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101960354] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:27:45,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:27:45,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:27:45,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849587612] [2022-07-12 03:27:45,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:27:45,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:27:45,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:27:45,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:27:45,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:27:45,042 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:27:45,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:27:45,060 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2022-07-12 03:27:45,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:27:45,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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 41 [2022-07-12 03:27:45,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:27:45,061 INFO L225 Difference]: With dead ends: 110 [2022-07-12 03:27:45,062 INFO L226 Difference]: Without dead ends: 98 [2022-07-12 03:27:45,062 INFO L412 NwaCegarLoop]: 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-07-12 03:27:45,063 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 36 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:27:45,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 108 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:27:45,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-12 03:27:45,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 84. [2022-07-12 03:27:45,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 80 states have (on average 1.1) internal successors, (88), 83 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:27:45,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2022-07-12 03:27:45,068 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 41 [2022-07-12 03:27:45,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:27:45,068 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2022-07-12 03:27:45,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:27:45,069 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-07-12 03:27:45,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 03:27:45,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:27:45,069 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:27:45,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 03:27:45,070 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-12 03:27:45,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:27:45,070 INFO L85 PathProgramCache]: Analyzing trace with hash 755507507, now seen corresponding path program 1 times [2022-07-12 03:27:45,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:27:45,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112444860] [2022-07-12 03:27:45,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:27:45,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:27:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:45,359 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:27:45,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:27:45,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112444860] [2022-07-12 03:27:45,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112444860] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:27:45,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093755123] [2022-07-12 03:27:45,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:27:45,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:27:45,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:27:45,361 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:27:45,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 03:27:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:27:45,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-12 03:27:45,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:27:45,531 INFO L390 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-07-12 03:27:45,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-12 03:27:45,586 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:27:45,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 03:27:45,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:27:45,607 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 03:27:45,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 03:27:45,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-12 03:27:45,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:27:45,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:27:45,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:27:45,755 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 03:27:45,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 42 [2022-07-12 03:27:45,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:45,768 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 03:27:45,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 50 [2022-07-12 03:27:45,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:45,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:45,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-07-12 03:27:45,798 INFO L356 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-07-12 03:27:45,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2022-07-12 03:27:45,865 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:27:45,877 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 03:27:45,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 39 [2022-07-12 03:27:45,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:45,995 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-12 03:27:45,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 110 treesize of output 83 [2022-07-12 03:27:46,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-07-12 03:27:46,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:46,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:46,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 34 [2022-07-12 03:27:46,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:27:46,024 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-12 03:27:46,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2022-07-12 03:27:46,119 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 03:27:46,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 62 [2022-07-12 03:27:46,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 34 [2022-07-12 03:27:46,329 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 03:27:46,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 33 [2022-07-12 03:27:46,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:27:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:27:46,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:27:46,364 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1468 (Array Int Int))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1468))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1469) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))) is different from false [2022-07-12 03:27:46,396 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1469 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_55| Int) (v_ArrVal_1468 (Array Int Int)) (v_ArrVal_1466 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_55|) 0)) (not (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1466) |v_ULTIMATE.start_main_~item~0#1.base_55| v_ArrVal_1468))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset| 0)) |v_ULTIMATE.start_main_~item~0#1.base_55| v_ArrVal_1469) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)))) is different from false [2022-07-12 03:27:46,426 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:46,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 41 [2022-07-12 03:27:46,435 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1469 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_55| Int) (v_ArrVal_1468 (Array Int Int)) (v_ArrVal_1466 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int) (v_arrayElimArr_61 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_55|) 0)) (not (= (select v_arrayElimArr_61 |ULTIMATE.start_main_~item~0#1.offset|) 0)) (not (= 0 (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1466) |v_ULTIMATE.start_main_~item~0#1.base_55| v_ArrVal_1468))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_61) |v_ULTIMATE.start_main_~item~0#1.base_55| v_ArrVal_1469) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2022-07-12 03:27:46,461 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.offset_47| Int) (v_ArrVal_1469 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_55| Int) (v_ArrVal_1468 (Array Int Int)) (v_ArrVal_1453 Int) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1455 (Array Int Int)) (v_arrayElimArr_61 (Array Int Int))) (or (= v_ArrVal_1453 0) (not (= (select (store |c_#valid| v_ArrVal_1453 1) |v_ULTIMATE.start_main_~item~0#1.base_55|) 0)) (not (= (select |c_#valid| v_ArrVal_1453) 0)) (not (= (select (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_1453)) v_ArrVal_1453 v_ArrVal_1466) |v_ULTIMATE.start_main_~item~0#1.base_55| v_ArrVal_1468))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1455) v_ArrVal_1453 v_arrayElimArr_61) |v_ULTIMATE.start_main_~item~0#1.base_55| v_ArrVal_1469) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) (not (= (select v_arrayElimArr_61 |v_ULTIMATE.start_main_~item~0#1.offset_47|) 0)))) is different from false [2022-07-12 03:27:46,544 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:46,544 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 50 [2022-07-12 03:27:46,559 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.offset_47| Int) (v_ArrVal_1469 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_55| Int) (v_ArrVal_1468 (Array Int Int)) (v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1466 (Array Int Int)) (v_arrayElimArr_62 (Array Int Int)) (v_arrayElimArr_61 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_62 |c_ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select |c_#valid| .cse0) 0)) (not (= (select (store |c_#valid| .cse0 1) |v_ULTIMATE.start_main_~item~0#1.base_55|) 0)) (not (= (select (let ((.cse1 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_62) .cse0 v_ArrVal_1466) |v_ULTIMATE.start_main_~item~0#1.base_55| v_ArrVal_1468))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1455) .cse0 v_arrayElimArr_61) |v_ULTIMATE.start_main_~item~0#1.base_55| v_ArrVal_1469) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)) (not (= (select v_arrayElimArr_61 |v_ULTIMATE.start_main_~item~0#1.offset_47|) 0)) (= .cse0 0)))) is different from false [2022-07-12 03:27:46,573 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:46,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2022-07-12 03:27:46,579 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:46,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 58 [2022-07-12 03:27:46,676 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:46,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 98280 treesize of output 71596 [2022-07-12 03:27:47,247 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:47,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 71649 treesize of output 61424 [2022-07-12 03:27:47,901 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:47,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72661 treesize of output 72316 [2022-07-12 03:27:48,582 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:48,584 INFO L390 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 72307 treesize of output 71961 [2022-07-12 03:27:49,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71949 treesize of output 71773 [2022-07-12 03:27:49,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71773 treesize of output 71069 [2022-07-12 03:27:50,008 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:50,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67791 treesize of output 63509 [2022-07-12 03:27:50,446 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:27:50,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 63437 treesize of output 61331