./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-queue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3a877d22 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-queue-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c858394bc83ab2c402eb20052f936c0a6aa98b2b6b6c704be79c039778bcff97 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 14:04:23,600 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 14:04:23,602 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 14:04:23,626 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 14:04:23,626 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 14:04:23,627 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 14:04:23,628 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 14:04:23,629 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 14:04:23,630 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 14:04:23,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 14:04:23,631 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 14:04:23,633 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 14:04:23,633 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 14:04:23,638 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 14:04:23,640 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 14:04:23,644 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 14:04:23,645 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 14:04:23,647 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 14:04:23,648 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 14:04:23,652 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 14:04:23,657 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 14:04:23,658 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 14:04:23,659 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 14:04:23,660 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 14:04:23,661 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 14:04:23,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 14:04:23,663 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 14:04:23,663 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 14:04:23,664 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 14:04:23,665 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 14:04:23,666 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 14:04:23,666 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 14:04:23,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 14:04:23,667 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 14:04:23,668 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 14:04:23,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 14:04:23,669 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 14:04:23,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 14:04:23,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 14:04:23,670 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 14:04:23,671 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 14:04:23,672 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-15 14:04:23,686 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 14:04:23,687 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 14:04:23,687 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 14:04:23,687 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 14:04:23,688 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 14:04:23,688 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 14:04:23,689 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 14:04:23,689 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 14:04:23,689 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 14:04:23,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 14:04:23,690 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 14:04:23,690 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 14:04:23,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 14:04:23,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 14:04:23,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 14:04:23,691 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-15 14:04:23,691 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-15 14:04:23,691 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-15 14:04:23,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 14:04:23,691 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-15 14:04:23,692 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 14:04:23,692 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 14:04:23,692 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 14:04:23,692 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 14:04:23,692 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 14:04:23,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 14:04:23,692 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 14:04:23,693 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 14:04:23,694 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 14:04:23,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 14:04:23,694 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 14:04:23,694 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> c858394bc83ab2c402eb20052f936c0a6aa98b2b6b6c704be79c039778bcff97 [2021-12-15 14:04:23,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 14:04:23,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 14:04:23,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 14:04:23,927 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 14:04:23,928 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 14:04:23,929 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-queue-1.i [2021-12-15 14:04:23,978 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a447bb681/d6d561cb1cb8476cb7497381beed4f22/FLAG815348adb [2021-12-15 14:04:24,385 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 14:04:24,386 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-1.i [2021-12-15 14:04:24,401 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a447bb681/d6d561cb1cb8476cb7497381beed4f22/FLAG815348adb [2021-12-15 14:04:24,738 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a447bb681/d6d561cb1cb8476cb7497381beed4f22 [2021-12-15 14:04:24,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 14:04:24,741 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 14:04:24,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 14:04:24,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 14:04:24,747 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 14:04:24,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 02:04:24" (1/1) ... [2021-12-15 14:04:24,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d430977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:24, skipping insertion in model container [2021-12-15 14:04:24,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 02:04:24" (1/1) ... [2021-12-15 14:04:24,754 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 14:04:24,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 14:04:24,983 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/dll-queue-1.i[22460,22473] [2021-12-15 14:04:24,988 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/dll-queue-1.i[22531,22544] [2021-12-15 14:04:24,988 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/dll-queue-1.i[22605,22618] [2021-12-15 14:04:24,989 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/dll-queue-1.i[22697,22710] [2021-12-15 14:04:24,991 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/dll-queue-1.i[22774,22787] [2021-12-15 14:04:24,992 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/dll-queue-1.i[22869,22882] [2021-12-15 14:04:24,994 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/dll-queue-1.i[22946,22959] [2021-12-15 14:04:24,995 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/dll-queue-1.i[23029,23042] [2021-12-15 14:04:24,997 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/dll-queue-1.i[23124,23137] [2021-12-15 14:04:24,998 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/dll-queue-1.i[23201,23214] [2021-12-15 14:04:24,999 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/dll-queue-1.i[23284,23297] [2021-12-15 14:04:25,000 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/dll-queue-1.i[23373,23386] [2021-12-15 14:04:25,001 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/dll-queue-1.i[23459,23472] [2021-12-15 14:04:25,005 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/dll-queue-1.i[23604,23617] [2021-12-15 14:04:25,009 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 14:04:25,015 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 14:04:25,048 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/dll-queue-1.i[22460,22473] [2021-12-15 14:04:25,048 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/dll-queue-1.i[22531,22544] [2021-12-15 14:04:25,049 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/dll-queue-1.i[22605,22618] [2021-12-15 14:04:25,049 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/dll-queue-1.i[22697,22710] [2021-12-15 14:04:25,050 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/dll-queue-1.i[22774,22787] [2021-12-15 14:04:25,050 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/dll-queue-1.i[22869,22882] [2021-12-15 14:04:25,051 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/dll-queue-1.i[22946,22959] [2021-12-15 14:04:25,051 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/dll-queue-1.i[23029,23042] [2021-12-15 14:04:25,052 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/dll-queue-1.i[23124,23137] [2021-12-15 14:04:25,053 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/dll-queue-1.i[23201,23214] [2021-12-15 14:04:25,053 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/dll-queue-1.i[23284,23297] [2021-12-15 14:04:25,054 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/dll-queue-1.i[23373,23386] [2021-12-15 14:04:25,054 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/dll-queue-1.i[23459,23472] [2021-12-15 14:04:25,055 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/dll-queue-1.i[23604,23617] [2021-12-15 14:04:25,057 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 14:04:25,073 INFO L208 MainTranslator]: Completed translation [2021-12-15 14:04:25,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25 WrapperNode [2021-12-15 14:04:25,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 14:04:25,080 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 14:04:25,080 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 14:04:25,080 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 14:04:25,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (1/1) ... [2021-12-15 14:04:25,094 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (1/1) ... [2021-12-15 14:04:25,117 INFO L137 Inliner]: procedures = 119, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 226 [2021-12-15 14:04:25,117 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 14:04:25,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 14:04:25,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 14:04:25,118 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 14:04:25,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (1/1) ... [2021-12-15 14:04:25,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (1/1) ... [2021-12-15 14:04:25,129 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (1/1) ... [2021-12-15 14:04:25,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (1/1) ... [2021-12-15 14:04:25,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (1/1) ... [2021-12-15 14:04:25,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (1/1) ... [2021-12-15 14:04:25,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (1/1) ... [2021-12-15 14:04:25,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 14:04:25,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 14:04:25,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 14:04:25,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 14:04:25,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (1/1) ... [2021-12-15 14:04:25,176 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 14:04:25,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:04:25,205 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-15 14:04:25,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-15 14:04:25,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 14:04:25,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 14:04:25,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 14:04:25,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 14:04:25,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 14:04:25,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 14:04:25,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 14:04:25,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 14:04:25,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 14:04:25,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 14:04:25,317 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 14:04:25,319 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 14:04:25,575 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 14:04:25,580 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 14:04:25,580 INFO L301 CfgBuilder]: Removed 31 assume(true) statements. [2021-12-15 14:04:25,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:04:25 BoogieIcfgContainer [2021-12-15 14:04:25,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 14:04:25,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 14:04:25,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 14:04:25,586 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 14:04:25,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 02:04:24" (1/3) ... [2021-12-15 14:04:25,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@572eb817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 02:04:25, skipping insertion in model container [2021-12-15 14:04:25,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (2/3) ... [2021-12-15 14:04:25,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@572eb817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 02:04:25, skipping insertion in model container [2021-12-15 14:04:25,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:04:25" (3/3) ... [2021-12-15 14:04:25,588 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-queue-1.i [2021-12-15 14:04:25,591 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 14:04:25,592 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 76 error locations. [2021-12-15 14:04:25,645 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 14:04:25,655 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-15 14:04:25,655 INFO L340 AbstractCegarLoop]: Starting to check reachability of 76 error locations. [2021-12-15 14:04:25,672 INFO L276 IsEmpty]: Start isEmpty. Operand has 181 states, 104 states have (on average 2.269230769230769) internal successors, (236), 180 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:25,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-15 14:04:25,688 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:25,689 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-15 14:04:25,690 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 72 more)] === [2021-12-15 14:04:25,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:25,694 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-15 14:04:25,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:25,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960649809] [2021-12-15 14:04:25,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:25,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:25,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:25,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:25,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960649809] [2021-12-15 14:04:25,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960649809] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:25,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:25,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:04:25,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120250004] [2021-12-15 14:04:25,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:25,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:25,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:25,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:25,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:25,856 INFO L87 Difference]: Start difference. First operand has 181 states, 104 states have (on average 2.269230769230769) internal successors, (236), 180 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:26,003 INFO L93 Difference]: Finished difference Result 178 states and 188 transitions. [2021-12-15 14:04:26,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:26,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2021-12-15 14:04:26,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:26,014 INFO L225 Difference]: With dead ends: 178 [2021-12-15 14:04:26,015 INFO L226 Difference]: Without dead ends: 174 [2021-12-15 14:04:26,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:26,019 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 169 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:26,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 112 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:26,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-12-15 14:04:26,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2021-12-15 14:04:26,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 105 states have (on average 1.7333333333333334) internal successors, (182), 169 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 182 transitions. [2021-12-15 14:04:26,048 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 182 transitions. Word has length 3 [2021-12-15 14:04:26,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:26,048 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 182 transitions. [2021-12-15 14:04:26,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,048 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 182 transitions. [2021-12-15 14:04:26,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-15 14:04:26,049 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:26,049 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-15 14:04:26,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 14:04:26,049 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 72 more)] === [2021-12-15 14:04:26,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:26,050 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-15 14:04:26,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:26,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593784584] [2021-12-15 14:04:26,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:26,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:26,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:26,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:26,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593784584] [2021-12-15 14:04:26,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593784584] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:26,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:26,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:04:26,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990678618] [2021-12-15 14:04:26,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:26,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:26,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:26,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:26,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:26,078 INFO L87 Difference]: Start difference. First operand 170 states and 182 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:26,144 INFO L93 Difference]: Finished difference Result 163 states and 173 transitions. [2021-12-15 14:04:26,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:26,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2021-12-15 14:04:26,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:26,146 INFO L225 Difference]: With dead ends: 163 [2021-12-15 14:04:26,146 INFO L226 Difference]: Without dead ends: 163 [2021-12-15 14:04:26,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:26,147 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 155 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:26,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 115 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:26,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-12-15 14:04:26,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2021-12-15 14:04:26,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 105 states have (on average 1.619047619047619) internal successors, (170), 158 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 170 transitions. [2021-12-15 14:04:26,153 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 170 transitions. Word has length 3 [2021-12-15 14:04:26,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:26,153 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 170 transitions. [2021-12-15 14:04:26,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,153 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2021-12-15 14:04:26,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-15 14:04:26,153 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:26,154 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:26,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 14:04:26,154 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 72 more)] === [2021-12-15 14:04:26,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:26,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112042, now seen corresponding path program 1 times [2021-12-15 14:04:26,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:26,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706228125] [2021-12-15 14:04:26,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:26,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:26,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:26,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:26,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706228125] [2021-12-15 14:04:26,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706228125] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:26,202 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:26,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:04:26,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56377129] [2021-12-15 14:04:26,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:26,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:04:26,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:26,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:04:26,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:04:26,203 INFO L87 Difference]: Start difference. First operand 159 states and 170 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:26,315 INFO L93 Difference]: Finished difference Result 168 states and 178 transitions. [2021-12-15 14:04:26,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 14:04:26,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-15 14:04:26,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:26,316 INFO L225 Difference]: With dead ends: 168 [2021-12-15 14:04:26,316 INFO L226 Difference]: Without dead ends: 168 [2021-12-15 14:04:26,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:26,317 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 272 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:26,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 118 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:26,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-12-15 14:04:26,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 160. [2021-12-15 14:04:26,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 112 states have (on average 1.5625) internal successors, (175), 159 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 175 transitions. [2021-12-15 14:04:26,322 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 175 transitions. Word has length 9 [2021-12-15 14:04:26,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:26,322 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 175 transitions. [2021-12-15 14:04:26,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,323 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 175 transitions. [2021-12-15 14:04:26,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-15 14:04:26,323 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:26,323 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:26,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 14:04:26,328 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 72 more)] === [2021-12-15 14:04:26,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:26,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112043, now seen corresponding path program 1 times [2021-12-15 14:04:26,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:26,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709265567] [2021-12-15 14:04:26,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:26,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:26,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:26,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:26,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709265567] [2021-12-15 14:04:26,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709265567] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:26,449 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:26,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 14:04:26,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572408426] [2021-12-15 14:04:26,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:26,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 14:04:26,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:26,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 14:04:26,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-15 14:04:26,451 INFO L87 Difference]: Start difference. First operand 160 states and 175 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:26,661 INFO L93 Difference]: Finished difference Result 256 states and 272 transitions. [2021-12-15 14:04:26,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 14:04:26,661 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-15 14:04:26,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:26,662 INFO L225 Difference]: With dead ends: 256 [2021-12-15 14:04:26,662 INFO L226 Difference]: Without dead ends: 256 [2021-12-15 14:04:26,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:04:26,663 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 337 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:26,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 244 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:26,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-12-15 14:04:26,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 168. [2021-12-15 14:04:26,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 120 states have (on average 1.5416666666666667) internal successors, (185), 167 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 185 transitions. [2021-12-15 14:04:26,671 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 185 transitions. Word has length 9 [2021-12-15 14:04:26,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:26,671 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 185 transitions. [2021-12-15 14:04:26,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,672 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 185 transitions. [2021-12-15 14:04:26,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-15 14:04:26,672 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:26,672 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:26,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 14:04:26,672 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 72 more)] === [2021-12-15 14:04:26,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:26,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1115899309, now seen corresponding path program 1 times [2021-12-15 14:04:26,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:26,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887198078] [2021-12-15 14:04:26,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:26,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:26,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:26,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:26,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887198078] [2021-12-15 14:04:26,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887198078] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:26,714 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:26,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:04:26,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416966280] [2021-12-15 14:04:26,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:26,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:26,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:26,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:26,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:26,719 INFO L87 Difference]: Start difference. First operand 168 states and 185 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:26,745 INFO L93 Difference]: Finished difference Result 158 states and 174 transitions. [2021-12-15 14:04:26,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:26,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-15 14:04:26,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:26,746 INFO L225 Difference]: With dead ends: 158 [2021-12-15 14:04:26,746 INFO L226 Difference]: Without dead ends: 158 [2021-12-15 14:04:26,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:26,747 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 131 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:26,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 141 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:04:26,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-12-15 14:04:26,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2021-12-15 14:04:26,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 115 states have (on average 1.5130434782608695) internal successors, (174), 157 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 174 transitions. [2021-12-15 14:04:26,751 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 174 transitions. Word has length 10 [2021-12-15 14:04:26,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:26,751 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 174 transitions. [2021-12-15 14:04:26,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,752 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 174 transitions. [2021-12-15 14:04:26,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-15 14:04:26,752 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:26,752 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:26,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 14:04:26,753 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 72 more)] === [2021-12-15 14:04:26,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:26,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2021-12-15 14:04:26,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:26,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477166944] [2021-12-15 14:04:26,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:26,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:26,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:26,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:26,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477166944] [2021-12-15 14:04:26,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477166944] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:26,803 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:26,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:04:26,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113637207] [2021-12-15 14:04:26,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:26,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:04:26,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:26,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:04:26,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:26,805 INFO L87 Difference]: Start difference. First operand 158 states and 174 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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) [2021-12-15 14:04:26,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:26,927 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2021-12-15 14:04:26,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:04:26,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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 [2021-12-15 14:04:26,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:26,928 INFO L225 Difference]: With dead ends: 157 [2021-12-15 14:04:26,928 INFO L226 Difference]: Without dead ends: 157 [2021-12-15 14:04:26,928 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:04:26,928 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 6 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:26,929 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 424 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:26,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-15 14:04:26,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2021-12-15 14:04:26,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 115 states have (on average 1.4956521739130435) internal successors, (172), 156 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:26,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 172 transitions. [2021-12-15 14:04:26,932 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 172 transitions. Word has length 12 [2021-12-15 14:04:26,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:26,932 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 172 transitions. [2021-12-15 14:04:26,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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) [2021-12-15 14:04:26,932 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 172 transitions. [2021-12-15 14:04:26,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-15 14:04:26,932 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:26,932 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:26,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-15 14:04:26,933 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 72 more)] === [2021-12-15 14:04:26,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:26,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2021-12-15 14:04:26,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:26,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477649073] [2021-12-15 14:04:26,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:26,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:26,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:26,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:26,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477649073] [2021-12-15 14:04:26,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477649073] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:26,965 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:26,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:04:26,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422164320] [2021-12-15 14:04:26,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:26,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:04:26,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:26,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:04:26,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:26,966 INFO L87 Difference]: Start difference. First operand 157 states and 172 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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) [2021-12-15 14:04:27,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:27,068 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2021-12-15 14:04:27,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 14:04:27,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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 [2021-12-15 14:04:27,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:27,070 INFO L225 Difference]: With dead ends: 156 [2021-12-15 14:04:27,070 INFO L226 Difference]: Without dead ends: 156 [2021-12-15 14:04:27,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:04:27,071 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 7 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:27,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 422 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:27,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-15 14:04:27,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2021-12-15 14:04:27,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 115 states have (on average 1.4782608695652173) internal successors, (170), 155 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:27,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2021-12-15 14:04:27,074 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 12 [2021-12-15 14:04:27,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:27,074 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2021-12-15 14:04:27,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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) [2021-12-15 14:04:27,074 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2021-12-15 14:04:27,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 14:04:27,075 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:27,075 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:27,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-15 14:04:27,075 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 72 more)] === [2021-12-15 14:04:27,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:27,075 INFO L85 PathProgramCache]: Analyzing trace with hash -794856606, now seen corresponding path program 1 times [2021-12-15 14:04:27,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:27,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043330876] [2021-12-15 14:04:27,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:27,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:27,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:27,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:27,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043330876] [2021-12-15 14:04:27,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043330876] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:27,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:27,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:04:27,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131499369] [2021-12-15 14:04:27,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:27,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:27,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:27,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:27,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:27,095 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:27,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:27,111 INFO L93 Difference]: Finished difference Result 208 states and 228 transitions. [2021-12-15 14:04:27,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:27,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-15 14:04:27,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:27,112 INFO L225 Difference]: With dead ends: 208 [2021-12-15 14:04:27,112 INFO L226 Difference]: Without dead ends: 208 [2021-12-15 14:04:27,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:27,113 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 53 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:27,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 273 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:04:27,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-12-15 14:04:27,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 164. [2021-12-15 14:04:27,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 123 states have (on average 1.4634146341463414) internal successors, (180), 163 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:27,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 180 transitions. [2021-12-15 14:04:27,115 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 180 transitions. Word has length 16 [2021-12-15 14:04:27,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:27,115 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 180 transitions. [2021-12-15 14:04:27,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:27,116 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 180 transitions. [2021-12-15 14:04:27,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 14:04:27,116 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:27,116 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:27,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-15 14:04:27,116 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 72 more)] === [2021-12-15 14:04:27,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:27,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2021-12-15 14:04:27,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:27,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776018173] [2021-12-15 14:04:27,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:27,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:27,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:27,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:27,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776018173] [2021-12-15 14:04:27,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776018173] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:27,185 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:27,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-15 14:04:27,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419794307] [2021-12-15 14:04:27,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:27,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 14:04:27,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:27,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 14:04:27,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-15 14:04:27,186 INFO L87 Difference]: Start difference. First operand 164 states and 180 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:27,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:27,422 INFO L93 Difference]: Finished difference Result 167 states and 179 transitions. [2021-12-15 14:04:27,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 14:04:27,423 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-15 14:04:27,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:27,424 INFO L225 Difference]: With dead ends: 167 [2021-12-15 14:04:27,424 INFO L226 Difference]: Without dead ends: 167 [2021-12-15 14:04:27,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-15 14:04:27,424 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 250 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:27,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 521 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:27,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-15 14:04:27,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2021-12-15 14:04:27,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 123 states have (on average 1.4471544715447155) internal successors, (178), 162 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:27,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 178 transitions. [2021-12-15 14:04:27,427 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 178 transitions. Word has length 16 [2021-12-15 14:04:27,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:27,427 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 178 transitions. [2021-12-15 14:04:27,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:27,427 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 178 transitions. [2021-12-15 14:04:27,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 14:04:27,430 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:27,430 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:27,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-15 14:04:27,431 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 72 more)] === [2021-12-15 14:04:27,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:27,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2021-12-15 14:04:27,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:27,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425566632] [2021-12-15 14:04:27,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:27,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:27,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:27,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425566632] [2021-12-15 14:04:27,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425566632] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:27,574 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:27,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-15 14:04:27,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832676399] [2021-12-15 14:04:27,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:27,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 14:04:27,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:27,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 14:04:27,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-15 14:04:27,575 INFO L87 Difference]: Start difference. First operand 163 states and 178 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:27,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:27,920 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2021-12-15 14:04:27,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-15 14:04:27,920 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-15 14:04:27,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:27,921 INFO L225 Difference]: With dead ends: 162 [2021-12-15 14:04:27,921 INFO L226 Difference]: Without dead ends: 162 [2021-12-15 14:04:27,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2021-12-15 14:04:27,921 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 331 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:27,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 398 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:27,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-12-15 14:04:27,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 156. [2021-12-15 14:04:27,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 155 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2021-12-15 14:04:27,924 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 16 [2021-12-15 14:04:27,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:27,924 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2021-12-15 14:04:27,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:27,924 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2021-12-15 14:04:27,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 14:04:27,925 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:27,925 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:27,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-15 14:04:27,925 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 72 more)] === [2021-12-15 14:04:27,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:27,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1461793571, now seen corresponding path program 1 times [2021-12-15 14:04:27,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:27,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404053507] [2021-12-15 14:04:27,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:27,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:27,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:27,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:27,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404053507] [2021-12-15 14:04:27,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404053507] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:27,945 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:27,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:04:27,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479109698] [2021-12-15 14:04:27,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:27,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:27,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:27,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:27,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:27,946 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:27,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:27,951 INFO L93 Difference]: Finished difference Result 157 states and 171 transitions. [2021-12-15 14:04:27,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:27,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-15 14:04:27,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:27,952 INFO L225 Difference]: With dead ends: 157 [2021-12-15 14:04:27,952 INFO L226 Difference]: Without dead ends: 157 [2021-12-15 14:04:27,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:27,952 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:27,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 275 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:04:27,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-15 14:04:27,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2021-12-15 14:04:27,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 124 states have (on average 1.3790322580645162) internal successors, (171), 156 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:27,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 171 transitions. [2021-12-15 14:04:27,955 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 171 transitions. Word has length 21 [2021-12-15 14:04:27,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:27,956 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 171 transitions. [2021-12-15 14:04:27,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:27,956 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 171 transitions. [2021-12-15 14:04:27,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 14:04:27,956 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:27,956 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:27,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-15 14:04:27,957 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 72 more)] === [2021-12-15 14:04:27,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:27,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1463640613, now seen corresponding path program 1 times [2021-12-15 14:04:27,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:27,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297270284] [2021-12-15 14:04:27,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:27,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:28,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:28,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:28,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297270284] [2021-12-15 14:04:28,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297270284] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:28,016 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:28,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 14:04:28,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825899922] [2021-12-15 14:04:28,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:28,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 14:04:28,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:28,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 14:04:28,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 14:04:28,017 INFO L87 Difference]: Start difference. First operand 157 states and 171 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:28,124 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2021-12-15 14:04:28,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 14:04:28,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-15 14:04:28,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:28,125 INFO L225 Difference]: With dead ends: 165 [2021-12-15 14:04:28,125 INFO L226 Difference]: Without dead ends: 165 [2021-12-15 14:04:28,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-15 14:04:28,126 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 9 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:28,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 589 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:28,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-12-15 14:04:28,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2021-12-15 14:04:28,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 128 states have (on average 1.3671875) internal successors, (175), 160 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 175 transitions. [2021-12-15 14:04:28,128 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 175 transitions. Word has length 21 [2021-12-15 14:04:28,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:28,128 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 175 transitions. [2021-12-15 14:04:28,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,129 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 175 transitions. [2021-12-15 14:04:28,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 14:04:28,129 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:28,129 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:28,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-15 14:04:28,129 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 72 more)] === [2021-12-15 14:04:28,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:28,130 INFO L85 PathProgramCache]: Analyzing trace with hash -348511767, now seen corresponding path program 1 times [2021-12-15 14:04:28,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:28,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421795100] [2021-12-15 14:04:28,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:28,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:28,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:28,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:28,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421795100] [2021-12-15 14:04:28,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421795100] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:28,197 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:28,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:04:28,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853781978] [2021-12-15 14:04:28,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:28,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:04:28,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:28,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:04:28,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:28,198 INFO L87 Difference]: Start difference. First operand 161 states and 175 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:28,257 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2021-12-15 14:04:28,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 14:04:28,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-15 14:04:28,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:28,258 INFO L225 Difference]: With dead ends: 161 [2021-12-15 14:04:28,259 INFO L226 Difference]: Without dead ends: 161 [2021-12-15 14:04:28,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:28,259 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 156 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:28,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 212 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:28,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-12-15 14:04:28,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2021-12-15 14:04:28,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 128 states have (on average 1.359375) internal successors, (174), 160 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 174 transitions. [2021-12-15 14:04:28,263 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 174 transitions. Word has length 23 [2021-12-15 14:04:28,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:28,263 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 174 transitions. [2021-12-15 14:04:28,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,263 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 174 transitions. [2021-12-15 14:04:28,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 14:04:28,263 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:28,264 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:28,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-15 14:04:28,264 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 72 more)] === [2021-12-15 14:04:28,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:28,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1959765219, now seen corresponding path program 1 times [2021-12-15 14:04:28,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:28,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414690271] [2021-12-15 14:04:28,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:28,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:28,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:28,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:28,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414690271] [2021-12-15 14:04:28,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414690271] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:28,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:28,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-15 14:04:28,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092258366] [2021-12-15 14:04:28,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:28,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 14:04:28,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:28,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 14:04:28,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-15 14:04:28,365 INFO L87 Difference]: Start difference. First operand 161 states and 174 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:28,625 INFO L93 Difference]: Finished difference Result 245 states and 262 transitions. [2021-12-15 14:04:28,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 14:04:28,626 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-15 14:04:28,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:28,626 INFO L225 Difference]: With dead ends: 245 [2021-12-15 14:04:28,626 INFO L226 Difference]: Without dead ends: 245 [2021-12-15 14:04:28,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-12-15 14:04:28,627 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 327 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:28,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 535 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:28,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-12-15 14:04:28,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 166. [2021-12-15 14:04:28,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 133 states have (on average 1.3458646616541354) internal successors, (179), 165 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 179 transitions. [2021-12-15 14:04:28,630 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 179 transitions. Word has length 23 [2021-12-15 14:04:28,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:28,630 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 179 transitions. [2021-12-15 14:04:28,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,630 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2021-12-15 14:04:28,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-15 14:04:28,631 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:28,631 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:28,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-15 14:04:28,631 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 72 more)] === [2021-12-15 14:04:28,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:28,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1577640795, now seen corresponding path program 1 times [2021-12-15 14:04:28,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:28,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795375081] [2021-12-15 14:04:28,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:28,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:28,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:28,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:28,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795375081] [2021-12-15 14:04:28,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795375081] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:04:28,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017662270] [2021-12-15 14:04:28,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:28,676 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:04:28,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:04:28,677 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 14:04:28,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-15 14:04:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:28,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-15 14:04:28,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:28,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 14:04:28,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 14:04:28,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:28,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:04:29,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:29,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017662270] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:04:29,116 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:04:29,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 11 [2021-12-15 14:04:29,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506477391] [2021-12-15 14:04:29,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:04:29,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-15 14:04:29,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:29,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-15 14:04:29,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-15 14:04:29,119 INFO L87 Difference]: Start difference. First operand 166 states and 179 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:29,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:29,367 INFO L93 Difference]: Finished difference Result 195 states and 213 transitions. [2021-12-15 14:04:29,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 14:04:29,367 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-15 14:04:29,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:29,368 INFO L225 Difference]: With dead ends: 195 [2021-12-15 14:04:29,368 INFO L226 Difference]: Without dead ends: 195 [2021-12-15 14:04:29,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-12-15 14:04:29,368 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 153 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:29,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 762 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:29,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-12-15 14:04:29,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 176. [2021-12-15 14:04:29,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 143 states have (on average 1.3286713286713288) internal successors, (190), 175 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 190 transitions. [2021-12-15 14:04:29,371 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 190 transitions. Word has length 26 [2021-12-15 14:04:29,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:29,371 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 190 transitions. [2021-12-15 14:04:29,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:29,371 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 190 transitions. [2021-12-15 14:04:29,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-15 14:04:29,372 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:29,372 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:29,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-15 14:04:29,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-15 14:04:29,584 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 72 more)] === [2021-12-15 14:04:29,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:29,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1662225504, now seen corresponding path program 1 times [2021-12-15 14:04:29,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:29,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844477753] [2021-12-15 14:04:29,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:29,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:29,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:29,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:29,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844477753] [2021-12-15 14:04:29,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844477753] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:04:29,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362063299] [2021-12-15 14:04:29,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:29,640 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:04:29,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:04:29,641 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 14:04:29,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-15 14:04:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:29,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 14:04:29,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:29,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2021-12-15 14:04:29,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:29,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:04:29,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:29,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362063299] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:04:29,914 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:04:29,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2021-12-15 14:04:29,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638288736] [2021-12-15 14:04:29,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:04:29,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 14:04:29,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:29,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 14:04:29,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:04:29,915 INFO L87 Difference]: Start difference. First operand 176 states and 190 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:30,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:30,015 INFO L93 Difference]: Finished difference Result 186 states and 199 transitions. [2021-12-15 14:04:30,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 14:04:30,015 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-15 14:04:30,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:30,016 INFO L225 Difference]: With dead ends: 186 [2021-12-15 14:04:30,016 INFO L226 Difference]: Without dead ends: 167 [2021-12-15 14:04:30,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:04:30,017 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 20 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:30,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 488 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 52 Unchecked, 0.1s Time] [2021-12-15 14:04:30,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-15 14:04:30,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2021-12-15 14:04:30,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 134 states have (on average 1.3432835820895523) internal successors, (180), 166 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:30,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2021-12-15 14:04:30,020 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 27 [2021-12-15 14:04:30,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:30,020 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2021-12-15 14:04:30,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:30,020 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2021-12-15 14:04:30,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-15 14:04:30,021 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:30,021 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:30,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-15 14:04:30,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-15 14:04:30,235 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 72 more)] === [2021-12-15 14:04:30,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:30,236 INFO L85 PathProgramCache]: Analyzing trace with hash -112828615, now seen corresponding path program 1 times [2021-12-15 14:04:30,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:30,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534234972] [2021-12-15 14:04:30,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:30,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:30,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:30,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:30,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534234972] [2021-12-15 14:04:30,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534234972] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:04:30,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105120364] [2021-12-15 14:04:30,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:30,342 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:04:30,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:04:30,343 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 14:04:30,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-15 14:04:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:30,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-15 14:04:30,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:30,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 14:04:30,493 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:04:30,493 INFO L388 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 [2021-12-15 14:04:30,524 INFO L388 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:04:30,589 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:04:30,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-15 14:04:30,665 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:04:30,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2021-12-15 14:04:30,695 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:04:30,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-15 14:04:30,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2021-12-15 14:04:30,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:30,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:04:30,850 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_502) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-15 14:04:30,861 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_502) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-15 14:04:30,866 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_502) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-15 14:04:30,876 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (not (= 0 (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_500))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_502)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-15 14:04:30,882 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (not (= 0 (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_500))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_502)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-15 14:04:30,899 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:04:30,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2021-12-15 14:04:30,907 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:04:30,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 245 treesize of output 220 [2021-12-15 14:04:30,916 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:04:30,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 204 treesize of output 197 [2021-12-15 14:04:30,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 180 [2021-12-15 14:04:31,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:31,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105120364] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:04:31,089 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:04:31,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 26 [2021-12-15 14:04:31,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451366601] [2021-12-15 14:04:31,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:04:31,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-15 14:04:31,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:31,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-15 14:04:31,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=353, Unknown=5, NotChecked=210, Total=650 [2021-12-15 14:04:31,091 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand has 26 states, 26 states have (on average 3.076923076923077) internal successors, (80), 26 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:31,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:31,578 INFO L93 Difference]: Finished difference Result 293 states and 320 transitions. [2021-12-15 14:04:31,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-15 14:04:31,579 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.076923076923077) internal successors, (80), 26 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-15 14:04:31,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:31,579 INFO L225 Difference]: With dead ends: 293 [2021-12-15 14:04:31,579 INFO L226 Difference]: Without dead ends: 293 [2021-12-15 14:04:31,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=208, Invalid=737, Unknown=5, NotChecked=310, Total=1260 [2021-12-15 14:04:31,580 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 443 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1180 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:31,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [443 Valid, 1152 Invalid, 1966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 748 Invalid, 0 Unknown, 1180 Unchecked, 0.3s Time] [2021-12-15 14:04:31,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-12-15 14:04:31,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 177. [2021-12-15 14:04:31,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 144 states have (on average 1.3333333333333333) internal successors, (192), 176 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:31,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 192 transitions. [2021-12-15 14:04:31,583 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 192 transitions. Word has length 33 [2021-12-15 14:04:31,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:31,583 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 192 transitions. [2021-12-15 14:04:31,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.076923076923077) internal successors, (80), 26 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:31,584 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 192 transitions. [2021-12-15 14:04:31,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-15 14:04:31,584 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:31,584 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:31,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-15 14:04:31,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:04:31,796 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 72 more)] === [2021-12-15 14:04:31,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:31,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1345804944, now seen corresponding path program 1 times [2021-12-15 14:04:31,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:31,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813578929] [2021-12-15 14:04:31,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:31,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:31,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:31,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:31,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813578929] [2021-12-15 14:04:31,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813578929] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:31,819 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:31,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:04:31,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74641681] [2021-12-15 14:04:31,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:31,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:31,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:31,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:31,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:31,820 INFO L87 Difference]: Start difference. First operand 177 states and 192 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:31,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:31,836 INFO L93 Difference]: Finished difference Result 253 states and 274 transitions. [2021-12-15 14:04:31,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:31,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-15 14:04:31,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:31,837 INFO L225 Difference]: With dead ends: 253 [2021-12-15 14:04:31,837 INFO L226 Difference]: Without dead ends: 253 [2021-12-15 14:04:31,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:31,838 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 60 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:31,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 262 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:04:31,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-12-15 14:04:31,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 198. [2021-12-15 14:04:31,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 165 states have (on average 1.2969696969696969) internal successors, (214), 197 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:31,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 214 transitions. [2021-12-15 14:04:31,841 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 214 transitions. Word has length 34 [2021-12-15 14:04:31,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:31,841 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 214 transitions. [2021-12-15 14:04:31,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:31,841 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 214 transitions. [2021-12-15 14:04:31,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-15 14:04:31,841 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:31,841 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:31,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-15 14:04:31,841 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 72 more)] === [2021-12-15 14:04:31,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:31,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1953253304, now seen corresponding path program 1 times [2021-12-15 14:04:31,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:31,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057209641] [2021-12-15 14:04:31,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:31,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:31,926 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:31,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:31,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057209641] [2021-12-15 14:04:31,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057209641] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:04:31,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903268245] [2021-12-15 14:04:31,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:31,926 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:04:31,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:04:31,927 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 14:04:31,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-15 14:04:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:32,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-15 14:04:32,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:32,028 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-15 14:04:32,042 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-15 14:04:32,088 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-15 14:04:32,115 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:04:32,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-15 14:04:32,131 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:32,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:04:32,296 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:32,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903268245] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:04:32,297 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:04:32,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2021-12-15 14:04:32,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673067140] [2021-12-15 14:04:32,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:04:32,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-15 14:04:32,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:32,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 14:04:32,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-12-15 14:04:32,298 INFO L87 Difference]: Start difference. First operand 198 states and 214 transitions. Second operand has 14 states, 14 states have (on average 8.0) internal successors, (112), 13 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:32,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:32,483 INFO L93 Difference]: Finished difference Result 263 states and 280 transitions. [2021-12-15 14:04:32,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 14:04:32,483 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.0) internal successors, (112), 13 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-12-15 14:04:32,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:32,484 INFO L225 Difference]: With dead ends: 263 [2021-12-15 14:04:32,484 INFO L226 Difference]: Without dead ends: 263 [2021-12-15 14:04:32,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 74 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2021-12-15 14:04:32,485 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 1129 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:32,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1129 Valid, 260 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:32,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-12-15 14:04:32,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 196. [2021-12-15 14:04:32,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 164 states have (on average 1.2865853658536586) internal successors, (211), 195 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:32,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 211 transitions. [2021-12-15 14:04:32,488 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 211 transitions. Word has length 41 [2021-12-15 14:04:32,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:32,488 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 211 transitions. [2021-12-15 14:04:32,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.0) internal successors, (112), 13 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:32,488 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 211 transitions. [2021-12-15 14:04:32,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-15 14:04:32,488 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:32,488 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:32,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-15 14:04:32,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:04:32,697 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 72 more)] === [2021-12-15 14:04:32,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:32,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1598443618, now seen corresponding path program 1 times [2021-12-15 14:04:32,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:32,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602293248] [2021-12-15 14:04:32,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:32,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:32,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:32,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:32,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602293248] [2021-12-15 14:04:32,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602293248] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:04:32,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402436176] [2021-12-15 14:04:32,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:32,848 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:04:32,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:04:32,849 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 14:04:32,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-15 14:04:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:32,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-15 14:04:32,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:32,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 14:04:33,003 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-15 14:04:33,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-15 14:04:33,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:04:33,111 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:04:33,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-15 14:04:33,192 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:04:33,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-15 14:04:33,224 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:04:33,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-15 14:04:33,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-15 14:04:33,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:33,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:04:33,521 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_794 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_794) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2021-12-15 14:04:33,603 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_792 (Array Int Int)) (v_ArrVal_794 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_792))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_794)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2021-12-15 14:04:33,608 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_792 (Array Int Int)) (v_ArrVal_794 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_792))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_794)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2021-12-15 14:04:33,616 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:04:33,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2021-12-15 14:04:33,622 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:04:33,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 227 [2021-12-15 14:04:33,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 204 [2021-12-15 14:04:33,634 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:04:33,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 204 treesize of output 196 [2021-12-15 14:04:40,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:40,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402436176] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:04:40,022 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:04:40,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 33 [2021-12-15 14:04:40,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821064717] [2021-12-15 14:04:40,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:04:40,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-15 14:04:40,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:40,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-15 14:04:40,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=751, Unknown=16, NotChecked=180, Total=1122 [2021-12-15 14:04:40,023 INFO L87 Difference]: Start difference. First operand 196 states and 211 transitions. Second operand has 34 states, 33 states have (on average 3.8181818181818183) internal successors, (126), 34 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:40,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:40,647 INFO L93 Difference]: Finished difference Result 292 states and 320 transitions. [2021-12-15 14:04:40,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-15 14:04:40,647 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.8181818181818183) internal successors, (126), 34 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-12-15 14:04:40,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:40,648 INFO L225 Difference]: With dead ends: 292 [2021-12-15 14:04:40,648 INFO L226 Difference]: Without dead ends: 292 [2021-12-15 14:04:40,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=448, Invalid=1617, Unknown=17, NotChecked=270, Total=2352 [2021-12-15 14:04:40,649 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 467 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 1752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1027 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:40,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [467 Valid, 1198 Invalid, 1752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 643 Invalid, 0 Unknown, 1027 Unchecked, 0.3s Time] [2021-12-15 14:04:40,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-12-15 14:04:40,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 207. [2021-12-15 14:04:40,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 175 states have (on average 1.2914285714285714) internal successors, (226), 206 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 226 transitions. [2021-12-15 14:04:40,653 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 226 transitions. Word has length 43 [2021-12-15 14:04:40,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:40,653 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 226 transitions. [2021-12-15 14:04:40,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.8181818181818183) internal successors, (126), 34 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:40,653 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 226 transitions. [2021-12-15 14:04:40,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-15 14:04:40,654 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:40,654 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:40,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-15 14:04:40,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:04:40,873 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 72 more)] === [2021-12-15 14:04:40,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:40,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1598443619, now seen corresponding path program 1 times [2021-12-15 14:04:40,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:40,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195931631] [2021-12-15 14:04:40,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:40,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:41,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:41,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:41,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195931631] [2021-12-15 14:04:41,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195931631] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:04:41,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771622080] [2021-12-15 14:04:41,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:41,116 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:04:41,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:04:41,117 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 14:04:41,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-15 14:04:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:41,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-15 14:04:41,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:41,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 14:04:41,273 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:04:41,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-15 14:04:41,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 14:04:41,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:04:41,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:04:41,424 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:04:41,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-15 14:04:41,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 14:04:41,528 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 14:04:41,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-15 14:04:41,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-15 14:04:41,546 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:04:41,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-15 14:04:41,602 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:04:41,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-15 14:04:41,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 14:04:41,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-15 14:04:41,764 INFO L388 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 [2021-12-15 14:04:41,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:41,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:04:41,989 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_898 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_898) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))) (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_897 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_898) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_897) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-15 14:04:42,007 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_898 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_898) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))) (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_897 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_898) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_897) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-15 14:04:42,017 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_898 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_898) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))) (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_897 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_898) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_897) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2021-12-15 14:04:42,034 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_897 (Array Int Int)) (v_ArrVal_894 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_894))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_893) .cse0 v_ArrVal_898) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_897) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_894 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_893) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_894) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_898) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8)))) is different from false [2021-12-15 14:04:42,051 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_897 (Array Int Int)) (v_ArrVal_894 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_894))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_893) .cse1 v_ArrVal_898) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_897) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_894 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_893) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_894) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_898)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8)))) is different from false [2021-12-15 14:04:42,068 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:04:42,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2021-12-15 14:04:42,072 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:04:42,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2021-12-15 14:04:42,080 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:04:42,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 632 treesize of output 567 [2021-12-15 14:04:42,097 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:04:42,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1872 treesize of output 1783 [2021-12-15 14:04:42,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1768 treesize of output 1688 [2021-12-15 14:04:42,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1688 treesize of output 1608 [2021-12-15 14:04:42,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1608 treesize of output 1576 [2021-12-15 14:04:42,144 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:04:42,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1576 treesize of output 1436