./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/sll-01-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2ea18b6ba0d977117db11fbdff34c486def646c3 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 02:15:53,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 02:15:53,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 02:15:53,708 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 02:15:53,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 02:15:53,711 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 02:15:53,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 02:15:53,717 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 02:15:53,719 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 02:15:53,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 02:15:53,723 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 02:15:53,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 02:15:53,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 02:15:53,736 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 02:15:53,739 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 02:15:53,740 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 02:15:53,741 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 02:15:53,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 02:15:53,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 02:15:53,751 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 02:15:53,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 02:15:53,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 02:15:53,755 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 02:15:53,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 02:15:53,760 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 02:15:53,760 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 02:15:53,760 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 02:15:53,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 02:15:53,762 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 02:15:53,763 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 02:15:53,763 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 02:15:53,764 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 02:15:53,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 02:15:53,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 02:15:53,767 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 02:15:53,767 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 02:15:53,768 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 02:15:53,768 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 02:15:53,768 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 02:15:53,769 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 02:15:53,770 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 02:15:53,773 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 02:15:53,807 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 02:15:53,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 02:15:53,809 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 02:15:53,809 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 02:15:53,810 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 02:15:53,810 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 02:15:53,810 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 02:15:53,811 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 02:15:53,811 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 02:15:53,811 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 02:15:53,812 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 02:15:53,812 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 02:15:53,812 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 02:15:53,812 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 02:15:53,812 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 02:15:53,812 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 02:15:53,813 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 02:15:53,813 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 02:15:53,813 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 02:15:53,813 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 02:15:53,813 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 02:15:53,818 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 02:15:53,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 02:15:53,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 02:15:53,818 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 02:15:53,819 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 02:15:53,819 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 02:15:53,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 02:15:53,819 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 02:15:53,819 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 02:15:53,819 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2ea18b6ba0d977117db11fbdff34c486def646c3 [2021-08-26 02:15:54,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 02:15:54,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 02:15:54,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 02:15:54,102 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 02:15:54,103 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 02:15:54,104 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-2.i [2021-08-26 02:15:54,154 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6d8cadb7/6ab6258fcf3540358c045d8d9b3ca68e/FLAG2f1a73250 [2021-08-26 02:15:54,563 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 02:15:54,564 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i [2021-08-26 02:15:54,576 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6d8cadb7/6ab6258fcf3540358c045d8d9b3ca68e/FLAG2f1a73250 [2021-08-26 02:15:54,928 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6d8cadb7/6ab6258fcf3540358c045d8d9b3ca68e [2021-08-26 02:15:54,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 02:15:54,934 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 02:15:54,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 02:15:54,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 02:15:54,939 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 02:15:54,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:15:54" (1/1) ... [2021-08-26 02:15:54,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13310240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:15:54, skipping insertion in model container [2021-08-26 02:15:54,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:15:54" (1/1) ... [2021-08-26 02:15:54,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 02:15:54,984 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 02:15:55,210 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2021-08-26 02:15:55,214 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2021-08-26 02:15:55,216 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2021-08-26 02:15:55,216 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2021-08-26 02:15:55,218 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2021-08-26 02:15:55,220 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2021-08-26 02:15:55,222 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2021-08-26 02:15:55,225 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2021-08-26 02:15:55,226 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2021-08-26 02:15:55,227 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2021-08-26 02:15:55,229 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2021-08-26 02:15:55,230 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2021-08-26 02:15:55,231 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2021-08-26 02:15:55,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 02:15:55,238 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 02:15:55,258 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2021-08-26 02:15:55,260 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2021-08-26 02:15:55,261 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2021-08-26 02:15:55,269 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2021-08-26 02:15:55,271 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2021-08-26 02:15:55,273 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2021-08-26 02:15:55,275 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2021-08-26 02:15:55,276 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2021-08-26 02:15:55,277 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2021-08-26 02:15:55,279 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2021-08-26 02:15:55,285 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2021-08-26 02:15:55,287 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2021-08-26 02:15:55,288 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2021-08-26 02:15:55,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 02:15:55,314 INFO L208 MainTranslator]: Completed translation [2021-08-26 02:15:55,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:15:55 WrapperNode [2021-08-26 02:15:55,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 02:15:55,316 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 02:15:55,316 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 02:15:55,316 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 02:15:55,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:15:55" (1/1) ... [2021-08-26 02:15:55,330 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:15:55" (1/1) ... [2021-08-26 02:15:55,347 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 02:15:55,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 02:15:55,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 02:15:55,348 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 02:15:55,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:15:55" (1/1) ... [2021-08-26 02:15:55,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:15:55" (1/1) ... [2021-08-26 02:15:55,357 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:15:55" (1/1) ... [2021-08-26 02:15:55,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:15:55" (1/1) ... [2021-08-26 02:15:55,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:15:55" (1/1) ... [2021-08-26 02:15:55,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:15:55" (1/1) ... [2021-08-26 02:15:55,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:15:55" (1/1) ... [2021-08-26 02:15:55,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 02:15:55,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 02:15:55,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 02:15:55,374 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 02:15:55,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:15:55" (1/1) ... [2021-08-26 02:15:55,381 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 02:15:55,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 02:15:55,401 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-08-26 02:15:55,403 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-08-26 02:15:55,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-26 02:15:55,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-26 02:15:55,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 02:15:55,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-26 02:15:55,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-26 02:15:55,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 02:15:55,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 02:15:55,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 02:15:55,804 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 02:15:55,804 INFO L299 CfgBuilder]: Removed 34 assume(true) statements. [2021-08-26 02:15:55,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:15:55 BoogieIcfgContainer [2021-08-26 02:15:55,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 02:15:55,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 02:15:55,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 02:15:55,809 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 02:15:55,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 02:15:54" (1/3) ... [2021-08-26 02:15:55,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@138ef640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:15:55, skipping insertion in model container [2021-08-26 02:15:55,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:15:55" (2/3) ... [2021-08-26 02:15:55,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@138ef640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:15:55, skipping insertion in model container [2021-08-26 02:15:55,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:15:55" (3/3) ... [2021-08-26 02:15:55,811 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2021-08-26 02:15:55,814 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 02:15:55,814 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2021-08-26 02:15:55,845 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 02:15:55,849 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 02:15:55,849 INFO L340 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2021-08-26 02:15:55,861 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 70 states have (on average 1.957142857142857) internal successors, (137), 83 states have internal predecessors, (137), 0 states have call successors, (0), 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-08-26 02:15:55,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-08-26 02:15:55,864 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:15:55,865 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-08-26 02:15:55,865 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-08-26 02:15:55,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:15:55,872 INFO L82 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2021-08-26 02:15:55,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:15:55,878 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296115534] [2021-08-26 02:15:55,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:15:55,880 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:15:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:15:56,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:15:56,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:15:56,028 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296115534] [2021-08-26 02:15:56,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296115534] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:15:56,029 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:15:56,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 02:15:56,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524311770] [2021-08-26 02:15:56,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 02:15:56,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:15:56,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 02:15:56,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 02:15:56,048 INFO L87 Difference]: Start difference. First operand has 84 states, 70 states have (on average 1.957142857142857) internal successors, (137), 83 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:56,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:15:56,111 INFO L93 Difference]: Finished difference Result 182 states and 300 transitions. [2021-08-26 02:15:56,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 02:15:56,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-08-26 02:15:56,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:15:56,120 INFO L225 Difference]: With dead ends: 182 [2021-08-26 02:15:56,120 INFO L226 Difference]: Without dead ends: 96 [2021-08-26 02:15:56,122 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 02:15:56,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-08-26 02:15:56,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2021-08-26 02:15:56,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 77 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2021-08-26 02:15:56,161 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 4 [2021-08-26 02:15:56,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:15:56,161 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2021-08-26 02:15:56,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:56,162 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2021-08-26 02:15:56,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-26 02:15:56,162 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:15:56,162 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:15:56,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 02:15:56,163 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-08-26 02:15:56,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:15:56,165 INFO L82 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2021-08-26 02:15:56,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:15:56,165 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424514957] [2021-08-26 02:15:56,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:15:56,166 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:15:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:15:56,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:15:56,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:15:56,217 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424514957] [2021-08-26 02:15:56,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424514957] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:15:56,218 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:15:56,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 02:15:56,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843828531] [2021-08-26 02:15:56,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 02:15:56,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:15:56,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 02:15:56,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 02:15:56,222 INFO L87 Difference]: Start difference. First operand 78 states and 88 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-08-26 02:15:56,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:15:56,241 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2021-08-26 02:15:56,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 02:15:56,242 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-08-26 02:15:56,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:15:56,244 INFO L225 Difference]: With dead ends: 81 [2021-08-26 02:15:56,246 INFO L226 Difference]: Without dead ends: 79 [2021-08-26 02:15:56,246 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 02:15:56,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-08-26 02:15:56,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2021-08-26 02:15:56,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 67 states have (on average 1.328358208955224) internal successors, (89), 78 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:56,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2021-08-26 02:15:56,257 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 10 [2021-08-26 02:15:56,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:15:56,258 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2021-08-26 02:15:56,262 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-08-26 02:15:56,262 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2021-08-26 02:15:56,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-26 02:15:56,263 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:15:56,263 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:15:56,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 02:15:56,264 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-08-26 02:15:56,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:15:56,265 INFO L82 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2021-08-26 02:15:56,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:15:56,266 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159992794] [2021-08-26 02:15:56,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:15:56,266 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:15:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:15:56,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:15:56,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:15:56,324 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159992794] [2021-08-26 02:15:56,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159992794] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:15:56,324 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:15:56,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 02:15:56,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904974549] [2021-08-26 02:15:56,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 02:15:56,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:15:56,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 02:15:56,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 02:15:56,326 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:56,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:15:56,386 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2021-08-26 02:15:56,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 02:15:56,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-08-26 02:15:56,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:15:56,389 INFO L225 Difference]: With dead ends: 80 [2021-08-26 02:15:56,389 INFO L226 Difference]: Without dead ends: 78 [2021-08-26 02:15:56,389 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 02:15:56,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-08-26 02:15:56,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2021-08-26 02:15:56,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.323076923076923) internal successors, (86), 75 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:56,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2021-08-26 02:15:56,397 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 10 [2021-08-26 02:15:56,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:15:56,398 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2021-08-26 02:15:56,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:56,399 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2021-08-26 02:15:56,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-26 02:15:56,399 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:15:56,399 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:15:56,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 02:15:56,399 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-08-26 02:15:56,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:15:56,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1712619113, now seen corresponding path program 1 times [2021-08-26 02:15:56,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:15:56,400 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864597101] [2021-08-26 02:15:56,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:15:56,401 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:15:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:15:56,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:15:56,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:15:56,431 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864597101] [2021-08-26 02:15:56,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864597101] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:15:56,431 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:15:56,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 02:15:56,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278363894] [2021-08-26 02:15:56,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 02:15:56,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:15:56,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 02:15:56,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 02:15:56,434 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:56,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:15:56,476 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2021-08-26 02:15:56,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 02:15:56,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-08-26 02:15:56,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:15:56,478 INFO L225 Difference]: With dead ends: 79 [2021-08-26 02:15:56,478 INFO L226 Difference]: Without dead ends: 75 [2021-08-26 02:15:56,478 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 02:15:56,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-08-26 02:15:56,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2021-08-26 02:15:56,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 71 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:56,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2021-08-26 02:15:56,490 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 15 [2021-08-26 02:15:56,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:15:56,491 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2021-08-26 02:15:56,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:56,491 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2021-08-26 02:15:56,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-26 02:15:56,492 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:15:56,492 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:15:56,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 02:15:56,492 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-08-26 02:15:56,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:15:56,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1551589151, now seen corresponding path program 1 times [2021-08-26 02:15:56,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:15:56,493 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979872987] [2021-08-26 02:15:56,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:15:56,493 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:15:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:15:56,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:15:56,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:15:56,544 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979872987] [2021-08-26 02:15:56,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979872987] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:15:56,544 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:15:56,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 02:15:56,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802739406] [2021-08-26 02:15:56,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 02:15:56,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:15:56,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 02:15:56,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 02:15:56,545 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:56,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:15:56,614 INFO L93 Difference]: Finished difference Result 190 states and 215 transitions. [2021-08-26 02:15:56,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 02:15:56,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-08-26 02:15:56,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:15:56,616 INFO L225 Difference]: With dead ends: 190 [2021-08-26 02:15:56,616 INFO L226 Difference]: Without dead ends: 126 [2021-08-26 02:15:56,617 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 02:15:56,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-08-26 02:15:56,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 74. [2021-08-26 02:15:56,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 73 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:56,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2021-08-26 02:15:56,625 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 16 [2021-08-26 02:15:56,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:15:56,626 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2021-08-26 02:15:56,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:56,626 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2021-08-26 02:15:56,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-26 02:15:56,626 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:15:56,627 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:15:56,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 02:15:56,627 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-08-26 02:15:56,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:15:56,628 INFO L82 PathProgramCache]: Analyzing trace with hash -2063319775, now seen corresponding path program 1 times [2021-08-26 02:15:56,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:15:56,630 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913767256] [2021-08-26 02:15:56,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:15:56,631 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:15:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:15:56,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:15:56,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:15:56,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913767256] [2021-08-26 02:15:56,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913767256] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:15:56,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:15:56,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 02:15:56,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247875469] [2021-08-26 02:15:56,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 02:15:56,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:15:56,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 02:15:56,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 02:15:56,679 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:56,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:15:56,733 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2021-08-26 02:15:56,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 02:15:56,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-08-26 02:15:56,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:15:56,734 INFO L225 Difference]: With dead ends: 134 [2021-08-26 02:15:56,735 INFO L226 Difference]: Without dead ends: 114 [2021-08-26 02:15:56,735 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 02:15:56,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-08-26 02:15:56,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 73. [2021-08-26 02:15:56,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 72 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:56,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2021-08-26 02:15:56,738 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 16 [2021-08-26 02:15:56,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:15:56,738 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2021-08-26 02:15:56,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:56,738 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2021-08-26 02:15:56,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-26 02:15:56,739 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:15:56,739 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:15:56,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 02:15:56,739 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-08-26 02:15:56,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:15:56,740 INFO L82 PathProgramCache]: Analyzing trace with hash -940628020, now seen corresponding path program 1 times [2021-08-26 02:15:56,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:15:56,740 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049819786] [2021-08-26 02:15:56,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:15:56,740 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:15:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:15:56,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:15:56,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:15:56,762 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049819786] [2021-08-26 02:15:56,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049819786] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:15:56,763 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:15:56,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 02:15:56,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493053547] [2021-08-26 02:15:56,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 02:15:56,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:15:56,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 02:15:56,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 02:15:56,764 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:56,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:15:56,777 INFO L93 Difference]: Finished difference Result 139 states and 159 transitions. [2021-08-26 02:15:56,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 02:15:56,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-08-26 02:15:56,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:15:56,778 INFO L225 Difference]: With dead ends: 139 [2021-08-26 02:15:56,778 INFO L226 Difference]: Without dead ends: 97 [2021-08-26 02:15:56,779 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 02:15:56,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-08-26 02:15:56,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2021-08-26 02:15:56,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 75 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:56,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2021-08-26 02:15:56,786 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 20 [2021-08-26 02:15:56,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:15:56,786 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2021-08-26 02:15:56,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:56,786 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2021-08-26 02:15:56,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 02:15:56,787 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:15:56,787 INFO L512 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-08-26 02:15:56,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-26 02:15:56,787 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-08-26 02:15:56,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:15:56,788 INFO L82 PathProgramCache]: Analyzing trace with hash 905291998, now seen corresponding path program 1 times [2021-08-26 02:15:56,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:15:56,788 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923835523] [2021-08-26 02:15:56,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:15:56,788 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:15:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:15:56,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:15:56,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:15:56,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923835523] [2021-08-26 02:15:56,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923835523] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:15:56,831 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:15:56,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 02:15:56,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060163406] [2021-08-26 02:15:56,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 02:15:56,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:15:56,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 02:15:56,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 02:15:56,835 INFO L87 Difference]: Start difference. First operand 76 states and 87 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-08-26 02:15:56,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:15:56,857 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2021-08-26 02:15:56,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 02:15:56,858 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-08-26 02:15:56,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:15:56,859 INFO L225 Difference]: With dead ends: 76 [2021-08-26 02:15:56,859 INFO L226 Difference]: Without dead ends: 74 [2021-08-26 02:15:56,859 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 02:15:56,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-08-26 02:15:56,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-08-26 02:15:56,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 73 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:56,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2021-08-26 02:15:56,861 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 21 [2021-08-26 02:15:56,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:15:56,862 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2021-08-26 02:15:56,862 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-08-26 02:15:56,862 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2021-08-26 02:15:56,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-26 02:15:56,862 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:15:56,863 INFO L512 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-08-26 02:15:56,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-26 02:15:56,863 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-08-26 02:15:56,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:15:56,863 INFO L82 PathProgramCache]: Analyzing trace with hash 886650935, now seen corresponding path program 1 times [2021-08-26 02:15:56,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:15:56,864 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016423761] [2021-08-26 02:15:56,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:15:56,864 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:15:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:15:56,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:15:56,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:15:56,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016423761] [2021-08-26 02:15:56,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016423761] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:15:56,895 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:15:56,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 02:15:56,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099570998] [2021-08-26 02:15:56,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 02:15:56,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:15:56,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 02:15:56,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 02:15:56,901 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:56,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:15:56,941 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2021-08-26 02:15:56,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 02:15:56,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-08-26 02:15:56,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:15:56,942 INFO L225 Difference]: With dead ends: 75 [2021-08-26 02:15:56,942 INFO L226 Difference]: Without dead ends: 73 [2021-08-26 02:15:56,942 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 02:15:56,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-08-26 02:15:56,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2021-08-26 02:15:56,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 71 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:56,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2021-08-26 02:15:56,944 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 23 [2021-08-26 02:15:56,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:15:56,944 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2021-08-26 02:15:56,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:56,945 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2021-08-26 02:15:56,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-26 02:15:56,945 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:15:56,945 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:15:56,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-26 02:15:56,945 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-08-26 02:15:56,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:15:56,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1458355201, now seen corresponding path program 1 times [2021-08-26 02:15:56,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:15:56,946 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459647313] [2021-08-26 02:15:56,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:15:56,946 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:15:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:15:57,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:15:57,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:15:57,011 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459647313] [2021-08-26 02:15:57,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459647313] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:15:57,011 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:15:57,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 02:15:57,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814110121] [2021-08-26 02:15:57,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 02:15:57,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:15:57,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 02:15:57,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-26 02:15:57,012 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:57,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:15:57,176 INFO L93 Difference]: Finished difference Result 178 states and 205 transitions. [2021-08-26 02:15:57,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-26 02:15:57,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-08-26 02:15:57,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:15:57,178 INFO L225 Difference]: With dead ends: 178 [2021-08-26 02:15:57,178 INFO L226 Difference]: Without dead ends: 135 [2021-08-26 02:15:57,180 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 59.2ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-08-26 02:15:57,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-08-26 02:15:57,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 82. [2021-08-26 02:15:57,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 76 states have (on average 1.236842105263158) internal successors, (94), 81 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:57,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2021-08-26 02:15:57,185 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 24 [2021-08-26 02:15:57,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:15:57,185 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2021-08-26 02:15:57,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:57,186 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2021-08-26 02:15:57,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-26 02:15:57,188 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:15:57,188 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:15:57,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-26 02:15:57,188 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-08-26 02:15:57,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:15:57,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1357759361, now seen corresponding path program 1 times [2021-08-26 02:15:57,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:15:57,189 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431781881] [2021-08-26 02:15:57,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:15:57,189 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:15:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:15:57,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:15:57,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:15:57,351 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431781881] [2021-08-26 02:15:57,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431781881] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:15:57,352 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:15:57,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-26 02:15:57,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454338929] [2021-08-26 02:15:57,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 02:15:57,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:15:57,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 02:15:57,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-26 02:15:57,353 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:57,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:15:57,693 INFO L93 Difference]: Finished difference Result 237 states and 265 transitions. [2021-08-26 02:15:57,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-26 02:15:57,694 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-08-26 02:15:57,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:15:57,695 INFO L225 Difference]: With dead ends: 237 [2021-08-26 02:15:57,695 INFO L226 Difference]: Without dead ends: 235 [2021-08-26 02:15:57,696 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 166.5ms TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-08-26 02:15:57,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-08-26 02:15:57,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 94. [2021-08-26 02:15:57,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 88 states have (on average 1.2272727272727273) internal successors, (108), 93 states have internal predecessors, (108), 0 states have call successors, (0), 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-08-26 02:15:57,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2021-08-26 02:15:57,699 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 24 [2021-08-26 02:15:57,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:15:57,700 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2021-08-26 02:15:57,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:57,700 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2021-08-26 02:15:57,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-26 02:15:57,700 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:15:57,701 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:15:57,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-26 02:15:57,701 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-08-26 02:15:57,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:15:57,701 INFO L82 PathProgramCache]: Analyzing trace with hash -545310703, now seen corresponding path program 1 times [2021-08-26 02:15:57,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:15:57,702 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391827888] [2021-08-26 02:15:57,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:15:57,702 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:15:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:15:57,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-26 02:15:57,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:15:57,744 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391827888] [2021-08-26 02:15:57,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391827888] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:15:57,744 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:15:57,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 02:15:57,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997352480] [2021-08-26 02:15:57,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 02:15:57,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:15:57,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 02:15:57,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-26 02:15:57,745 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:57,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:15:57,837 INFO L93 Difference]: Finished difference Result 141 states and 162 transitions. [2021-08-26 02:15:57,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 02:15:57,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-08-26 02:15:57,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:15:57,838 INFO L225 Difference]: With dead ends: 141 [2021-08-26 02:15:57,839 INFO L226 Difference]: Without dead ends: 123 [2021-08-26 02:15:57,839 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 26.0ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-26 02:15:57,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-08-26 02:15:57,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 115. [2021-08-26 02:15:57,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 109 states have (on average 1.2568807339449541) internal successors, (137), 114 states have internal predecessors, (137), 0 states have call successors, (0), 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-08-26 02:15:57,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 137 transitions. [2021-08-26 02:15:57,842 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 137 transitions. Word has length 26 [2021-08-26 02:15:57,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:15:57,843 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 137 transitions. [2021-08-26 02:15:57,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:57,843 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 137 transitions. [2021-08-26 02:15:57,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-26 02:15:57,844 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:15:57,844 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:15:57,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-26 02:15:57,844 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-08-26 02:15:57,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:15:57,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1566334865, now seen corresponding path program 1 times [2021-08-26 02:15:57,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:15:57,845 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994570337] [2021-08-26 02:15:57,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:15:57,845 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:15:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:15:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-26 02:15:57,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:15:57,864 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994570337] [2021-08-26 02:15:57,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994570337] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:15:57,864 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:15:57,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 02:15:57,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067632243] [2021-08-26 02:15:57,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 02:15:57,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:15:57,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 02:15:57,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 02:15:57,865 INFO L87 Difference]: Start difference. First operand 115 states and 137 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:57,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:15:57,896 INFO L93 Difference]: Finished difference Result 115 states and 137 transitions. [2021-08-26 02:15:57,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 02:15:57,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-08-26 02:15:57,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:15:57,897 INFO L225 Difference]: With dead ends: 115 [2021-08-26 02:15:57,897 INFO L226 Difference]: Without dead ends: 113 [2021-08-26 02:15:57,897 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 02:15:57,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-08-26 02:15:57,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2021-08-26 02:15:57,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.25) internal successors, (135), 112 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:57,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 135 transitions. [2021-08-26 02:15:57,900 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 135 transitions. Word has length 26 [2021-08-26 02:15:57,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:15:57,901 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 135 transitions. [2021-08-26 02:15:57,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:57,901 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 135 transitions. [2021-08-26 02:15:57,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-26 02:15:57,902 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:15:57,902 INFO L512 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-08-26 02:15:57,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-26 02:15:57,902 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-08-26 02:15:57,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:15:57,902 INFO L82 PathProgramCache]: Analyzing trace with hash -988757936, now seen corresponding path program 1 times [2021-08-26 02:15:57,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:15:57,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688924225] [2021-08-26 02:15:57,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:15:57,903 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:15:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:15:57,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:15:57,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:15:57,994 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688924225] [2021-08-26 02:15:57,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688924225] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:15:57,994 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:15:57,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-26 02:15:57,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040577068] [2021-08-26 02:15:57,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 02:15:57,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:15:57,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 02:15:57,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-26 02:15:57,996 INFO L87 Difference]: Start difference. First operand 113 states and 135 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:58,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:15:58,341 INFO L93 Difference]: Finished difference Result 273 states and 318 transitions. [2021-08-26 02:15:58,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-26 02:15:58,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-08-26 02:15:58,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:15:58,342 INFO L225 Difference]: With dead ends: 273 [2021-08-26 02:15:58,342 INFO L226 Difference]: Without dead ends: 271 [2021-08-26 02:15:58,343 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 142.6ms TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-08-26 02:15:58,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-08-26 02:15:58,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 116. [2021-08-26 02:15:58,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.2432432432432432) internal successors, (138), 115 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:58,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 138 transitions. [2021-08-26 02:15:58,348 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 138 transitions. Word has length 27 [2021-08-26 02:15:58,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:15:58,348 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 138 transitions. [2021-08-26 02:15:58,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:58,349 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 138 transitions. [2021-08-26 02:15:58,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-26 02:15:58,349 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:15:58,349 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:15:58,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-26 02:15:58,350 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-08-26 02:15:58,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:15:58,350 INFO L82 PathProgramCache]: Analyzing trace with hash 2026653164, now seen corresponding path program 1 times [2021-08-26 02:15:58,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:15:58,350 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443094554] [2021-08-26 02:15:58,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:15:58,351 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:15:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:15:58,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:15:58,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:15:58,408 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443094554] [2021-08-26 02:15:58,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443094554] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:15:58,409 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849322667] [2021-08-26 02:15:58,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:15:58,409 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:15:58,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 02:15:58,410 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-08-26 02:15:58,424 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-08-26 02:15:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:15:58,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-26 02:15:58,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 02:15:58,578 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-08-26 02:15:58,584 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-08-26 02:15:58,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-26 02:15:58,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-26 02:15:58,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-26 02:15:58,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-26 02:15:59,069 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-26 02:15:59,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 31 [2021-08-26 02:15:59,074 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-26 02:15:59,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2021-08-26 02:15:59,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:15:59,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849322667] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:15:59,093 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 02:15:59,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2021-08-26 02:15:59,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832736049] [2021-08-26 02:15:59,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 02:15:59,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:15:59,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 02:15:59,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-26 02:15:59,095 INFO L87 Difference]: Start difference. First operand 116 states and 138 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:59,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:15:59,288 INFO L93 Difference]: Finished difference Result 220 states and 256 transitions. [2021-08-26 02:15:59,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 02:15:59,288 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-08-26 02:15:59,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:15:59,289 INFO L225 Difference]: With dead ends: 220 [2021-08-26 02:15:59,289 INFO L226 Difference]: Without dead ends: 158 [2021-08-26 02:15:59,290 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 98.1ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-08-26 02:15:59,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-08-26 02:15:59,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 118. [2021-08-26 02:15:59,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.2212389380530972) internal successors, (138), 117 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:59,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 138 transitions. [2021-08-26 02:15:59,293 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 138 transitions. Word has length 29 [2021-08-26 02:15:59,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:15:59,294 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 138 transitions. [2021-08-26 02:15:59,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:59,294 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 138 transitions. [2021-08-26 02:15:59,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-26 02:15:59,294 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:15:59,294 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:15:59,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-08-26 02:15:59,509 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-08-26 02:15:59,510 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-08-26 02:15:59,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:15:59,510 INFO L82 PathProgramCache]: Analyzing trace with hash -2133518130, now seen corresponding path program 1 times [2021-08-26 02:15:59,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:15:59,510 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565270994] [2021-08-26 02:15:59,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:15:59,511 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:15:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:15:59,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:15:59,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:15:59,664 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565270994] [2021-08-26 02:15:59,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565270994] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:15:59,664 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:15:59,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 02:15:59,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365405964] [2021-08-26 02:15:59,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 02:15:59,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:15:59,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 02:15:59,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-26 02:15:59,666 INFO L87 Difference]: Start difference. First operand 118 states and 138 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:59,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:15:59,800 INFO L93 Difference]: Finished difference Result 161 states and 180 transitions. [2021-08-26 02:15:59,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 02:15:59,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-08-26 02:15:59,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:15:59,801 INFO L225 Difference]: With dead ends: 161 [2021-08-26 02:15:59,801 INFO L226 Difference]: Without dead ends: 141 [2021-08-26 02:15:59,802 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 49.8ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-08-26 02:15:59,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-08-26 02:15:59,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 117. [2021-08-26 02:15:59,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.2142857142857142) internal successors, (136), 116 states have internal predecessors, (136), 0 states have call successors, (0), 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-08-26 02:15:59,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2021-08-26 02:15:59,806 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 29 [2021-08-26 02:15:59,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:15:59,806 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2021-08-26 02:15:59,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:15:59,806 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2021-08-26 02:15:59,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-26 02:15:59,807 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:15:59,807 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:15:59,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-26 02:15:59,807 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-08-26 02:15:59,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:15:59,808 INFO L82 PathProgramCache]: Analyzing trace with hash 830518973, now seen corresponding path program 1 times [2021-08-26 02:15:59,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:15:59,808 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18462814] [2021-08-26 02:15:59,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:15:59,808 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:15:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:15:59,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:15:59,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:15:59,883 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18462814] [2021-08-26 02:15:59,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18462814] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:15:59,883 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982714519] [2021-08-26 02:15:59,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:15:59,883 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:15:59,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 02:15:59,885 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-08-26 02:15:59,893 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-08-26 02:16:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:16:00,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-26 02:16:00,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 02:16:00,055 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-08-26 02:16:00,059 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-08-26 02:16:00,104 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-08-26 02:16:00,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-08-26 02:16:00,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-26 02:16:00,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-26 02:16:00,382 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-08-26 02:16:00,382 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 47 treesize of output 33 [2021-08-26 02:16:00,389 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-08-26 02:16:00,390 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 27 treesize of output 13 [2021-08-26 02:16:00,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-26 02:16:00,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982714519] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:16:00,410 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 02:16:00,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2021-08-26 02:16:00,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57240292] [2021-08-26 02:16:00,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 02:16:00,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:16:00,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 02:16:00,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-26 02:16:00,412 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:16:00,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:16:00,639 INFO L93 Difference]: Finished difference Result 223 states and 251 transitions. [2021-08-26 02:16:00,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-26 02:16:00,640 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-08-26 02:16:00,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:16:00,641 INFO L225 Difference]: With dead ends: 223 [2021-08-26 02:16:00,641 INFO L226 Difference]: Without dead ends: 180 [2021-08-26 02:16:00,642 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 91.9ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-08-26 02:16:00,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-08-26 02:16:00,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 134. [2021-08-26 02:16:00,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 129 states have (on average 1.248062015503876) internal successors, (161), 133 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:16:00,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 161 transitions. [2021-08-26 02:16:00,649 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 161 transitions. Word has length 32 [2021-08-26 02:16:00,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:16:00,649 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 161 transitions. [2021-08-26 02:16:00,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:16:00,649 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 161 transitions. [2021-08-26 02:16:00,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-26 02:16:00,650 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:16:00,650 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:16:00,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-26 02:16:00,864 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,SelfDestructingSolverStorable16 [2021-08-26 02:16:00,865 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-08-26 02:16:00,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:16:00,865 INFO L82 PathProgramCache]: Analyzing trace with hash -60835504, now seen corresponding path program 1 times [2021-08-26 02:16:00,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:16:00,865 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486915173] [2021-08-26 02:16:00,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:16:00,866 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:16:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:16:00,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:16:00,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:16:00,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486915173] [2021-08-26 02:16:00,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486915173] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 02:16:00,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 02:16:00,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 02:16:00,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823092980] [2021-08-26 02:16:00,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 02:16:00,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:16:00,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 02:16:00,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 02:16:00,892 INFO L87 Difference]: Start difference. First operand 134 states and 161 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:16:00,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:16:00,906 INFO L93 Difference]: Finished difference Result 293 states and 360 transitions. [2021-08-26 02:16:00,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 02:16:00,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-08-26 02:16:00,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:16:00,907 INFO L225 Difference]: With dead ends: 293 [2021-08-26 02:16:00,907 INFO L226 Difference]: Without dead ends: 211 [2021-08-26 02:16:00,908 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 02:16:00,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-08-26 02:16:00,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 171. [2021-08-26 02:16:00,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 166 states have (on average 1.2469879518072289) internal successors, (207), 170 states have internal predecessors, (207), 0 states have call successors, (0), 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-08-26 02:16:00,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 207 transitions. [2021-08-26 02:16:00,913 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 207 transitions. Word has length 32 [2021-08-26 02:16:00,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:16:00,913 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 207 transitions. [2021-08-26 02:16:00,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:16:00,913 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 207 transitions. [2021-08-26 02:16:00,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-26 02:16:00,914 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:16:00,914 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:16:00,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-26 02:16:00,914 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-08-26 02:16:00,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:16:00,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1562646056, now seen corresponding path program 1 times [2021-08-26 02:16:00,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:16:00,915 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122355833] [2021-08-26 02:16:00,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:16:00,915 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:16:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:16:01,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:16:01,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 02:16:01,031 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122355833] [2021-08-26 02:16:01,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122355833] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:16:01,031 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669702069] [2021-08-26 02:16:01,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:16:01,031 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:16:01,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 02:16:01,032 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-08-26 02:16:01,033 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-08-26 02:16:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 02:16:01,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 23 conjunts are in the unsatisfiable core [2021-08-26 02:16:01,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 02:16:01,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-08-26 02:16:01,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-26 02:16:01,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-26 02:16:01,396 INFO L354 Elim1Store]: treesize reduction 76, result has 24.8 percent of original size [2021-08-26 02:16:01,397 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 2 case distinctions, treesize of input 76 treesize of output 74 [2021-08-26 02:16:01,420 INFO L354 Elim1Store]: treesize reduction 84, result has 16.8 percent of original size [2021-08-26 02:16:01,421 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 2 case distinctions, treesize of input 71 treesize of output 61 [2021-08-26 02:16:01,463 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-26 02:16:01,463 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-08-26 02:16:01,730 INFO L354 Elim1Store]: treesize reduction 118, result has 16.9 percent of original size [2021-08-26 02:16:01,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 85 [2021-08-26 02:16:01,758 INFO L354 Elim1Store]: treesize reduction 146, result has 16.1 percent of original size [2021-08-26 02:16:01,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 94 [2021-08-26 02:16:03,189 INFO L354 Elim1Store]: treesize reduction 70, result has 1.4 percent of original size [2021-08-26 02:16:03,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 60 [2021-08-26 02:16:03,197 INFO L354 Elim1Store]: treesize reduction 70, result has 1.4 percent of original size [2021-08-26 02:16:03,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 26 [2021-08-26 02:16:03,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 02:16:03,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669702069] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-26 02:16:03,215 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 02:16:03,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2021-08-26 02:16:03,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465760707] [2021-08-26 02:16:03,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 02:16:03,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 02:16:03,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 02:16:03,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=116, Unknown=1, NotChecked=0, Total=156 [2021-08-26 02:16:03,218 INFO L87 Difference]: Start difference. First operand 171 states and 207 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:16:16,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 02:16:16,467 INFO L93 Difference]: Finished difference Result 479 states and 569 transitions. [2021-08-26 02:16:16,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-26 02:16:16,467 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-08-26 02:16:16,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 02:16:16,468 INFO L225 Difference]: With dead ends: 479 [2021-08-26 02:16:16,468 INFO L226 Difference]: Without dead ends: 387 [2021-08-26 02:16:16,469 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 4367.3ms TimeCoverageRelationStatistics Valid=219, Invalid=647, Unknown=4, NotChecked=0, Total=870 [2021-08-26 02:16:16,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-08-26 02:16:16,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 205. [2021-08-26 02:16:16,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 200 states have (on average 1.235) internal successors, (247), 204 states have internal predecessors, (247), 0 states have call successors, (0), 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-08-26 02:16:16,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 247 transitions. [2021-08-26 02:16:16,476 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 247 transitions. Word has length 36 [2021-08-26 02:16:16,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 02:16:16,476 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 247 transitions. [2021-08-26 02:16:16,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 02:16:16,476 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 247 transitions. [2021-08-26 02:16:16,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-26 02:16:16,477 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 02:16:16,477 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 02:16:16,494 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-08-26 02:16:16,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 02:16:16,693 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-08-26 02:16:16,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 02:16:16,693 INFO L82 PathProgramCache]: Analyzing trace with hash -648373053, now seen corresponding path program 1 times [2021-08-26 02:16:16,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 02:16:16,693 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471247152] [2021-08-26 02:16:16,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 02:16:16,694 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 02:16:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 02:16:16,704 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 02:16:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 02:16:16,730 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-26 02:16:16,730 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 02:16:16,731 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 02:16:16,732 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 02:16:16,732 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 02:16:16,732 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 02:16:16,733 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 02:16:16,733 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 02:16:16,733 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 02:16:16,733 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 02:16:16,733 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 02:16:16,733 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 02:16:16,734 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 02:16:16,734 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 02:16:16,734 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 02:16:16,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-26 02:16:16,739 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 02:16:16,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 02:16:16 BoogieIcfgContainer [2021-08-26 02:16:16,776 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 02:16:16,776 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 02:16:16,776 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 02:16:16,776 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 02:16:16,777 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:15:55" (3/4) ... [2021-08-26 02:16:16,778 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-26 02:16:16,813 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 02:16:16,814 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 02:16:16,814 INFO L168 Benchmark]: Toolchain (without parser) took 21880.70 ms. Allocated memory was 54.5 MB in the beginning and 182.5 MB in the end (delta: 127.9 MB). Free memory was 32.7 MB in the beginning and 61.2 MB in the end (delta: -28.6 MB). Peak memory consumption was 98.5 MB. Max. memory is 16.1 GB. [2021-08-26 02:16:16,814 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 54.5 MB. Free memory was 36.9 MB in the beginning and 36.8 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 02:16:16,815 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.20 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 32.4 MB in the beginning and 42.3 MB in the end (delta: -9.9 MB). Peak memory consumption was 10.2 MB. Max. memory is 16.1 GB. [2021-08-26 02:16:16,815 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.26 ms. Allocated memory is still 67.1 MB. Free memory was 42.1 MB in the beginning and 39.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 02:16:16,815 INFO L168 Benchmark]: Boogie Preprocessor took 25.21 ms. Allocated memory is still 67.1 MB. Free memory was 39.8 MB in the beginning and 37.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 02:16:16,815 INFO L168 Benchmark]: RCFGBuilder took 432.45 ms. Allocated memory is still 67.1 MB. Free memory was 37.8 MB in the beginning and 34.1 MB in the end (delta: 3.6 MB). Peak memory consumption was 8.8 MB. Max. memory is 16.1 GB. [2021-08-26 02:16:16,816 INFO L168 Benchmark]: TraceAbstraction took 20968.81 ms. Allocated memory was 67.1 MB in the beginning and 182.5 MB in the end (delta: 115.3 MB). Free memory was 33.5 MB in the beginning and 64.4 MB in the end (delta: -30.9 MB). Peak memory consumption was 83.7 MB. Max. memory is 16.1 GB. [2021-08-26 02:16:16,816 INFO L168 Benchmark]: Witness Printer took 37.61 ms. Allocated memory is still 182.5 MB. Free memory was 64.4 MB in the beginning and 61.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 02:16:16,820 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 54.5 MB. Free memory was 36.9 MB in the beginning and 36.8 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 379.20 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 32.4 MB in the beginning and 42.3 MB in the end (delta: -9.9 MB). Peak memory consumption was 10.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 31.26 ms. Allocated memory is still 67.1 MB. Free memory was 42.1 MB in the beginning and 39.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 25.21 ms. Allocated memory is still 67.1 MB. Free memory was 39.8 MB in the beginning and 37.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 432.45 ms. Allocated memory is still 67.1 MB. Free memory was 37.8 MB in the beginning and 34.1 MB in the end (delta: 3.6 MB). Peak memory consumption was 8.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 20968.81 ms. Allocated memory was 67.1 MB in the beginning and 182.5 MB in the end (delta: 115.3 MB). Free memory was 33.5 MB in the beginning and 64.4 MB in the end (delta: -30.9 MB). Peak memory consumption was 83.7 MB. Max. memory is 16.1 GB. * Witness Printer took 37.61 ms. Allocated memory is still 182.5 MB. Free memory was 64.4 MB in the beginning and 61.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1036]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1002] SLL* list = malloc(sizeof(SLL)); [L1003] list->next = ((void*)0) [L1004] COND FALSE !(!(list != ((void*)0))) [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1004] list->inner = malloc(sizeof(SLL)) [L1004] EXPR list->inner [L1004] list->inner->next = ((void*)0) [L1004] EXPR list->inner [L1004] list->inner->inner = ((void*)0) [L1004] EXPR list->inner [L1004] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) [L1004] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1006] SLL* end = list; [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1019] end = ((void*)0) [L1020] end = list [L1023] COND FALSE !(!(((void*)0) != end)) [L1025] COND TRUE ((void*)0) != end [L1027] int len = 0; [L1028] EXPR end->inner [L1028] SLL* inner = end->inner; [L1029] COND TRUE ((void*)0) != inner [L1031] COND TRUE len == 0 [L1032] len = 1 [L1035] COND FALSE !(!(((void*)0) != inner)) [L1036] EXPR inner->inner [L1036] COND FALSE !(!(((void*)0) == inner->inner)) [L1037] EXPR inner->next [L1037] COND FALSE !(!(((void*)0) == inner->next)) [L1038] EXPR inner->inner [L1038] inner = inner->inner [L1039] COND TRUE len == 1 [L1040] EXPR inner->inner [L1040] inner = inner->inner [L1029] COND TRUE ((void*)0) != inner [L1031] COND FALSE !(len == 0) [L1034] len = 2 [L1035] COND FALSE !(!(((void*)0) != inner)) [L1036] EXPR inner->inner [L1036] COND TRUE !(((void*)0) == inner->inner) [L1036] reach_error() - UnprovableResult [Line: 1004]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1054]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 20894.5ms, OverallIterations: 20, TraceHistogramMax: 2, EmptinessCheckTime: 17.4ms, AutomataDifference: 15256.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1437 SDtfs, 1895 SDslu, 2821 SDs, 0 SdLazy, 1641 SolverSat, 184 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 10791.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 231 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 5062.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=205occurred in iteration=19, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 123.8ms AutomataMinimizationTime, 19 MinimizatonAttempts, 827 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 74.3ms SsaConstructionTime, 233.9ms SatisfiabilityAnalysisTime, 3990.5ms InterpolantComputationTime, 553 NumberOfCodeBlocks, 553 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 495 ConstructedInterpolants, 16 QuantifiedInterpolants, 6683 SizeOfPredicates, 16 NumberOfNonLiveVariables, 361 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 9/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-26 02:16:16,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...