./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 c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/sll-01-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 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 08:22:52,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 08:22:52,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 08:22:52,301 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 08:22:52,306 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 08:22:52,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 08:22:52,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 08:22:52,309 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 08:22:52,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 08:22:52,310 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 08:22:52,311 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 08:22:52,312 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 08:22:52,312 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 08:22:52,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 08:22:52,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 08:22:52,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 08:22:52,315 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 08:22:52,316 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 08:22:52,317 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 08:22:52,318 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 08:22:52,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 08:22:52,319 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 08:22:52,320 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 08:22:52,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 08:22:52,322 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 08:22:52,323 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 08:22:52,323 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 08:22:52,323 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 08:22:52,324 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 08:22:52,324 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 08:22:52,325 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 08:22:52,325 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 08:22:52,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 08:22:52,326 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 08:22:52,327 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 08:22:52,327 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 08:22:52,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 08:22:52,328 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 08:22:52,328 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 08:22:52,329 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 08:22:52,329 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 08:22:52,332 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 08:22:52,348 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 08:22:52,349 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 08:22:52,350 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 08:22:52,350 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 08:22:52,351 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 08:22:52,351 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 08:22:52,351 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 08:22:52,352 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 08:22:52,352 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 08:22:52,352 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 08:22:52,353 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 08:22:52,353 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 08:22:52,353 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 08:22:52,353 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 08:22:52,353 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 08:22:52,353 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 08:22:52,353 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 08:22:52,354 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 08:22:52,354 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 08:22:52,354 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 08:22:52,354 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 08:22:52,354 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 08:22:52,354 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 08:22:52,355 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 08:22:52,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 08:22:52,355 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 08:22:52,355 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 08:22:52,355 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 08:22:52,355 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 08:22:52,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 08:22:52,356 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 08:22:52,356 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 08:22:52,356 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 08:22:52,356 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 08:22:52,356 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 -> 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a [2021-12-17 08:22:52,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 08:22:52,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 08:22:52,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 08:22:52,586 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 08:22:52,586 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 08:22:52,587 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-12-17 08:22:52,639 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88822107a/275164dfaa2643178e3e7245cc532994/FLAGb1122c0b4 [2021-12-17 08:22:53,057 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 08:22:53,058 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i [2021-12-17 08:22:53,068 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88822107a/275164dfaa2643178e3e7245cc532994/FLAGb1122c0b4 [2021-12-17 08:22:53,420 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88822107a/275164dfaa2643178e3e7245cc532994 [2021-12-17 08:22:53,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 08:22:53,423 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 08:22:53,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 08:22:53,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 08:22:53,427 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 08:22:53,428 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 08:22:53" (1/1) ... [2021-12-17 08:22:53,428 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b40478e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:22:53, skipping insertion in model container [2021-12-17 08:22:53,429 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 08:22:53" (1/1) ... [2021-12-17 08:22:53,435 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 08:22:53,472 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 08:22:53,639 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2021-12-17 08:22:53,643 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2021-12-17 08:22:53,645 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2021-12-17 08:22:53,645 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2021-12-17 08:22:53,647 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2021-12-17 08:22:53,648 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2021-12-17 08:22:53,649 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2021-12-17 08:22:53,651 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2021-12-17 08:22:53,651 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2021-12-17 08:22:53,652 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2021-12-17 08:22:53,653 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2021-12-17 08:22:53,654 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2021-12-17 08:22:53,654 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2021-12-17 08:22:53,657 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 08:22:53,661 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 08:22:53,681 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2021-12-17 08:22:53,683 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2021-12-17 08:22:53,684 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2021-12-17 08:22:53,684 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2021-12-17 08:22:53,685 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2021-12-17 08:22:53,686 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2021-12-17 08:22:53,687 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2021-12-17 08:22:53,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2021-12-17 08:22:53,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2021-12-17 08:22:53,689 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2021-12-17 08:22:53,690 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2021-12-17 08:22:53,690 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2021-12-17 08:22:53,691 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2021-12-17 08:22:53,692 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 08:22:53,708 INFO L208 MainTranslator]: Completed translation [2021-12-17 08:22:53,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:22:53 WrapperNode [2021-12-17 08:22:53,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 08:22:53,710 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 08:22:53,710 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 08:22:53,710 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 08:22:53,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:22:53" (1/1) ... [2021-12-17 08:22:53,728 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:22:53" (1/1) ... [2021-12-17 08:22:53,748 INFO L137 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 225 [2021-12-17 08:22:53,751 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 08:22:53,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 08:22:53,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 08:22:53,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 08:22:53,757 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:22:53" (1/1) ... [2021-12-17 08:22:53,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:22:53" (1/1) ... [2021-12-17 08:22:53,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:22:53" (1/1) ... [2021-12-17 08:22:53,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:22:53" (1/1) ... [2021-12-17 08:22:53,766 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:22:53" (1/1) ... [2021-12-17 08:22:53,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:22:53" (1/1) ... [2021-12-17 08:22:53,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:22:53" (1/1) ... [2021-12-17 08:22:53,774 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 08:22:53,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 08:22:53,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 08:22:53,775 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 08:22:53,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:22:53" (1/1) ... [2021-12-17 08:22:53,790 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 08:22:53,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:22:53,819 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 08:22:53,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 08:22:53,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 08:22:53,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 08:22:53,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-17 08:22:53,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-17 08:22:53,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 08:22:53,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 08:22:53,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 08:22:53,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 08:22:53,943 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 08:22:53,945 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 08:22:54,177 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 08:22:54,182 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 08:22:54,182 INFO L301 CfgBuilder]: Removed 30 assume(true) statements. [2021-12-17 08:22:54,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 08:22:54 BoogieIcfgContainer [2021-12-17 08:22:54,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 08:22:54,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 08:22:54,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 08:22:54,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 08:22:54,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 08:22:53" (1/3) ... [2021-12-17 08:22:54,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9be90d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 08:22:54, skipping insertion in model container [2021-12-17 08:22:54,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:22:53" (2/3) ... [2021-12-17 08:22:54,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9be90d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 08:22:54, skipping insertion in model container [2021-12-17 08:22:54,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 08:22:54" (3/3) ... [2021-12-17 08:22:54,191 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2021-12-17 08:22:54,195 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 08:22:54,195 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2021-12-17 08:22:54,225 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 08:22:54,236 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 08:22:54,236 INFO L340 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2021-12-17 08:22:54,248 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-12-17 08:22:54,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-17 08:22:54,252 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:22:54,253 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-17 08:22:54,253 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:22:54,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:22:54,266 INFO L85 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2021-12-17 08:22:54,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:22:54,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057518361] [2021-12-17 08:22:54,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:22:54,275 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:22:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:22:54,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:22:54,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:22:54,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057518361] [2021-12-17 08:22:54,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057518361] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:22:54,421 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:22:54,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 08:22:54,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944603864] [2021-12-17 08:22:54,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:22:54,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 08:22:54,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:22:54,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 08:22:54,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:22:54,450 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-12-17 08:22:54,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:22:54,513 INFO L93 Difference]: Finished difference Result 182 states and 300 transitions. [2021-12-17 08:22:54,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 08:22:54,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-12-17 08:22:54,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:22:54,523 INFO L225 Difference]: With dead ends: 182 [2021-12-17 08:22:54,523 INFO L226 Difference]: Without dead ends: 96 [2021-12-17 08:22:54,526 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:22:54,530 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 85 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:22:54,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 104 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:22:54,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-17 08:22:54,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2021-12-17 08:22:54,562 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-12-17 08:22:54,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2021-12-17 08:22:54,564 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 4 [2021-12-17 08:22:54,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:22:54,564 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2021-12-17 08:22:54,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:22:54,565 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2021-12-17 08:22:54,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-17 08:22:54,565 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:22:54,565 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:22:54,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 08:22:54,566 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:22:54,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:22:54,566 INFO L85 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2021-12-17 08:22:54,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:22:54,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479351437] [2021-12-17 08:22:54,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:22:54,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:22:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:22:54,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:22:54,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:22:54,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479351437] [2021-12-17 08:22:54,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479351437] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:22:54,614 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:22:54,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 08:22:54,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507746114] [2021-12-17 08:22:54,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:22:54,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 08:22:54,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:22:54,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 08:22:54,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:22:54,617 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-12-17 08:22:54,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:22:54,627 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2021-12-17 08:22:54,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 08:22:54,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-17 08:22:54,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:22:54,631 INFO L225 Difference]: With dead ends: 81 [2021-12-17 08:22:54,631 INFO L226 Difference]: Without dead ends: 79 [2021-12-17 08:22:54,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:22:54,632 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:22:54,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:22:54,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-12-17 08:22:54,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2021-12-17 08:22:54,637 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-12-17 08:22:54,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2021-12-17 08:22:54,638 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 10 [2021-12-17 08:22:54,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:22:54,639 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2021-12-17 08:22:54,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:22:54,639 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2021-12-17 08:22:54,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-17 08:22:54,639 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:22:54,639 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:22:54,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 08:22:54,640 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:22:54,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:22:54,640 INFO L85 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2021-12-17 08:22:54,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:22:54,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328391916] [2021-12-17 08:22:54,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:22:54,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:22:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:22:54,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:22:54,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:22:54,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328391916] [2021-12-17 08:22:54,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328391916] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:22:54,730 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:22:54,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 08:22:54,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666506196] [2021-12-17 08:22:54,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:22:54,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 08:22:54,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:22:54,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 08:22:54,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 08:22:54,732 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-12-17 08:22:54,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:22:54,799 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2021-12-17 08:22:54,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 08:22:54,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-17 08:22:54,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:22:54,803 INFO L225 Difference]: With dead ends: 80 [2021-12-17 08:22:54,803 INFO L226 Difference]: Without dead ends: 78 [2021-12-17 08:22:54,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 08:22:54,806 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:22:54,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 144 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:22:54,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-17 08:22:54,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2021-12-17 08:22:54,815 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-12-17 08:22:54,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2021-12-17 08:22:54,820 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 10 [2021-12-17 08:22:54,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:22:54,820 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2021-12-17 08:22:54,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:22:54,821 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2021-12-17 08:22:54,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-17 08:22:54,822 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:22:54,822 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:22:54,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 08:22:54,823 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:22:54,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:22:54,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1712619113, now seen corresponding path program 1 times [2021-12-17 08:22:54,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:22:54,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408185683] [2021-12-17 08:22:54,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:22:54,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:22:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:22:54,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:22:54,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:22:54,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408185683] [2021-12-17 08:22:54,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408185683] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:22:54,873 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:22:54,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 08:22:54,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830257621] [2021-12-17 08:22:54,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:22:54,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 08:22:54,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:22:54,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 08:22:54,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:22:54,884 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-12-17 08:22:54,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:22:54,918 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2021-12-17 08:22:54,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 08:22:54,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-17 08:22:54,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:22:54,920 INFO L225 Difference]: With dead ends: 79 [2021-12-17 08:22:54,921 INFO L226 Difference]: Without dead ends: 75 [2021-12-17 08:22:54,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:22:54,923 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 16 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:22:54,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 129 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:22:54,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-12-17 08:22:54,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2021-12-17 08:22:54,939 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-12-17 08:22:54,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2021-12-17 08:22:54,939 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 15 [2021-12-17 08:22:54,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:22:54,940 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2021-12-17 08:22:54,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:22:54,940 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2021-12-17 08:22:54,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-17 08:22:54,941 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:22:54,941 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:22:54,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 08:22:54,941 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:22:54,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:22:54,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1551589151, now seen corresponding path program 1 times [2021-12-17 08:22:54,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:22:54,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367417816] [2021-12-17 08:22:54,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:22:54,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:22:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:22:54,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:22:54,983 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:22:54,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367417816] [2021-12-17 08:22:54,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367417816] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:22:54,984 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:22:54,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 08:22:54,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846527540] [2021-12-17 08:22:54,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:22:54,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 08:22:54,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:22:54,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 08:22:54,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 08:22:54,989 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-12-17 08:22:55,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:22:55,053 INFO L93 Difference]: Finished difference Result 190 states and 215 transitions. [2021-12-17 08:22:55,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 08:22:55,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-17 08:22:55,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:22:55,055 INFO L225 Difference]: With dead ends: 190 [2021-12-17 08:22:55,055 INFO L226 Difference]: Without dead ends: 126 [2021-12-17 08:22:55,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 08:22:55,056 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 57 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:22:55,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 190 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 08:22:55,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-12-17 08:22:55,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 74. [2021-12-17 08:22:55,069 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-12-17 08:22:55,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2021-12-17 08:22:55,070 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 16 [2021-12-17 08:22:55,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:22:55,070 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2021-12-17 08:22:55,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:22:55,071 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2021-12-17 08:22:55,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-17 08:22:55,071 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:22:55,072 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:22:55,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 08:22:55,072 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:22:55,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:22:55,073 INFO L85 PathProgramCache]: Analyzing trace with hash -2063319775, now seen corresponding path program 1 times [2021-12-17 08:22:55,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:22:55,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144580414] [2021-12-17 08:22:55,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:22:55,074 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:22:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:22:55,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:22:55,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:22:55,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144580414] [2021-12-17 08:22:55,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144580414] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:22:55,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:22:55,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 08:22:55,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159162599] [2021-12-17 08:22:55,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:22:55,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 08:22:55,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:22:55,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 08:22:55,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 08:22:55,128 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-12-17 08:22:55,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:22:55,176 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2021-12-17 08:22:55,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 08:22:55,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-17 08:22:55,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:22:55,177 INFO L225 Difference]: With dead ends: 134 [2021-12-17 08:22:55,177 INFO L226 Difference]: Without dead ends: 114 [2021-12-17 08:22:55,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 08:22:55,178 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 134 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:22:55,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 120 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:22:55,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-17 08:22:55,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 73. [2021-12-17 08:22:55,182 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-12-17 08:22:55,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2021-12-17 08:22:55,182 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 16 [2021-12-17 08:22:55,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:22:55,183 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2021-12-17 08:22:55,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:22:55,184 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2021-12-17 08:22:55,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-17 08:22:55,184 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:22:55,184 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:22:55,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-17 08:22:55,185 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:22:55,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:22:55,185 INFO L85 PathProgramCache]: Analyzing trace with hash -940628020, now seen corresponding path program 1 times [2021-12-17 08:22:55,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:22:55,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561434643] [2021-12-17 08:22:55,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:22:55,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:22:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:22:55,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:22:55,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:22:55,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561434643] [2021-12-17 08:22:55,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561434643] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:22:55,215 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:22:55,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 08:22:55,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477856923] [2021-12-17 08:22:55,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:22:55,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 08:22:55,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:22:55,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 08:22:55,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:22:55,216 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-12-17 08:22:55,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:22:55,226 INFO L93 Difference]: Finished difference Result 139 states and 159 transitions. [2021-12-17 08:22:55,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 08:22:55,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-17 08:22:55,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:22:55,227 INFO L225 Difference]: With dead ends: 139 [2021-12-17 08:22:55,227 INFO L226 Difference]: Without dead ends: 97 [2021-12-17 08:22:55,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:22:55,229 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 24 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:22:55,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 151 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:22:55,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-17 08:22:55,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2021-12-17 08:22:55,232 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-12-17 08:22:55,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2021-12-17 08:22:55,232 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 20 [2021-12-17 08:22:55,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:22:55,232 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2021-12-17 08:22:55,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:22:55,233 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2021-12-17 08:22:55,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-17 08:22:55,233 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:22:55,233 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:22:55,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-17 08:22:55,233 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:22:55,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:22:55,234 INFO L85 PathProgramCache]: Analyzing trace with hash 905291998, now seen corresponding path program 1 times [2021-12-17 08:22:55,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:22:55,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265552674] [2021-12-17 08:22:55,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:22:55,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:22:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:22:55,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:22:55,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:22:55,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265552674] [2021-12-17 08:22:55,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265552674] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:22:55,264 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:22:55,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 08:22:55,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136098175] [2021-12-17 08:22:55,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:22:55,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 08:22:55,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:22:55,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 08:22:55,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:22:55,266 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-12-17 08:22:55,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:22:55,276 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2021-12-17 08:22:55,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 08:22:55,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-17 08:22:55,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:22:55,277 INFO L225 Difference]: With dead ends: 76 [2021-12-17 08:22:55,277 INFO L226 Difference]: Without dead ends: 74 [2021-12-17 08:22:55,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:22:55,278 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 13 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:22:55,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 132 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:22:55,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-12-17 08:22:55,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-12-17 08:22:55,281 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-12-17 08:22:55,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2021-12-17 08:22:55,282 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 21 [2021-12-17 08:22:55,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:22:55,282 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2021-12-17 08:22:55,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:22:55,282 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2021-12-17 08:22:55,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-17 08:22:55,283 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:22:55,283 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:22:55,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-17 08:22:55,283 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:22:55,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:22:55,283 INFO L85 PathProgramCache]: Analyzing trace with hash 886650935, now seen corresponding path program 1 times [2021-12-17 08:22:55,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:22:55,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223333795] [2021-12-17 08:22:55,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:22:55,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:22:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:22:55,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:22:55,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:22:55,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223333795] [2021-12-17 08:22:55,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223333795] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:22:55,359 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:22:55,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 08:22:55,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490262323] [2021-12-17 08:22:55,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:22:55,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 08:22:55,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:22:55,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 08:22:55,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 08:22:55,360 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-12-17 08:22:55,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:22:55,403 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2021-12-17 08:22:55,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 08:22:55,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-17 08:22:55,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:22:55,404 INFO L225 Difference]: With dead ends: 75 [2021-12-17 08:22:55,404 INFO L226 Difference]: Without dead ends: 73 [2021-12-17 08:22:55,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 08:22:55,405 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:22:55,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 116 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:22:55,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-17 08:22:55,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2021-12-17 08:22:55,407 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-12-17 08:22:55,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2021-12-17 08:22:55,407 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 23 [2021-12-17 08:22:55,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:22:55,407 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2021-12-17 08:22:55,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:22:55,407 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2021-12-17 08:22:55,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-17 08:22:55,408 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:22:55,408 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:22:55,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-17 08:22:55,408 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:22:55,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:22:55,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1458355201, now seen corresponding path program 1 times [2021-12-17 08:22:55,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:22:55,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401829198] [2021-12-17 08:22:55,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:22:55,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:22:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:22:55,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:22:55,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:22:55,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401829198] [2021-12-17 08:22:55,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401829198] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:22:55,486 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:22:55,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 08:22:55,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071379614] [2021-12-17 08:22:55,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:22:55,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 08:22:55,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:22:55,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 08:22:55,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-17 08:22:55,487 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-12-17 08:22:55,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:22:55,628 INFO L93 Difference]: Finished difference Result 178 states and 205 transitions. [2021-12-17 08:22:55,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 08:22:55,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-17 08:22:55,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:22:55,630 INFO L225 Difference]: With dead ends: 178 [2021-12-17 08:22:55,630 INFO L226 Difference]: Without dead ends: 135 [2021-12-17 08:22:55,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-12-17 08:22:55,633 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 117 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:22:55,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 290 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 08:22:55,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-12-17 08:22:55,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 82. [2021-12-17 08:22:55,636 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-12-17 08:22:55,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2021-12-17 08:22:55,636 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 24 [2021-12-17 08:22:55,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:22:55,637 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2021-12-17 08:22:55,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:22:55,637 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2021-12-17 08:22:55,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-17 08:22:55,639 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:22:55,639 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:22:55,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-17 08:22:55,640 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:22:55,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:22:55,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1357759361, now seen corresponding path program 1 times [2021-12-17 08:22:55,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:22:55,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223376702] [2021-12-17 08:22:55,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:22:55,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:22:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:22:55,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:22:55,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:22:55,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223376702] [2021-12-17 08:22:55,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223376702] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:22:55,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:22:55,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 08:22:55,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499714011] [2021-12-17 08:22:55,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:22:55,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 08:22:55,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:22:55,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 08:22:55,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 08:22:55,811 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-12-17 08:22:56,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:22:56,089 INFO L93 Difference]: Finished difference Result 237 states and 265 transitions. [2021-12-17 08:22:56,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 08:22:56,089 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-17 08:22:56,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:22:56,091 INFO L225 Difference]: With dead ends: 237 [2021-12-17 08:22:56,091 INFO L226 Difference]: Without dead ends: 235 [2021-12-17 08:22:56,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-12-17 08:22:56,092 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 253 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 08:22:56,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 426 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 08:22:56,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-12-17 08:22:56,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 94. [2021-12-17 08:22:56,096 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-12-17 08:22:56,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2021-12-17 08:22:56,096 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 24 [2021-12-17 08:22:56,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:22:56,096 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2021-12-17 08:22:56,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:22:56,096 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2021-12-17 08:22:56,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-17 08:22:56,097 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:22:56,097 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:22:56,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-17 08:22:56,097 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:22:56,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:22:56,098 INFO L85 PathProgramCache]: Analyzing trace with hash -545310703, now seen corresponding path program 1 times [2021-12-17 08:22:56,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:22:56,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116592186] [2021-12-17 08:22:56,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:22:56,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:22:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:22:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 08:22:56,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:22:56,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116592186] [2021-12-17 08:22:56,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116592186] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:22:56,142 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:22:56,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 08:22:56,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25587814] [2021-12-17 08:22:56,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:22:56,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 08:22:56,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:22:56,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 08:22:56,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-17 08:22:56,143 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-12-17 08:22:56,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:22:56,216 INFO L93 Difference]: Finished difference Result 141 states and 162 transitions. [2021-12-17 08:22:56,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 08:22:56,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-17 08:22:56,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:22:56,217 INFO L225 Difference]: With dead ends: 141 [2021-12-17 08:22:56,217 INFO L226 Difference]: Without dead ends: 123 [2021-12-17 08:22:56,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-17 08:22:56,218 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 61 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:22:56,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 193 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 08:22:56,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-17 08:22:56,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 115. [2021-12-17 08:22:56,222 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-12-17 08:22:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 137 transitions. [2021-12-17 08:22:56,222 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 137 transitions. Word has length 26 [2021-12-17 08:22:56,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:22:56,223 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 137 transitions. [2021-12-17 08:22:56,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:22:56,223 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 137 transitions. [2021-12-17 08:22:56,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-17 08:22:56,226 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:22:56,226 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:22:56,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-17 08:22:56,226 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:22:56,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:22:56,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1566334865, now seen corresponding path program 1 times [2021-12-17 08:22:56,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:22:56,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204650323] [2021-12-17 08:22:56,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:22:56,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:22:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:22:56,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 08:22:56,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:22:56,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204650323] [2021-12-17 08:22:56,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204650323] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:22:56,269 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:22:56,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 08:22:56,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529094170] [2021-12-17 08:22:56,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:22:56,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 08:22:56,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:22:56,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 08:22:56,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:22:56,271 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-12-17 08:22:56,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:22:56,298 INFO L93 Difference]: Finished difference Result 115 states and 137 transitions. [2021-12-17 08:22:56,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 08:22:56,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-17 08:22:56,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:22:56,299 INFO L225 Difference]: With dead ends: 115 [2021-12-17 08:22:56,299 INFO L226 Difference]: Without dead ends: 113 [2021-12-17 08:22:56,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:22:56,300 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 51 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:22:56,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 78 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:22:56,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-17 08:22:56,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2021-12-17 08:22:56,303 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-12-17 08:22:56,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 135 transitions. [2021-12-17 08:22:56,304 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 135 transitions. Word has length 26 [2021-12-17 08:22:56,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:22:56,304 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 135 transitions. [2021-12-17 08:22:56,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:22:56,304 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 135 transitions. [2021-12-17 08:22:56,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-17 08:22:56,304 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:22:56,304 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:22:56,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-17 08:22:56,305 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:22:56,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:22:56,305 INFO L85 PathProgramCache]: Analyzing trace with hash -988757936, now seen corresponding path program 1 times [2021-12-17 08:22:56,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:22:56,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366195697] [2021-12-17 08:22:56,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:22:56,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:22:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:22:56,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:22:56,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:22:56,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366195697] [2021-12-17 08:22:56,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366195697] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:22:56,411 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:22:56,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 08:22:56,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226426616] [2021-12-17 08:22:56,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:22:56,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 08:22:56,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:22:56,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 08:22:56,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 08:22:56,412 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-12-17 08:22:56,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:22:56,653 INFO L93 Difference]: Finished difference Result 273 states and 318 transitions. [2021-12-17 08:22:56,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 08:22:56,653 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-17 08:22:56,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:22:56,654 INFO L225 Difference]: With dead ends: 273 [2021-12-17 08:22:56,654 INFO L226 Difference]: Without dead ends: 271 [2021-12-17 08:22:56,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-12-17 08:22:56,655 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 258 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 08:22:56,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 390 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 08:22:56,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-12-17 08:22:56,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 116. [2021-12-17 08:22:56,660 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-12-17 08:22:56,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 138 transitions. [2021-12-17 08:22:56,661 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 138 transitions. Word has length 27 [2021-12-17 08:22:56,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:22:56,661 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 138 transitions. [2021-12-17 08:22:56,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:22:56,661 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 138 transitions. [2021-12-17 08:22:56,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-17 08:22:56,662 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:22:56,662 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:22:56,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-17 08:22:56,662 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:22:56,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:22:56,663 INFO L85 PathProgramCache]: Analyzing trace with hash 2026653164, now seen corresponding path program 1 times [2021-12-17 08:22:56,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:22:56,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419036382] [2021-12-17 08:22:56,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:22:56,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:22:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:22:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:22:56,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:22:56,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419036382] [2021-12-17 08:22:56,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419036382] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:22:56,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113803577] [2021-12-17 08:22:56,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:22:56,724 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:22:56,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:22:56,725 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 08:22:56,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 08:22:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:22:56,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-17 08:22:56,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:22:56,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 08:22:56,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 08:22:56,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:22:56,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-17 08:22:56,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:22:56,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-17 08:22:57,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 08:22:57,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 08:22:57,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:22:57,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:22:57,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:22:57,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113803577] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 08:22:57,220 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 08:22:57,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2021-12-17 08:22:57,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545753903] [2021-12-17 08:22:57,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 08:22:57,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 08:22:57,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:22:57,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 08:22:57,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-17 08:22:57,221 INFO L87 Difference]: Start difference. First operand 116 states and 138 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:22:57,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:22:57,329 INFO L93 Difference]: Finished difference Result 203 states and 237 transitions. [2021-12-17 08:22:57,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 08:22:57,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-17 08:22:57,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:22:57,330 INFO L225 Difference]: With dead ends: 203 [2021-12-17 08:22:57,331 INFO L226 Difference]: Without dead ends: 141 [2021-12-17 08:22:57,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-17 08:22:57,331 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 112 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:22:57,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 222 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 08:22:57,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-17 08:22:57,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 118. [2021-12-17 08:22:57,335 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-12-17 08:22:57,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 138 transitions. [2021-12-17 08:22:57,336 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 138 transitions. Word has length 29 [2021-12-17 08:22:57,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:22:57,336 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 138 transitions. [2021-12-17 08:22:57,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:22:57,337 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 138 transitions. [2021-12-17 08:22:57,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-17 08:22:57,337 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:22:57,337 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:22:57,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 08:22:57,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-17 08:22:57,548 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:22:57,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:22:57,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2133518130, now seen corresponding path program 1 times [2021-12-17 08:22:57,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:22:57,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214635381] [2021-12-17 08:22:57,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:22:57,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:22:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:22:57,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-12-17 08:22:57,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:22:57,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214635381] [2021-12-17 08:22:57,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214635381] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:22:57,664 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:22:57,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 08:22:57,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269913873] [2021-12-17 08:22:57,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:22:57,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 08:22:57,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:22:57,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 08:22:57,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-17 08:22:57,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-12-17 08:22:57,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:22:57,804 INFO L93 Difference]: Finished difference Result 161 states and 180 transitions. [2021-12-17 08:22:57,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 08:22:57,805 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-17 08:22:57,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:22:57,805 INFO L225 Difference]: With dead ends: 161 [2021-12-17 08:22:57,805 INFO L226 Difference]: Without dead ends: 141 [2021-12-17 08:22:57,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-17 08:22:57,806 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 105 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:22:57,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 267 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 08:22:57,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-17 08:22:57,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 117. [2021-12-17 08:22:57,810 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-12-17 08:22:57,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2021-12-17 08:22:57,811 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 29 [2021-12-17 08:22:57,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:22:57,811 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2021-12-17 08:22:57,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:22:57,812 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2021-12-17 08:22:57,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-17 08:22:57,812 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:22:57,812 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:22:57,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-17 08:22:57,812 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-12-17 08:22:57,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:22:57,813 INFO L85 PathProgramCache]: Analyzing trace with hash 830518973, now seen corresponding path program 1 times [2021-12-17 08:22:57,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:22:57,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033113851] [2021-12-17 08:22:57,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:22:57,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:22:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:22:57,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:22:57,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:22:57,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033113851] [2021-12-17 08:22:57,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033113851] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:22:57,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767851004] [2021-12-17 08:22:57,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:22:57,882 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:22:57,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:22:57,883 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 08:22:57,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 08:22:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:22:57,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-17 08:22:57,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:22:57,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 08:22:57,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 08:22:58,002 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-17 08:22:58,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-17 08:22:58,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:22:58,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-17 08:22:58,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 08:22:58,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 08:22:58,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 08:22:58,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:22:58,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 08:22:58,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767851004] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 08:22:58,195 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 08:22:58,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2021-12-17 08:22:58,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393738883] [2021-12-17 08:22:58,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 08:22:58,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 08:22:58,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:22:58,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 08:22:58,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 08:22:58,197 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:22:58,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:22:58,320 INFO L93 Difference]: Finished difference Result 206 states and 233 transitions. [2021-12-17 08:22:58,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 08:22:58,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-17 08:22:58,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:22:58,321 INFO L225 Difference]: With dead ends: 206 [2021-12-17 08:22:58,321 INFO L226 Difference]: Without dead ends: 175 [2021-12-17 08:22:58,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-17 08:22:58,321 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 99 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:22:58,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 306 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 08:22:58,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-12-17 08:22:58,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 134. [2021-12-17 08:22:58,326 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-12-17 08:22:58,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 161 transitions. [2021-12-17 08:22:58,326 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 161 transitions. Word has length 32 [2021-12-17 08:22:58,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:22:58,326 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 161 transitions. [2021-12-17 08:22:58,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:22:58,327 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 161 transitions. [2021-12-17 08:22:58,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-17 08:22:58,327 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:22:58,327 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:22:58,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 08:22:58,531 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-12-17 08:22:58,532 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-12-17 08:22:58,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:22:58,532 INFO L85 PathProgramCache]: Analyzing trace with hash -60835504, now seen corresponding path program 1 times [2021-12-17 08:22:58,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:22:58,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852043584] [2021-12-17 08:22:58,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:22:58,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:22:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:22:58,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:22:58,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:22:58,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852043584] [2021-12-17 08:22:58,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852043584] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:22:58,574 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:22:58,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 08:22:58,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603778986] [2021-12-17 08:22:58,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:22:58,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 08:22:58,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:22:58,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 08:22:58,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:22:58,575 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-12-17 08:22:58,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:22:58,587 INFO L93 Difference]: Finished difference Result 293 states and 360 transitions. [2021-12-17 08:22:58,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 08:22:58,587 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-12-17 08:22:58,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:22:58,588 INFO L225 Difference]: With dead ends: 293 [2021-12-17 08:22:58,588 INFO L226 Difference]: Without dead ends: 211 [2021-12-17 08:22:58,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:22:58,589 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 26 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:22:58,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 161 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:22:58,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-12-17 08:22:58,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 171. [2021-12-17 08:22:58,594 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-12-17 08:22:58,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 207 transitions. [2021-12-17 08:22:58,595 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 207 transitions. Word has length 32 [2021-12-17 08:22:58,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:22:58,595 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 207 transitions. [2021-12-17 08:22:58,595 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-12-17 08:22:58,595 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 207 transitions. [2021-12-17 08:22:58,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-17 08:22:58,596 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:22:58,596 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:22:58,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-17 08:22:58,596 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:22:58,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:22:58,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1562646056, now seen corresponding path program 1 times [2021-12-17 08:22:58,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:22:58,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611081580] [2021-12-17 08:22:58,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:22:58,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:22:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:22:58,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:22:58,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:22:58,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611081580] [2021-12-17 08:22:58,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611081580] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:22:58,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297967052] [2021-12-17 08:22:58,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:22:58,732 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:22:58,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:22:58,733 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 08:22:58,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 08:22:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:22:58,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-17 08:22:58,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:22:58,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 08:22:58,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 08:22:58,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 08:22:58,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:22:58,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2021-12-17 08:22:58,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:22:58,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2021-12-17 08:22:58,952 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 08:22:58,953 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 23 treesize of output 27 [2021-12-17 08:22:58,963 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 08:22:58,963 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 23 treesize of output 27 [2021-12-17 08:22:58,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:22:58,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2021-12-17 08:22:58,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:22:58,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2021-12-17 08:22:59,036 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 08:22:59,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-17 08:22:59,212 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 08:22:59,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-17 08:22:59,218 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 27 treesize of output 27 [2021-12-17 08:22:59,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:22:59,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-12-17 08:22:59,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:22:59,425 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:22:59,425 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 22 treesize of output 10 [2021-12-17 08:22:59,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:22:59,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:22:59,497 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_877 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_877) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0)) (forall ((v_ArrVal_876 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_876) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0))) is different from false [2021-12-17 08:22:59,553 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_872 Int)) (or (not (= 0 (select |c_#valid| v_ArrVal_872))) (and (forall ((v_ArrVal_876 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_872)) v_ArrVal_872 v_ArrVal_876) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0)) (forall ((v_ArrVal_877 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0)) v_ArrVal_872 v_ArrVal_877) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0))))) is different from false [2021-12-17 08:23:00,048 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:23:00,052 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:23:00,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 57 [2021-12-17 08:23:00,058 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:23:00,061 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:23:00,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 62 [2021-12-17 08:23:00,065 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:23:00,067 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:23:00,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 60 [2021-12-17 08:23:00,072 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:23:00,074 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:23:00,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 58 [2021-12-17 08:23:00,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2021-12-17 08:23:00,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-12-17 08:23:00,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-17 08:23:00,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297967052] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 08:23:00,104 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 08:23:00,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2021-12-17 08:23:00,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559999649] [2021-12-17 08:23:00,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 08:23:00,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-17 08:23:00,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:23:00,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-17 08:23:00,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=164, Unknown=2, NotChecked=54, Total=272 [2021-12-17 08:23:00,106 INFO L87 Difference]: Start difference. First operand 171 states and 207 transitions. Second operand has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:23:00,138 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) .cse1) 0) (= |c_ULTIMATE.start_main_~end~0#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) .cse1) 0) (<= |c_ULTIMATE.start_main_~end~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|) (forall ((v_ArrVal_872 Int)) (or (not (= 0 (select |c_#valid| v_ArrVal_872))) (and (forall ((v_ArrVal_876 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_872)) v_ArrVal_872 v_ArrVal_876) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0)) (forall ((v_ArrVal_877 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0)) v_ArrVal_872 v_ArrVal_877) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0))))))) is different from false [2021-12-17 08:23:00,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:23:00,254 INFO L93 Difference]: Finished difference Result 305 states and 361 transitions. [2021-12-17 08:23:00,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 08:23:00,254 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-17 08:23:00,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:23:00,255 INFO L225 Difference]: With dead ends: 305 [2021-12-17 08:23:00,255 INFO L226 Difference]: Without dead ends: 213 [2021-12-17 08:23:00,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=212, Unknown=3, NotChecked=96, Total=380 [2021-12-17 08:23:00,256 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 92 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 289 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:23:00,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 558 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 107 Invalid, 0 Unknown, 289 Unchecked, 0.1s Time] [2021-12-17 08:23:00,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-12-17 08:23:00,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 193. [2021-12-17 08:23:00,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.2340425531914894) internal successors, (232), 192 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:23:00,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 232 transitions. [2021-12-17 08:23:00,262 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 232 transitions. Word has length 36 [2021-12-17 08:23:00,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:23:00,262 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 232 transitions. [2021-12-17 08:23:00,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:23:00,262 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 232 transitions. [2021-12-17 08:23:00,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-17 08:23:00,263 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:23:00,263 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:23:00,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 08:23:00,480 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-12-17 08:23:00,481 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:23:00,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:23:00,481 INFO L85 PathProgramCache]: Analyzing trace with hash -431498650, now seen corresponding path program 1 times [2021-12-17 08:23:00,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:23:00,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119326496] [2021-12-17 08:23:00,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:23:00,482 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:23:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:23:00,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:23:00,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:23:00,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119326496] [2021-12-17 08:23:00,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119326496] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:23:00,547 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:23:00,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 08:23:00,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988460019] [2021-12-17 08:23:00,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:23:00,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 08:23:00,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:23:00,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 08:23:00,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 08:23:00,549 INFO L87 Difference]: Start difference. First operand 193 states and 232 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:23:00,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:23:00,617 INFO L93 Difference]: Finished difference Result 311 states and 376 transitions. [2021-12-17 08:23:00,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 08:23:00,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-17 08:23:00,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:23:00,619 INFO L225 Difference]: With dead ends: 311 [2021-12-17 08:23:00,619 INFO L226 Difference]: Without dead ends: 202 [2021-12-17 08:23:00,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-17 08:23:00,620 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 13 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:23:00,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 237 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:23:00,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-12-17 08:23:00,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 195. [2021-12-17 08:23:00,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 190 states have (on average 1.231578947368421) internal successors, (234), 194 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:23:00,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 234 transitions. [2021-12-17 08:23:00,626 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 234 transitions. Word has length 36 [2021-12-17 08:23:00,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:23:00,627 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 234 transitions. [2021-12-17 08:23:00,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:23:00,627 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 234 transitions. [2021-12-17 08:23:00,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-17 08:23:00,627 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:23:00,627 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:23:00,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-17 08:23:00,628 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:23:00,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:23:00,628 INFO L85 PathProgramCache]: Analyzing trace with hash 589569704, now seen corresponding path program 1 times [2021-12-17 08:23:00,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:23:00,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980042039] [2021-12-17 08:23:00,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:23:00,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:23:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:23:00,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:23:00,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:23:00,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980042039] [2021-12-17 08:23:00,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980042039] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:23:00,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436821682] [2021-12-17 08:23:00,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:23:00,800 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:23:00,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:23:00,801 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 08:23:00,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 08:23:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:23:00,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 71 conjunts are in the unsatisfiable core [2021-12-17 08:23:00,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:23:00,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 08:23:00,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 08:23:00,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 08:23:01,045 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-17 08:23:01,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-17 08:23:01,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:23:01,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2021-12-17 08:23:01,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:23:01,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2021-12-17 08:23:01,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-17 08:23:01,065 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 23 treesize of output 23 [2021-12-17 08:23:01,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:23:01,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 54 [2021-12-17 08:23:01,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 52 [2021-12-17 08:23:01,240 INFO L354 Elim1Store]: treesize reduction 100, result has 30.6 percent of original size [2021-12-17 08:23:01,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 105 treesize of output 130 [2021-12-17 08:23:01,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:23:01,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:23:01,274 INFO L354 Elim1Store]: treesize reduction 44, result has 48.8 percent of original size [2021-12-17 08:23:01,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 109 [2021-12-17 08:23:01,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2021-12-17 08:23:01,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2021-12-17 08:23:01,303 INFO L354 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2021-12-17 08:23:01,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2021-12-17 08:23:01,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2021-12-17 08:23:01,442 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:23:01,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 44 [2021-12-17 08:23:01,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:23:01,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-12-17 08:23:01,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2021-12-17 08:23:01,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:23:01,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:23:01,919 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:23:01,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 99 [2021-12-17 08:23:01,926 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:23:01,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 102 [2021-12-17 08:23:03,692 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:23:03,697 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:23:03,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 123 [2021-12-17 08:23:03,702 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:23:03,708 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:23:03,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 123 treesize of output 120 [2021-12-17 08:23:03,714 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:23:03,716 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:23:03,717 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 320 treesize of output 304 [2021-12-17 08:23:03,720 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:23:03,722 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:23:03,724 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:23:03,724 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 224 treesize of output 214 [2021-12-17 08:23:03,734 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:23:03,735 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 220 treesize of output 224 [2021-12-17 08:23:03,741 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:23:03,742 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:23:03,745 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:23:03,745 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 344 treesize of output 328 [2021-12-17 08:23:03,755 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:23:03,756 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 337 treesize of output 293 [2021-12-17 08:23:03,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 149 [2021-12-17 08:23:03,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 137 [2021-12-17 08:23:03,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 125 [2021-12-17 08:23:03,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 121 [2021-12-17 08:23:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:23:04,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436821682] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 08:23:04,483 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 08:23:04,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2021-12-17 08:23:04,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961783707] [2021-12-17 08:23:04,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 08:23:04,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-17 08:23:04,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:23:04,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-17 08:23:04,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=233, Unknown=8, NotChecked=0, Total=306 [2021-12-17 08:23:04,484 INFO L87 Difference]: Start difference. First operand 195 states and 234 transitions. Second operand has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:23:04,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:23:04,595 INFO L93 Difference]: Finished difference Result 298 states and 359 transitions. [2021-12-17 08:23:04,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 08:23:04,595 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-17 08:23:04,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:23:04,596 INFO L225 Difference]: With dead ends: 298 [2021-12-17 08:23:04,596 INFO L226 Difference]: Without dead ends: 206 [2021-12-17 08:23:04,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=290, Unknown=8, NotChecked=0, Total=380 [2021-12-17 08:23:04,597 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 54 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:23:04,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 496 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 139 Unchecked, 0.1s Time] [2021-12-17 08:23:04,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-12-17 08:23:04,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 197. [2021-12-17 08:23:04,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 192 states have (on average 1.2291666666666667) internal successors, (236), 196 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:23:04,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 236 transitions. [2021-12-17 08:23:04,602 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 236 transitions. Word has length 36 [2021-12-17 08:23:04,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:23:04,602 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 236 transitions. [2021-12-17 08:23:04,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.111111111111111) internal successors, (74), 18 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 08:23:04,603 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 236 transitions. [2021-12-17 08:23:04,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-17 08:23:04,603 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:23:04,603 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:23:04,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 08:23:04,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:23:04,804 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2021-12-17 08:23:04,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:23:04,804 INFO L85 PathProgramCache]: Analyzing trace with hash -648373053, now seen corresponding path program 1 times [2021-12-17 08:23:04,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:23:04,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589883594] [2021-12-17 08:23:04,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:23:04,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:23:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 08:23:04,827 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 08:23:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 08:23:04,849 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 08:23:04,849 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 08:23:04,850 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (12 of 13 remaining) [2021-12-17 08:23:04,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (11 of 13 remaining) [2021-12-17 08:23:04,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (10 of 13 remaining) [2021-12-17 08:23:04,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (9 of 13 remaining) [2021-12-17 08:23:04,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (8 of 13 remaining) [2021-12-17 08:23:04,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (7 of 13 remaining) [2021-12-17 08:23:04,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (6 of 13 remaining) [2021-12-17 08:23:04,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (5 of 13 remaining) [2021-12-17 08:23:04,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (4 of 13 remaining) [2021-12-17 08:23:04,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (3 of 13 remaining) [2021-12-17 08:23:04,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (2 of 13 remaining) [2021-12-17 08:23:04,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (1 of 13 remaining) [2021-12-17 08:23:04,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (0 of 13 remaining) [2021-12-17 08:23:04,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-17 08:23:04,855 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:23:04,858 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 08:23:04,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 08:23:04 BoogieIcfgContainer [2021-12-17 08:23:04,881 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 08:23:04,881 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 08:23:04,882 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 08:23:04,882 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 08:23:04,882 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 08:22:54" (3/4) ... [2021-12-17 08:23:04,883 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-17 08:23:04,919 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 08:23:04,919 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 08:23:04,922 INFO L158 Benchmark]: Toolchain (without parser) took 11496.98ms. Allocated memory was 94.4MB in the beginning and 247.5MB in the end (delta: 153.1MB). Free memory was 63.2MB in the beginning and 136.3MB in the end (delta: -73.1MB). Peak memory consumption was 79.6MB. Max. memory is 16.1GB. [2021-12-17 08:23:04,922 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 94.4MB. Free memory was 51.4MB in the beginning and 51.3MB in the end (delta: 39.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 08:23:04,922 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.65ms. Allocated memory was 94.4MB in the beginning and 140.5MB in the end (delta: 46.1MB). Free memory was 62.9MB in the beginning and 106.5MB in the end (delta: -43.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 08:23:04,922 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.32ms. Allocated memory is still 140.5MB. Free memory was 106.5MB in the beginning and 104.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 08:23:04,923 INFO L158 Benchmark]: Boogie Preprocessor took 22.77ms. Allocated memory is still 140.5MB. Free memory was 104.4MB in the beginning and 102.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 08:23:04,923 INFO L158 Benchmark]: RCFGBuilder took 408.70ms. Allocated memory is still 140.5MB. Free memory was 102.3MB in the beginning and 83.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-17 08:23:04,923 INFO L158 Benchmark]: TraceAbstraction took 10696.24ms. Allocated memory was 140.5MB in the beginning and 247.5MB in the end (delta: 107.0MB). Free memory was 83.1MB in the beginning and 139.4MB in the end (delta: -56.4MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. [2021-12-17 08:23:04,923 INFO L158 Benchmark]: Witness Printer took 37.66ms. Allocated memory is still 247.5MB. Free memory was 139.4MB in the beginning and 136.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-17 08:23:04,928 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.19ms. Allocated memory is still 94.4MB. Free memory was 51.4MB in the beginning and 51.3MB in the end (delta: 39.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.65ms. Allocated memory was 94.4MB in the beginning and 140.5MB in the end (delta: 46.1MB). Free memory was 62.9MB in the beginning and 106.5MB in the end (delta: -43.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.32ms. Allocated memory is still 140.5MB. Free memory was 106.5MB in the beginning and 104.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.77ms. Allocated memory is still 140.5MB. Free memory was 104.4MB in the beginning and 102.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 408.70ms. Allocated memory is still 140.5MB. Free memory was 102.3MB in the beginning and 83.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10696.24ms. Allocated memory was 140.5MB in the beginning and 247.5MB in the end (delta: 107.0MB). Free memory was 83.1MB in the beginning and 139.4MB in the end (delta: -56.4MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. * Witness Printer took 37.66ms. Allocated memory is still 247.5MB. Free memory was 139.4MB in the beginning and 136.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s 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) VAL [list={-1:0}] [L1004] COND FALSE !(!(list != ((void*)0))) VAL [list={-1: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) VAL [list={-1:0}, list->inner={-2:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1] [L1004] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1006] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1019] end = ((void*)0) [L1020] end = list VAL [end={-1:0}, list={-1:0}] [L1023] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [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 VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}] [L1031] COND TRUE len == 0 [L1032] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1035] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1036] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}] [L1036] COND FALSE !(!(((void*)0) == inner->inner)) [L1037] EXPR inner->next VAL [end={-1:0}, inner={-2:0}, inner->next={0:0}, len=1, list={-1:0}] [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 VAL [end={-1:0}, inner={54:5}, len=1, list={-1:0}] [L1031] COND FALSE !(len == 0) [L1034] len = 2 VAL [end={-1:0}, inner={54:5}, len=2, list={-1:0}] [L1035] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={54:5}, len=2, list={-1:0}] [L1036] EXPR inner->inner VAL [end={-1:0}, inner={54:5}, inner->inner={55:51}, len=2, list={-1:0}] [L1036] COND TRUE !(((void*)0) == inner->inner) [L1036] reach_error() VAL [end={-1:0}, inner={54:5}, len=2, list={-1:0}] - 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: 10.6s, OverallIterations: 22, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1572 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1572 mSDsluCounter, 4879 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 428 IncrementalHoareTripleChecker+Unchecked, 3278 mSDsCounter, 129 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1522 IncrementalHoareTripleChecker+Invalid, 2079 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 129 mSolverCounterUnsat, 1601 mSDtfsCounter, 1522 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 401 GetRequests, 274 SyntacticMatches, 16 SemanticMatches, 111 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197occurred in iteration=21, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 659 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 661 NumberOfCodeBlocks, 661 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 729 ConstructedInterpolants, 62 QuantifiedInterpolants, 10449 SizeOfPredicates, 29 NumberOfNonLiveVariables, 778 ConjunctsInSsa, 160 ConjunctsInUnsatCore, 29 InterpolantComputations, 17 PerfectInterpolantSequences, 14/33 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-12-17 08:23:04,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE