./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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-1.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 ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 15:02:37,284 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:02:37,286 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:02:37,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:02:37,319 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:02:37,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:02:37,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:02:37,323 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:02:37,324 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:02:37,328 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:02:37,328 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:02:37,330 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:02:37,330 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:02:37,331 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:02:37,332 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:02:37,334 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:02:37,335 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:02:37,336 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:02:37,337 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:02:37,341 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:02:37,342 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:02:37,343 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:02:37,344 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:02:37,344 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:02:37,345 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:02:37,350 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:02:37,351 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:02:37,351 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:02:37,351 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:02:37,352 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:02:37,353 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:02:37,353 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:02:37,355 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:02:37,355 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:02:37,355 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:02:37,356 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:02:37,356 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:02:37,357 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:02:37,357 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:02:37,357 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:02:37,357 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:02:37,359 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:02:37,360 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 15:02:37,383 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:02:37,383 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:02:37,383 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:02:37,384 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:02:37,384 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:02:37,384 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:02:37,385 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:02:37,385 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:02:37,385 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:02:37,386 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:02:37,386 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:02:37,386 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 15:02:37,386 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:02:37,386 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:02:37,387 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:02:37,387 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:02:37,387 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:02:37,387 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:02:37,387 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:02:37,387 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:02:37,387 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:02:37,388 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:02:37,388 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:02:37,388 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:02:37,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:02:37,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:02:37,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:02:37,389 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:02:37,389 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 15:02:37,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 15:02:37,389 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:02:37,389 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:02:37,389 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:02:37,390 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 -> ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d [2022-07-13 15:02:37,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:02:37,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:02:37,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:02:37,609 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:02:37,610 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:02:37,611 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-1.i [2022-07-13 15:02:37,678 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb5c122d6/fb6505743b184293bd0933ad40089198/FLAGe10001374 [2022-07-13 15:02:38,059 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:02:38,059 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i [2022-07-13 15:02:38,069 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb5c122d6/fb6505743b184293bd0933ad40089198/FLAGe10001374 [2022-07-13 15:02:38,419 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb5c122d6/fb6505743b184293bd0933ad40089198 [2022-07-13 15:02:38,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:02:38,422 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:02:38,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:02:38,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:02:38,435 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:02:38,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:02:38" (1/1) ... [2022-07-13 15:02:38,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59acaea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:38, skipping insertion in model container [2022-07-13 15:02:38,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:02:38" (1/1) ... [2022-07-13 15:02:38,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:02:38,500 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:02:38,702 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-1.i[22034,22047] [2022-07-13 15:02:38,706 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-1.i[22307,22320] [2022-07-13 15:02:38,707 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-1.i[22516,22529] [2022-07-13 15:02:38,708 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-1.i[22586,22599] [2022-07-13 15:02:38,709 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-1.i[22853,22866] [2022-07-13 15:02:38,710 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-1.i[22961,22974] [2022-07-13 15:02:38,712 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-1.i[23192,23205] [2022-07-13 15:02:38,714 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-1.i[23272,23285] [2022-07-13 15:02:38,715 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-1.i[23351,23364] [2022-07-13 15:02:38,717 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-1.i[23441,23454] [2022-07-13 15:02:38,719 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-1.i[23619,23632] [2022-07-13 15:02:38,720 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-1.i[23697,23710] [2022-07-13 15:02:38,721 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-1.i[23774,23787] [2022-07-13 15:02:38,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:02:38,732 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:02:38,753 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-1.i[22034,22047] [2022-07-13 15:02:38,754 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-1.i[22307,22320] [2022-07-13 15:02:38,755 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-1.i[22516,22529] [2022-07-13 15:02:38,756 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-1.i[22586,22599] [2022-07-13 15:02:38,757 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-1.i[22853,22866] [2022-07-13 15:02:38,760 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-1.i[22961,22974] [2022-07-13 15:02:38,761 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-1.i[23192,23205] [2022-07-13 15:02:38,762 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-1.i[23272,23285] [2022-07-13 15:02:38,762 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-1.i[23351,23364] [2022-07-13 15:02:38,763 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-1.i[23441,23454] [2022-07-13 15:02:38,765 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-1.i[23619,23632] [2022-07-13 15:02:38,766 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-1.i[23697,23710] [2022-07-13 15:02:38,766 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-1.i[23774,23787] [2022-07-13 15:02:38,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:02:38,784 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:02:38,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:38 WrapperNode [2022-07-13 15:02:38,786 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:02:38,787 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:02:38,787 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:02:38,787 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:02:38,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:38" (1/1) ... [2022-07-13 15:02:38,807 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:38" (1/1) ... [2022-07-13 15:02:38,823 INFO L137 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 221 [2022-07-13 15:02:38,824 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:02:38,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:02:38,825 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:02:38,825 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:02:38,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:38" (1/1) ... [2022-07-13 15:02:38,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:38" (1/1) ... [2022-07-13 15:02:38,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:38" (1/1) ... [2022-07-13 15:02:38,833 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:38" (1/1) ... [2022-07-13 15:02:38,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:38" (1/1) ... [2022-07-13 15:02:38,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:38" (1/1) ... [2022-07-13 15:02:38,846 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:38" (1/1) ... [2022-07-13 15:02:38,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:02:38,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:02:38,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:02:38,849 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:02:38,850 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:38" (1/1) ... [2022-07-13 15:02:38,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:02:38,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:02:38,888 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 15:02:38,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 15:02:38,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 15:02:38,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:02:38,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 15:02:38,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 15:02:38,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 15:02:38,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 15:02:38,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:02:38,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:02:38,987 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:02:38,989 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:02:39,312 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:02:39,328 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:02:39,328 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-07-13 15:02:39,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:02:39 BoogieIcfgContainer [2022-07-13 15:02:39,330 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:02:39,332 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:02:39,332 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:02:39,335 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:02:39,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:02:38" (1/3) ... [2022-07-13 15:02:39,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6559e216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:02:39, skipping insertion in model container [2022-07-13 15:02:39,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:38" (2/3) ... [2022-07-13 15:02:39,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6559e216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:02:39, skipping insertion in model container [2022-07-13 15:02:39,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:02:39" (3/3) ... [2022-07-13 15:02:39,337 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2022-07-13 15:02:39,347 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:02:39,347 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2022-07-13 15:02:39,387 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:02:39,391 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4ddee65, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@12480c99 [2022-07-13 15:02:39,392 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-07-13 15:02:39,394 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 82 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) [2022-07-13 15:02:39,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-13 15:02:39,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:39,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-13 15:02:39,399 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:39,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:39,402 INFO L85 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2022-07-13 15:02:39,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:39,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139141728] [2022-07-13 15:02:39,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:39,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:39,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:39,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:39,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139141728] [2022-07-13 15:02:39,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139141728] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:39,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:39,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:02:39,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14969812] [2022-07-13 15:02:39,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:39,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:02:39,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:39,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:02:39,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:39,582 INFO L87 Difference]: Start difference. First operand has 83 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 82 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:39,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:39,647 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2022-07-13 15:02:39,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:02:39,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-07-13 15:02:39,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:39,655 INFO L225 Difference]: With dead ends: 180 [2022-07-13 15:02:39,656 INFO L226 Difference]: Without dead ends: 95 [2022-07-13 15:02:39,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:39,662 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 83 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:39,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 102 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:39,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-13 15:02:39,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2022-07-13 15:02:39,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.323076923076923) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:39,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2022-07-13 15:02:39,697 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 4 [2022-07-13 15:02:39,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:39,697 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2022-07-13 15:02:39,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:39,698 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2022-07-13 15:02:39,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 15:02:39,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:39,699 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:39,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 15:02:39,701 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:39,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:39,702 INFO L85 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2022-07-13 15:02:39,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:39,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409508589] [2022-07-13 15:02:39,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:39,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:39,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:39,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:39,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409508589] [2022-07-13 15:02:39,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409508589] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:39,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:39,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:02:39,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863227082] [2022-07-13 15:02:39,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:39,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:02:39,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:39,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:02:39,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:39,786 INFO L87 Difference]: Start difference. First operand 77 states and 86 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) [2022-07-13 15:02:39,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:39,804 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2022-07-13 15:02:39,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:02:39,805 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 [2022-07-13 15:02:39,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:39,805 INFO L225 Difference]: With dead ends: 80 [2022-07-13 15:02:39,805 INFO L226 Difference]: Without dead ends: 78 [2022-07-13 15:02:39,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:39,807 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:39,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:39,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-13 15:02:39,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-07-13 15:02:39,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 77 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:39,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2022-07-13 15:02:39,814 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 10 [2022-07-13 15:02:39,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:39,815 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2022-07-13 15:02:39,815 INFO L496 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) [2022-07-13 15:02:39,816 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2022-07-13 15:02:39,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 15:02:39,817 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:39,817 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:39,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 15:02:39,817 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:39,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:39,820 INFO L85 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2022-07-13 15:02:39,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:39,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086281676] [2022-07-13 15:02:39,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:39,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:39,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:39,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:39,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086281676] [2022-07-13 15:02:39,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086281676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:39,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:39,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:02:39,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140416870] [2022-07-13 15:02:39,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:39,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:02:39,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:39,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:02:39,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:02:39,871 INFO L87 Difference]: Start difference. First operand 78 states and 87 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) [2022-07-13 15:02:39,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:39,915 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2022-07-13 15:02:39,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:02:39,916 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 [2022-07-13 15:02:39,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:39,917 INFO L225 Difference]: With dead ends: 79 [2022-07-13 15:02:39,917 INFO L226 Difference]: Without dead ends: 77 [2022-07-13 15:02:39,917 INFO L412 NwaCegarLoop]: 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 [2022-07-13 15:02:39,918 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:39,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 219 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:39,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-13 15:02:39,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-07-13 15:02:39,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 64 states have (on average 1.3125) internal successors, (84), 74 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:39,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2022-07-13 15:02:39,922 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 10 [2022-07-13 15:02:39,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:39,923 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2022-07-13 15:02:39,923 INFO L496 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) [2022-07-13 15:02:39,923 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-07-13 15:02:39,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 15:02:39,923 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:39,924 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:39,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 15:02:39,924 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:39,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:39,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1712619113, now seen corresponding path program 1 times [2022-07-13 15:02:39,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:39,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243261004] [2022-07-13 15:02:39,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:39,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:39,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:39,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:39,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243261004] [2022-07-13 15:02:39,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243261004] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:39,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:39,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:02:39,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051825782] [2022-07-13 15:02:39,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:39,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:02:39,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:39,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:02:39,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:39,961 INFO L87 Difference]: Start difference. First operand 75 states and 84 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) [2022-07-13 15:02:40,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:40,007 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2022-07-13 15:02:40,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:02:40,007 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 [2022-07-13 15:02:40,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:40,009 INFO L225 Difference]: With dead ends: 78 [2022-07-13 15:02:40,010 INFO L226 Difference]: Without dead ends: 74 [2022-07-13 15:02:40,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:40,012 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 16 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:40,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 125 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:40,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-13 15:02:40,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2022-07-13 15:02:40,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 70 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:40,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2022-07-13 15:02:40,017 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 15 [2022-07-13 15:02:40,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:40,018 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2022-07-13 15:02:40,018 INFO L496 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) [2022-07-13 15:02:40,018 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2022-07-13 15:02:40,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 15:02:40,018 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:40,019 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:40,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 15:02:40,019 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:40,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:40,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1551589151, now seen corresponding path program 1 times [2022-07-13 15:02:40,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:40,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332100208] [2022-07-13 15:02:40,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:40,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:40,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:40,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:40,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332100208] [2022-07-13 15:02:40,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332100208] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:40,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:40,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:02:40,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123566733] [2022-07-13 15:02:40,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:40,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:02:40,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:40,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:02:40,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:02:40,076 INFO L87 Difference]: Start difference. First operand 71 states and 80 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) [2022-07-13 15:02:40,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:40,149 INFO L93 Difference]: Finished difference Result 187 states and 209 transitions. [2022-07-13 15:02:40,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:02:40,150 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 [2022-07-13 15:02:40,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:40,152 INFO L225 Difference]: With dead ends: 187 [2022-07-13 15:02:40,152 INFO L226 Difference]: Without dead ends: 124 [2022-07-13 15:02:40,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:02:40,153 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 55 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:40,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 187 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:02:40,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-13 15:02:40,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 73. [2022-07-13 15:02:40,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 64 states have (on average 1.28125) internal successors, (82), 72 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:40,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2022-07-13 15:02:40,165 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 16 [2022-07-13 15:02:40,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:40,165 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2022-07-13 15:02:40,165 INFO L496 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) [2022-07-13 15:02:40,165 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2022-07-13 15:02:40,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 15:02:40,166 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:40,166 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:40,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 15:02:40,166 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:40,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:40,167 INFO L85 PathProgramCache]: Analyzing trace with hash -2063319775, now seen corresponding path program 1 times [2022-07-13 15:02:40,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:40,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670293309] [2022-07-13 15:02:40,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:40,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:40,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:40,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:40,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670293309] [2022-07-13 15:02:40,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670293309] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:40,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:40,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:02:40,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282323946] [2022-07-13 15:02:40,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:40,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:02:40,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:40,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:02:40,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:02:40,230 INFO L87 Difference]: Start difference. First operand 73 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) [2022-07-13 15:02:40,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:40,281 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2022-07-13 15:02:40,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:02:40,282 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 [2022-07-13 15:02:40,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:40,282 INFO L225 Difference]: With dead ends: 132 [2022-07-13 15:02:40,282 INFO L226 Difference]: Without dead ends: 112 [2022-07-13 15:02:40,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:02:40,283 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 128 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 116 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 [2022-07-13 15:02:40,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 116 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:40,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-13 15:02:40,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 72. [2022-07-13 15:02:40,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 64 states have (on average 1.265625) internal successors, (81), 71 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:40,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2022-07-13 15:02:40,287 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 16 [2022-07-13 15:02:40,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:40,288 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2022-07-13 15:02:40,288 INFO L496 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) [2022-07-13 15:02:40,288 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2022-07-13 15:02:40,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 15:02:40,288 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:40,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:40,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 15:02:40,289 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:40,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:40,289 INFO L85 PathProgramCache]: Analyzing trace with hash -940628212, now seen corresponding path program 1 times [2022-07-13 15:02:40,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:40,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632533748] [2022-07-13 15:02:40,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:40,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:40,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:40,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:40,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632533748] [2022-07-13 15:02:40,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632533748] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:40,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:40,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:02:40,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080146041] [2022-07-13 15:02:40,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:40,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:02:40,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:40,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:02:40,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:40,322 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:40,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:40,332 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2022-07-13 15:02:40,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:02:40,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-13 15:02:40,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:40,333 INFO L225 Difference]: With dead ends: 137 [2022-07-13 15:02:40,333 INFO L226 Difference]: Without dead ends: 96 [2022-07-13 15:02:40,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:40,335 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 24 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:40,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 149 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:40,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-13 15:02:40,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2022-07-13 15:02:40,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 74 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) [2022-07-13 15:02:40,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2022-07-13 15:02:40,341 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 20 [2022-07-13 15:02:40,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:40,341 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2022-07-13 15:02:40,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:40,342 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2022-07-13 15:02:40,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 15:02:40,343 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:40,343 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:40,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 15:02:40,343 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:40,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:40,343 INFO L85 PathProgramCache]: Analyzing trace with hash 905291998, now seen corresponding path program 1 times [2022-07-13 15:02:40,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:40,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128715901] [2022-07-13 15:02:40,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:40,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:40,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:40,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:40,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128715901] [2022-07-13 15:02:40,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128715901] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:40,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:40,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:02:40,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338840967] [2022-07-13 15:02:40,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:40,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:02:40,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:40,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:02:40,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:40,396 INFO L87 Difference]: Start difference. First operand 75 states and 85 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) [2022-07-13 15:02:40,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:40,404 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2022-07-13 15:02:40,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:02:40,404 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 [2022-07-13 15:02:40,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:40,405 INFO L225 Difference]: With dead ends: 75 [2022-07-13 15:02:40,405 INFO L226 Difference]: Without dead ends: 73 [2022-07-13 15:02:40,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:40,406 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 13 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:40,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 129 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:40,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-13 15:02:40,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-07-13 15:02:40,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.2575757575757576) 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) [2022-07-13 15:02:40,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2022-07-13 15:02:40,415 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 21 [2022-07-13 15:02:40,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:40,415 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2022-07-13 15:02:40,416 INFO L496 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) [2022-07-13 15:02:40,416 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2022-07-13 15:02:40,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 15:02:40,416 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:40,416 INFO L195 NwaCegarLoop]: 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] [2022-07-13 15:02:40,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 15:02:40,417 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:40,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:40,417 INFO L85 PathProgramCache]: Analyzing trace with hash 886650935, now seen corresponding path program 1 times [2022-07-13 15:02:40,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:40,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680203488] [2022-07-13 15:02:40,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:40,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:40,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:40,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:40,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680203488] [2022-07-13 15:02:40,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680203488] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:40,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:40,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:02:40,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027508117] [2022-07-13 15:02:40,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:40,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:02:40,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:40,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:02:40,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:02:40,465 INFO L87 Difference]: Start difference. First operand 73 states and 83 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) [2022-07-13 15:02:40,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:40,505 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2022-07-13 15:02:40,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:02:40,505 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 [2022-07-13 15:02:40,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:40,506 INFO L225 Difference]: With dead ends: 74 [2022-07-13 15:02:40,506 INFO L226 Difference]: Without dead ends: 72 [2022-07-13 15:02:40,506 INFO L412 NwaCegarLoop]: 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 [2022-07-13 15:02:40,507 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:40,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:40,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-13 15:02:40,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2022-07-13 15:02:40,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 70 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:40,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-07-13 15:02:40,510 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 23 [2022-07-13 15:02:40,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:40,510 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-07-13 15:02:40,511 INFO L496 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) [2022-07-13 15:02:40,511 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-07-13 15:02:40,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 15:02:40,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:40,511 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:40,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 15:02:40,512 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:40,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:40,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1458355201, now seen corresponding path program 1 times [2022-07-13 15:02:40,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:40,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150441973] [2022-07-13 15:02:40,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:40,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:40,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:40,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:40,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150441973] [2022-07-13 15:02:40,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150441973] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:40,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:40,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 15:02:40,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518916480] [2022-07-13 15:02:40,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:40,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:02:40,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:40,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:02:40,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:02:40,574 INFO L87 Difference]: Start difference. First operand 71 states and 81 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) [2022-07-13 15:02:40,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:40,700 INFO L93 Difference]: Finished difference Result 175 states and 199 transitions. [2022-07-13 15:02:40,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 15:02:40,701 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 [2022-07-13 15:02:40,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:40,701 INFO L225 Difference]: With dead ends: 175 [2022-07-13 15:02:40,701 INFO L226 Difference]: Without dead ends: 133 [2022-07-13 15:02:40,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-13 15:02:40,702 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 115 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:40,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 281 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:02:40,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-13 15:02:40,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 81. [2022-07-13 15:02:40,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 80 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:40,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2022-07-13 15:02:40,706 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 24 [2022-07-13 15:02:40,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:40,707 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2022-07-13 15:02:40,707 INFO L496 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) [2022-07-13 15:02:40,707 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2022-07-13 15:02:40,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 15:02:40,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:40,708 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:40,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 15:02:40,708 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:40,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:40,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1357759361, now seen corresponding path program 1 times [2022-07-13 15:02:40,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:40,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388964007] [2022-07-13 15:02:40,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:40,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:40,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:40,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:40,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388964007] [2022-07-13 15:02:40,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388964007] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:40,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:40,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 15:02:40,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321303699] [2022-07-13 15:02:40,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:40,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 15:02:40,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:40,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 15:02:40,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:02:40,879 INFO L87 Difference]: Start difference. First operand 81 states and 92 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) [2022-07-13 15:02:41,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:41,159 INFO L93 Difference]: Finished difference Result 234 states and 259 transitions. [2022-07-13 15:02:41,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 15:02:41,159 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 [2022-07-13 15:02:41,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:41,161 INFO L225 Difference]: With dead ends: 234 [2022-07-13 15:02:41,161 INFO L226 Difference]: Without dead ends: 232 [2022-07-13 15:02:41,161 INFO L412 NwaCegarLoop]: 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 [2022-07-13 15:02:41,162 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 243 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:41,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 420 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 15:02:41,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-13 15:02:41,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 93. [2022-07-13 15:02:41,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 92 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:41,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2022-07-13 15:02:41,167 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 24 [2022-07-13 15:02:41,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:41,167 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2022-07-13 15:02:41,167 INFO L496 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) [2022-07-13 15:02:41,168 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2022-07-13 15:02:41,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 15:02:41,168 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:41,168 INFO L195 NwaCegarLoop]: 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] [2022-07-13 15:02:41,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 15:02:41,169 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:41,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:41,169 INFO L85 PathProgramCache]: Analyzing trace with hash 680714775, now seen corresponding path program 1 times [2022-07-13 15:02:41,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:41,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339481232] [2022-07-13 15:02:41,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:41,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:41,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:02:41,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:41,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339481232] [2022-07-13 15:02:41,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339481232] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:41,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:41,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:02:41,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323596864] [2022-07-13 15:02:41,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:41,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:02:41,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:41,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:02:41,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:02:41,235 INFO L87 Difference]: Start difference. First operand 93 states and 106 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) [2022-07-13 15:02:41,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:41,330 INFO L93 Difference]: Finished difference Result 139 states and 158 transitions. [2022-07-13 15:02:41,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:02:41,331 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 [2022-07-13 15:02:41,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:41,332 INFO L225 Difference]: With dead ends: 139 [2022-07-13 15:02:41,332 INFO L226 Difference]: Without dead ends: 121 [2022-07-13 15:02:41,332 INFO L412 NwaCegarLoop]: 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 [2022-07-13 15:02:41,332 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 57 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:41,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 186 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:02:41,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-13 15:02:41,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 113. [2022-07-13 15:02:41,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 107 states have (on average 1.2429906542056075) internal successors, (133), 112 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:41,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 133 transitions. [2022-07-13 15:02:41,337 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 133 transitions. Word has length 26 [2022-07-13 15:02:41,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:41,338 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 133 transitions. [2022-07-13 15:02:41,338 INFO L496 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) [2022-07-13 15:02:41,338 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 133 transitions. [2022-07-13 15:02:41,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 15:02:41,338 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:41,339 INFO L195 NwaCegarLoop]: 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] [2022-07-13 15:02:41,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 15:02:41,339 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:41,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:41,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1502606953, now seen corresponding path program 1 times [2022-07-13 15:02:41,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:41,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461007151] [2022-07-13 15:02:41,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:41,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:41,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:02:41,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:41,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461007151] [2022-07-13 15:02:41,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461007151] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:41,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:41,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:02:41,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883453119] [2022-07-13 15:02:41,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:41,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:02:41,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:41,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:02:41,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:41,374 INFO L87 Difference]: Start difference. First operand 113 states and 133 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) [2022-07-13 15:02:41,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:41,398 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2022-07-13 15:02:41,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:02:41,399 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 [2022-07-13 15:02:41,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:41,399 INFO L225 Difference]: With dead ends: 113 [2022-07-13 15:02:41,399 INFO L226 Difference]: Without dead ends: 111 [2022-07-13 15:02:41,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:41,400 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 49 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:41,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 76 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:41,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-13 15:02:41,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-07-13 15:02:41,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.2358490566037736) internal successors, (131), 110 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:41,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions. [2022-07-13 15:02:41,405 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 131 transitions. Word has length 26 [2022-07-13 15:02:41,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:41,405 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 131 transitions. [2022-07-13 15:02:41,405 INFO L496 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) [2022-07-13 15:02:41,406 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 131 transitions. [2022-07-13 15:02:41,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 15:02:41,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:41,406 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:41,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 15:02:41,407 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:41,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:41,407 INFO L85 PathProgramCache]: Analyzing trace with hash -988757936, now seen corresponding path program 1 times [2022-07-13 15:02:41,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:41,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482358580] [2022-07-13 15:02:41,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:41,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:41,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:41,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:41,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482358580] [2022-07-13 15:02:41,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482358580] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:41,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:41,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 15:02:41,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409714082] [2022-07-13 15:02:41,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:41,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 15:02:41,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:41,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 15:02:41,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:02:41,524 INFO L87 Difference]: Start difference. First operand 111 states and 131 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) [2022-07-13 15:02:41,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:41,757 INFO L93 Difference]: Finished difference Result 268 states and 308 transitions. [2022-07-13 15:02:41,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 15:02:41,758 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 [2022-07-13 15:02:41,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:41,759 INFO L225 Difference]: With dead ends: 268 [2022-07-13 15:02:41,759 INFO L226 Difference]: Without dead ends: 266 [2022-07-13 15:02:41,759 INFO L412 NwaCegarLoop]: 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 [2022-07-13 15:02:41,760 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 248 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:41,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 384 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:02:41,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-13 15:02:41,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 114. [2022-07-13 15:02:41,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 109 states have (on average 1.2293577981651376) internal successors, (134), 113 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:41,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2022-07-13 15:02:41,765 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 27 [2022-07-13 15:02:41,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:41,765 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2022-07-13 15:02:41,765 INFO L496 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) [2022-07-13 15:02:41,766 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2022-07-13 15:02:41,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 15:02:41,766 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:41,766 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:41,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 15:02:41,766 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:41,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:41,766 INFO L85 PathProgramCache]: Analyzing trace with hash -937634650, now seen corresponding path program 1 times [2022-07-13 15:02:41,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:41,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882082995] [2022-07-13 15:02:41,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:41,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:41,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:41,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:41,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882082995] [2022-07-13 15:02:41,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882082995] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:02:41,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46471751] [2022-07-13 15:02:41,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:41,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:02:41,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:02:41,844 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:02:41,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 15:02:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:41,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-13 15:02:41,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:41,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 15:02:42,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 15:02:42,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:42,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-13 15:02:42,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:42,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-13 15:02:42,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-13 15:02:42,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-13 15:02:42,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:42,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:02:42,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:42,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46471751] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:02:42,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:02:42,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-07-13 15:02:42,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080576823] [2022-07-13 15:02:42,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:02:42,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 15:02:42,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:42,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 15:02:42,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:02:42,239 INFO L87 Difference]: Start difference. First operand 114 states and 134 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) [2022-07-13 15:02:42,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:42,336 INFO L93 Difference]: Finished difference Result 199 states and 229 transitions. [2022-07-13 15:02:42,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 15:02:42,337 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 [2022-07-13 15:02:42,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:42,337 INFO L225 Difference]: With dead ends: 199 [2022-07-13 15:02:42,337 INFO L226 Difference]: Without dead ends: 139 [2022-07-13 15:02:42,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-13 15:02:42,338 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 147 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:42,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 166 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:02:42,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-13 15:02:42,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 116. [2022-07-13 15:02:42,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.2072072072072073) internal successors, (134), 115 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:42,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2022-07-13 15:02:42,343 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 29 [2022-07-13 15:02:42,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:42,343 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2022-07-13 15:02:42,343 INFO L496 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) [2022-07-13 15:02:42,343 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2022-07-13 15:02:42,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 15:02:42,344 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:42,344 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:42,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 15:02:42,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-13 15:02:42,545 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:42,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:42,545 INFO L85 PathProgramCache]: Analyzing trace with hash -2010394174, now seen corresponding path program 1 times [2022-07-13 15:02:42,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:42,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818693164] [2022-07-13 15:02:42,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:42,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:42,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:42,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:42,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818693164] [2022-07-13 15:02:42,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818693164] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:42,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:42,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 15:02:42,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857738375] [2022-07-13 15:02:42,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:42,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:02:42,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:42,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:02:42,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:02:42,750 INFO L87 Difference]: Start difference. First operand 116 states and 134 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) [2022-07-13 15:02:42,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:42,857 INFO L93 Difference]: Finished difference Result 159 states and 176 transitions. [2022-07-13 15:02:42,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:02:42,857 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 [2022-07-13 15:02:42,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:42,858 INFO L225 Difference]: With dead ends: 159 [2022-07-13 15:02:42,858 INFO L226 Difference]: Without dead ends: 139 [2022-07-13 15:02:42,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:02:42,859 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 152 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:42,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 200 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:02:42,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-13 15:02:42,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 115. [2022-07-13 15:02:42,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.2) internal successors, (132), 114 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:42,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 132 transitions. [2022-07-13 15:02:42,864 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 132 transitions. Word has length 29 [2022-07-13 15:02:42,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:42,864 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 132 transitions. [2022-07-13 15:02:42,864 INFO L496 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) [2022-07-13 15:02:42,864 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 132 transitions. [2022-07-13 15:02:42,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-13 15:02:42,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:42,865 INFO L195 NwaCegarLoop]: 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] [2022-07-13 15:02:42,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 15:02:42,865 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:42,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:42,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1521997910, now seen corresponding path program 1 times [2022-07-13 15:02:42,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:42,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169561777] [2022-07-13 15:02:42,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:42,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:42,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:42,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:42,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169561777] [2022-07-13 15:02:42,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169561777] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:42,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:42,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:02:42,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317164486] [2022-07-13 15:02:42,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:42,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:02:42,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:42,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:02:42,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:42,915 INFO L87 Difference]: Start difference. First operand 115 states and 132 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:42,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:42,925 INFO L93 Difference]: Finished difference Result 220 states and 257 transitions. [2022-07-13 15:02:42,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:02:42,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-13 15:02:42,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:42,926 INFO L225 Difference]: With dead ends: 220 [2022-07-13 15:02:42,926 INFO L226 Difference]: Without dead ends: 165 [2022-07-13 15:02:42,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:42,927 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 26 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:42,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 164 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:42,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-13 15:02:42,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 138. [2022-07-13 15:02:42,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 133 states have (on average 1.2105263157894737) internal successors, (161), 137 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) [2022-07-13 15:02:42,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 161 transitions. [2022-07-13 15:02:42,932 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 161 transitions. Word has length 31 [2022-07-13 15:02:42,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:42,933 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 161 transitions. [2022-07-13 15:02:42,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:42,933 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 161 transitions. [2022-07-13 15:02:42,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-13 15:02:42,933 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:42,933 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:42,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 15:02:42,934 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:42,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:42,934 INFO L85 PathProgramCache]: Analyzing trace with hash 914215427, now seen corresponding path program 1 times [2022-07-13 15:02:42,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:42,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070770415] [2022-07-13 15:02:42,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:42,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:42,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:42,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:42,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070770415] [2022-07-13 15:02:42,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070770415] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:02:42,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052939601] [2022-07-13 15:02:42,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:42,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:02:42,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:02:43,006 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:02:43,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 15:02:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:43,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-13 15:02:43,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:43,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 15:02:43,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 15:02:43,133 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-13 15:02:43,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-13 15:02:43,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:43,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-13 15:02:43,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-13 15:02:43,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-13 15:02:43,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:02:43,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:02:43,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 15:02:43,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052939601] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:02:43,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:02:43,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2022-07-13 15:02:43,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624617576] [2022-07-13 15:02:43,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:02:43,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:02:43,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:43,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:02:43,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:02:43,245 INFO L87 Difference]: Start difference. First operand 138 states and 161 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) [2022-07-13 15:02:43,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:43,369 INFO L93 Difference]: Finished difference Result 247 states and 282 transitions. [2022-07-13 15:02:43,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 15:02:43,369 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 [2022-07-13 15:02:43,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:43,370 INFO L225 Difference]: With dead ends: 247 [2022-07-13 15:02:43,370 INFO L226 Difference]: Without dead ends: 216 [2022-07-13 15:02:43,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-13 15:02:43,371 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 95 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:43,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 286 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:02:43,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-13 15:02:43,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 165. [2022-07-13 15:02:43,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 160 states have (on average 1.2375) internal successors, (198), 164 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:43,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 198 transitions. [2022-07-13 15:02:43,376 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 198 transitions. Word has length 32 [2022-07-13 15:02:43,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:43,376 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 198 transitions. [2022-07-13 15:02:43,376 INFO L496 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) [2022-07-13 15:02:43,377 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 198 transitions. [2022-07-13 15:02:43,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 15:02:43,377 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:43,377 INFO L195 NwaCegarLoop]: 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] [2022-07-13 15:02:43,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 15:02:43,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-13 15:02:43,588 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:43,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:43,589 INFO L85 PathProgramCache]: Analyzing trace with hash 191981961, now seen corresponding path program 1 times [2022-07-13 15:02:43,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:43,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936964871] [2022-07-13 15:02:43,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:43,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:43,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:43,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:43,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936964871] [2022-07-13 15:02:43,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936964871] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:43,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:43,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:02:43,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241757424] [2022-07-13 15:02:43,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:43,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:02:43,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:43,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:02:43,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:02:43,637 INFO L87 Difference]: Start difference. First operand 165 states and 198 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:43,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:43,688 INFO L93 Difference]: Finished difference Result 231 states and 274 transitions. [2022-07-13 15:02:43,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:02:43,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2022-07-13 15:02:43,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:43,689 INFO L225 Difference]: With dead ends: 231 [2022-07-13 15:02:43,689 INFO L226 Difference]: Without dead ends: 117 [2022-07-13 15:02:43,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:02:43,690 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 24 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:43,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 188 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:43,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-13 15:02:43,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-07-13 15:02:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 113 states have (on average 1.1592920353982301) internal successors, (131), 116 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:43,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2022-07-13 15:02:43,695 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 35 [2022-07-13 15:02:43,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:43,695 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2022-07-13 15:02:43,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:43,695 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2022-07-13 15:02:43,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 15:02:43,696 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:43,696 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:43,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 15:02:43,696 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:43,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:43,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1562646056, now seen corresponding path program 1 times [2022-07-13 15:02:43,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:43,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076149954] [2022-07-13 15:02:43,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:43,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:43,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:43,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:43,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076149954] [2022-07-13 15:02:43,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076149954] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:02:43,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223600202] [2022-07-13 15:02:43,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:43,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:02:43,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:02:43,810 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:02:43,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 15:02:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:43,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-13 15:02:43,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:43,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:02:43,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 15:02:43,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 15:02:43,984 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:02:43,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 15:02:43,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:43,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-07-13 15:02:43,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:43,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-07-13 15:02:44,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-13 15:02:44,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-13 15:02:44,098 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:02:44,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-13 15:02:44,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-07-13 15:02:44,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:44,319 INFO L390 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 [2022-07-13 15:02:44,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:44,338 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:02:44,338 INFO L390 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 [2022-07-13 15:02:44,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:44,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:02:44,388 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_978 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_978) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0)) (forall ((v_ArrVal_979 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_979) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0))) is different from false [2022-07-13 15:02:44,686 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:02:44,689 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:02:44,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2022-07-13 15:02:44,695 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:02:44,696 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:02:44,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2022-07-13 15:02:44,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-13 15:02:44,703 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:02:44,705 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-13 15:02:44,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2022-07-13 15:02:44,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:44,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223600202] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:02:44,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:02:44,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-07-13 15:02:44,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802782137] [2022-07-13 15:02:44,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:02:44,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 15:02:44,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:44,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 15:02:44,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=187, Unknown=2, NotChecked=28, Total=272 [2022-07-13 15:02:44,724 INFO L87 Difference]: Start difference. First operand 117 states and 131 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) [2022-07-13 15:02:44,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:44,919 INFO L93 Difference]: Finished difference Result 213 states and 237 transitions. [2022-07-13 15:02:44,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 15:02:44,919 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 [2022-07-13 15:02:44,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:44,920 INFO L225 Difference]: With dead ends: 213 [2022-07-13 15:02:44,920 INFO L226 Difference]: Without dead ends: 153 [2022-07-13 15:02:44,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=292, Unknown=2, NotChecked=36, Total=420 [2022-07-13 15:02:44,921 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 96 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 208 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:44,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 505 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 99 Invalid, 0 Unknown, 208 Unchecked, 0.1s Time] [2022-07-13 15:02:44,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-13 15:02:44,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 138. [2022-07-13 15:02:44,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 134 states have (on average 1.1567164179104477) internal successors, (155), 137 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:44,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 155 transitions. [2022-07-13 15:02:44,926 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 155 transitions. Word has length 36 [2022-07-13 15:02:44,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:44,927 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 155 transitions. [2022-07-13 15:02:44,927 INFO L496 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) [2022-07-13 15:02:44,927 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 155 transitions. [2022-07-13 15:02:44,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 15:02:44,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:44,927 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:44,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 15:02:45,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:02:45,144 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:45,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:45,144 INFO L85 PathProgramCache]: Analyzing trace with hash -431498650, now seen corresponding path program 1 times [2022-07-13 15:02:45,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:45,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022963057] [2022-07-13 15:02:45,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:45,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:45,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:45,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:45,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022963057] [2022-07-13 15:02:45,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022963057] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:45,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:45,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:02:45,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816823200] [2022-07-13 15:02:45,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:45,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:02:45,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:45,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:02:45,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:02:45,210 INFO L87 Difference]: Start difference. First operand 138 states and 155 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) [2022-07-13 15:02:45,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:45,280 INFO L93 Difference]: Finished difference Result 224 states and 254 transitions. [2022-07-13 15:02:45,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:02:45,281 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 [2022-07-13 15:02:45,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:45,282 INFO L225 Difference]: With dead ends: 224 [2022-07-13 15:02:45,282 INFO L226 Difference]: Without dead ends: 147 [2022-07-13 15:02:45,282 INFO L412 NwaCegarLoop]: 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 [2022-07-13 15:02:45,283 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 13 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:45,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 218 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:45,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-13 15:02:45,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 140. [2022-07-13 15:02:45,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 136 states have (on average 1.1544117647058822) internal successors, (157), 139 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 157 transitions. [2022-07-13 15:02:45,289 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 157 transitions. Word has length 36 [2022-07-13 15:02:45,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:45,289 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 157 transitions. [2022-07-13 15:02:45,289 INFO L496 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) [2022-07-13 15:02:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 157 transitions. [2022-07-13 15:02:45,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 15:02:45,290 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:45,290 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:45,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-13 15:02:45,290 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:45,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:45,291 INFO L85 PathProgramCache]: Analyzing trace with hash 589569704, now seen corresponding path program 1 times [2022-07-13 15:02:45,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:45,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026886074] [2022-07-13 15:02:45,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:45,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:45,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:45,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:45,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026886074] [2022-07-13 15:02:45,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026886074] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:02:45,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311997935] [2022-07-13 15:02:45,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:45,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:02:45,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:02:45,468 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 15:02:45,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 15:02:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:45,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-13 15:02:45,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:45,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:02:45,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 15:02:45,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 [2022-07-13 15:02:45,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:45,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-07-13 15:02:45,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:45,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-07-13 15:02:45,691 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 15:02:45,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2022-07-13 15:02:45,702 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 15:02:45,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-13 15:02:45,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:45,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-07-13 15:02:45,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-13 15:02:45,766 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 15:02:45,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-13 15:02:45,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:45,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:45,964 INFO L356 Elim1Store]: treesize reduction 53, result has 8.6 percent of original size [2022-07-13 15:02:45,966 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-13 15:02:45,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 15:02:46,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:02:46,176 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_48| input size 58 context size 58 output size 58 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:182) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:164) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:152) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 15:02:46,180 INFO L158 Benchmark]: Toolchain (without parser) took 7757.30ms. Allocated memory was 111.1MB in the beginning and 201.3MB in the end (delta: 90.2MB). Free memory was 75.7MB in the beginning and 123.3MB in the end (delta: -47.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2022-07-13 15:02:46,180 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 79.7MB. Free memory is still 36.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:02:46,180 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.97ms. Allocated memory is still 111.1MB. Free memory was 75.5MB in the beginning and 75.4MB in the end (delta: 88.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 15:02:46,180 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.90ms. Allocated memory is still 111.1MB. Free memory was 75.4MB in the beginning and 73.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:02:46,180 INFO L158 Benchmark]: Boogie Preprocessor took 23.65ms. Allocated memory is still 111.1MB. Free memory was 73.3MB in the beginning and 71.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:02:46,180 INFO L158 Benchmark]: RCFGBuilder took 481.40ms. Allocated memory is still 111.1MB. Free memory was 71.2MB in the beginning and 51.8MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-13 15:02:46,181 INFO L158 Benchmark]: TraceAbstraction took 6846.66ms. Allocated memory was 111.1MB in the beginning and 201.3MB in the end (delta: 90.2MB). Free memory was 51.3MB in the beginning and 123.3MB in the end (delta: -72.0MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2022-07-13 15:02:46,182 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.15ms. Allocated memory is still 79.7MB. Free memory is still 36.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.97ms. Allocated memory is still 111.1MB. Free memory was 75.5MB in the beginning and 75.4MB in the end (delta: 88.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.90ms. Allocated memory is still 111.1MB. Free memory was 75.4MB in the beginning and 73.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.65ms. Allocated memory is still 111.1MB. Free memory was 73.3MB in the beginning and 71.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 481.40ms. Allocated memory is still 111.1MB. Free memory was 71.2MB in the beginning and 51.8MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6846.66ms. Allocated memory was 111.1MB in the beginning and 201.3MB in the end (delta: 90.2MB). Free memory was 51.3MB in the beginning and 123.3MB in the end (delta: -72.0MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_48| input size 58 context size 58 output size 58 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_48| input size 58 context size 58 output size 58: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 15:02:46,212 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 15:02:47,991 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:02:47,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:02:48,026 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:02:48,026 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:02:48,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:02:48,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:02:48,032 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:02:48,034 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:02:48,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:02:48,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:02:48,040 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:02:48,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:02:48,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:02:48,044 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:02:48,045 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:02:48,046 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:02:48,047 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:02:48,050 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:02:48,051 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:02:48,054 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:02:48,055 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:02:48,055 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:02:48,056 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:02:48,057 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:02:48,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:02:48,061 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:02:48,062 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:02:48,062 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:02:48,062 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:02:48,063 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:02:48,063 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:02:48,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:02:48,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:02:48,066 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:02:48,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:02:48,068 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:02:48,068 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:02:48,068 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:02:48,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:02:48,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:02:48,073 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:02:48,073 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 15:02:48,097 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:02:48,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:02:48,097 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:02:48,097 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:02:48,098 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:02:48,098 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:02:48,098 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:02:48,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:02:48,099 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:02:48,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:02:48,100 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:02:48,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:02:48,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:02:48,100 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:02:48,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:02:48,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:02:48,100 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 15:02:48,101 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 15:02:48,101 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 15:02:48,101 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:02:48,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:02:48,101 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:02:48,101 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:02:48,101 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:02:48,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:02:48,102 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:02:48,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:02:48,102 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:02:48,102 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:02:48,102 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:02:48,103 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 15:02:48,103 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 15:02:48,103 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:02:48,103 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:02:48,103 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:02:48,103 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 15:02:48,103 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d [2022-07-13 15:02:48,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:02:48,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:02:48,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:02:48,369 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:02:48,370 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:02:48,371 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-1.i [2022-07-13 15:02:48,426 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8976b710/ba4d232487f74c55857e6bee3b87a9d7/FLAG46a3be89d [2022-07-13 15:02:48,852 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:02:48,852 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i [2022-07-13 15:02:48,862 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8976b710/ba4d232487f74c55857e6bee3b87a9d7/FLAG46a3be89d [2022-07-13 15:02:48,873 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8976b710/ba4d232487f74c55857e6bee3b87a9d7 [2022-07-13 15:02:48,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:02:48,876 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:02:48,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:02:48,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:02:48,880 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:02:48,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:02:48" (1/1) ... [2022-07-13 15:02:48,881 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4321c63c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:48, skipping insertion in model container [2022-07-13 15:02:48,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:02:48" (1/1) ... [2022-07-13 15:02:48,886 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:02:48,923 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:02:49,128 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-1.i[22034,22047] [2022-07-13 15:02:49,138 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-1.i[22307,22320] [2022-07-13 15:02:49,140 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22516,22529] [2022-07-13 15:02:49,141 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-1.i[22586,22599] [2022-07-13 15:02:49,145 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22853,22866] [2022-07-13 15:02:49,146 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22961,22974] [2022-07-13 15:02:49,150 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-1.i[23192,23205] [2022-07-13 15:02:49,151 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-1.i[23272,23285] [2022-07-13 15:02:49,152 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-1.i[23351,23364] [2022-07-13 15:02:49,152 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-1.i[23441,23454] [2022-07-13 15:02:49,155 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-1.i[23619,23632] [2022-07-13 15:02:49,156 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-1.i[23697,23710] [2022-07-13 15:02:49,156 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-1.i[23774,23787] [2022-07-13 15:02:49,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:02:49,170 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:02:49,195 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-1.i[22034,22047] [2022-07-13 15:02:49,203 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-1.i[22307,22320] [2022-07-13 15:02:49,204 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-1.i[22516,22529] [2022-07-13 15:02:49,206 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-1.i[22586,22599] [2022-07-13 15:02:49,210 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-1.i[22853,22866] [2022-07-13 15:02:49,212 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-1.i[22961,22974] [2022-07-13 15:02:49,214 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-1.i[23192,23205] [2022-07-13 15:02:49,214 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-1.i[23272,23285] [2022-07-13 15:02:49,216 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-1.i[23351,23364] [2022-07-13 15:02:49,217 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-1.i[23441,23454] [2022-07-13 15:02:49,220 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-1.i[23619,23632] [2022-07-13 15:02:49,221 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-1.i[23697,23710] [2022-07-13 15:02:49,221 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-1.i[23774,23787] [2022-07-13 15:02:49,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:02:49,245 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:02:49,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:49 WrapperNode [2022-07-13 15:02:49,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:02:49,246 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:02:49,246 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:02:49,246 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:02:49,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:49" (1/1) ... [2022-07-13 15:02:49,273 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:49" (1/1) ... [2022-07-13 15:02:49,303 INFO L137 Inliner]: procedures = 120, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 219 [2022-07-13 15:02:49,304 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:02:49,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:02:49,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:02:49,305 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:02:49,310 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:49" (1/1) ... [2022-07-13 15:02:49,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:49" (1/1) ... [2022-07-13 15:02:49,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:49" (1/1) ... [2022-07-13 15:02:49,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:49" (1/1) ... [2022-07-13 15:02:49,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:49" (1/1) ... [2022-07-13 15:02:49,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:49" (1/1) ... [2022-07-13 15:02:49,332 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:49" (1/1) ... [2022-07-13 15:02:49,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:02:49,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:02:49,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:02:49,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:02:49,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:49" (1/1) ... [2022-07-13 15:02:49,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:02:49,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:02:49,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 15:02:49,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 15:02:49,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 15:02:49,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:02:49,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 15:02:49,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 15:02:49,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 15:02:49,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 15:02:49,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:02:49,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:02:49,524 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:02:49,525 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:02:49,882 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:02:49,887 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:02:49,887 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-07-13 15:02:49,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:02:49 BoogieIcfgContainer [2022-07-13 15:02:49,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:02:49,890 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:02:49,890 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:02:49,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:02:49,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:02:48" (1/3) ... [2022-07-13 15:02:49,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1129bd5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:02:49, skipping insertion in model container [2022-07-13 15:02:49,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:49" (2/3) ... [2022-07-13 15:02:49,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1129bd5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:02:49, skipping insertion in model container [2022-07-13 15:02:49,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:02:49" (3/3) ... [2022-07-13 15:02:49,894 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2022-07-13 15:02:49,902 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:02:49,903 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2022-07-13 15:02:49,931 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:02:49,935 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@535c4456, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@353451f9 [2022-07-13 15:02:49,935 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-07-13 15:02:49,938 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 66 states have (on average 2.0) internal successors, (132), 79 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:49,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-13 15:02:49,941 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:49,942 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-13 15:02:49,942 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:49,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:49,945 INFO L85 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2022-07-13 15:02:49,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:49,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430565373] [2022-07-13 15:02:49,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:49,953 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:49,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:49,956 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:02:49,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-13 15:02:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:50,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 15:02:50,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:50,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:50,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:50,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:50,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430565373] [2022-07-13 15:02:50,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430565373] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:50,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:50,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:02:50,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048011732] [2022-07-13 15:02:50,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:50,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:02:50,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:50,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:02:50,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:50,067 INFO L87 Difference]: Start difference. First operand has 80 states, 66 states have (on average 2.0) internal successors, (132), 79 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:50,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:50,148 INFO L93 Difference]: Finished difference Result 174 states and 290 transitions. [2022-07-13 15:02:50,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:02:50,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-07-13 15:02:50,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:50,155 INFO L225 Difference]: With dead ends: 174 [2022-07-13 15:02:50,155 INFO L226 Difference]: Without dead ends: 92 [2022-07-13 15:02:50,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:50,160 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 80 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:50,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 99 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:50,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-13 15:02:50,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2022-07-13 15:02:50,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 73 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:50,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2022-07-13 15:02:50,186 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 4 [2022-07-13 15:02:50,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:50,187 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2022-07-13 15:02:50,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:50,187 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-07-13 15:02:50,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 15:02:50,188 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:50,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:50,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-13 15:02:50,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:02:50,393 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:50,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:50,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1534452756, now seen corresponding path program 1 times [2022-07-13 15:02:50,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:50,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [333280444] [2022-07-13 15:02:50,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:50,394 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:50,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:50,395 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:02:50,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-13 15:02:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:50,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 15:02:50,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:50,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 15:02:50,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 15:02:50,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:50,573 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:50,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:50,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [333280444] [2022-07-13 15:02:50,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [333280444] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:50,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:50,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:02:50,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825727527] [2022-07-13 15:02:50,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:50,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:02:50,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:50,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:02:50,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:02:50,579 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:50,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:50,758 INFO L93 Difference]: Finished difference Result 195 states and 217 transitions. [2022-07-13 15:02:50,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:02:50,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-13 15:02:50,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:50,760 INFO L225 Difference]: With dead ends: 195 [2022-07-13 15:02:50,760 INFO L226 Difference]: Without dead ends: 128 [2022-07-13 15:02:50,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:02:50,761 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 56 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:50,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 195 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 15:02:50,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-13 15:02:50,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 76. [2022-07-13 15:02:50,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 64 states have (on average 1.328125) internal successors, (85), 75 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) [2022-07-13 15:02:50,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2022-07-13 15:02:50,769 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 9 [2022-07-13 15:02:50,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:50,769 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2022-07-13 15:02:50,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:50,770 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2022-07-13 15:02:50,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 15:02:50,770 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:50,770 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:50,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-13 15:02:50,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:02:50,978 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:50,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:50,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1534454678, now seen corresponding path program 1 times [2022-07-13 15:02:50,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:50,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [764624111] [2022-07-13 15:02:50,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:50,979 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:50,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:50,987 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:02:50,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-13 15:02:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:51,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 15:02:51,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:51,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 15:02:51,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 15:02:51,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:51,139 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:51,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:51,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [764624111] [2022-07-13 15:02:51,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [764624111] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:51,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:51,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:02:51,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151509094] [2022-07-13 15:02:51,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:51,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:02:51,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:51,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:02:51,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:02:51,143 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:51,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:51,358 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2022-07-13 15:02:51,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:02:51,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-13 15:02:51,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:51,360 INFO L225 Difference]: With dead ends: 129 [2022-07-13 15:02:51,360 INFO L226 Difference]: Without dead ends: 127 [2022-07-13 15:02:51,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:02:51,363 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 53 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:51,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 193 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 15:02:51,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-13 15:02:51,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 77. [2022-07-13 15:02:51,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.323076923076923) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:51,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2022-07-13 15:02:51,375 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 9 [2022-07-13 15:02:51,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:51,375 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2022-07-13 15:02:51,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:51,376 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2022-07-13 15:02:51,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 15:02:51,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:51,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:51,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-13 15:02:51,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:02:51,584 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:51,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:51,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1536301720, now seen corresponding path program 1 times [2022-07-13 15:02:51,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:51,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1213946722] [2022-07-13 15:02:51,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:51,586 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:51,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:51,593 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:02:51,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-13 15:02:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:51,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 15:02:51,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:51,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:51,790 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:51,791 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:51,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1213946722] [2022-07-13 15:02:51,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1213946722] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:51,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:51,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:02:51,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368406609] [2022-07-13 15:02:51,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:51,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:02:51,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:51,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:02:51,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:02:51,796 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:51,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:51,939 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2022-07-13 15:02:51,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:02:51,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-13 15:02:51,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:51,940 INFO L225 Difference]: With dead ends: 78 [2022-07-13 15:02:51,940 INFO L226 Difference]: Without dead ends: 76 [2022-07-13 15:02:51,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:02:51,941 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:51,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 211 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:02:51,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-13 15:02:51,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2022-07-13 15:02:51,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 73 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:51,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2022-07-13 15:02:51,946 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 9 [2022-07-13 15:02:51,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:51,946 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2022-07-13 15:02:51,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:51,946 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-07-13 15:02:51,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 15:02:51,947 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:51,947 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:51,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-13 15:02:52,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:02:52,157 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:52,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:52,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1743237117, now seen corresponding path program 1 times [2022-07-13 15:02:52,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:52,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [739282917] [2022-07-13 15:02:52,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:52,158 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:52,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:52,160 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:02:52,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-13 15:02:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:52,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 15:02:52,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:52,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:52,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:52,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:52,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [739282917] [2022-07-13 15:02:52,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [739282917] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:52,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:52,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:02:52,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309245915] [2022-07-13 15:02:52,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:52,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:02:52,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:52,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:02:52,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:52,231 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:52,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:52,288 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2022-07-13 15:02:52,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:02:52,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-13 15:02:52,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:52,289 INFO L225 Difference]: With dead ends: 76 [2022-07-13 15:02:52,289 INFO L226 Difference]: Without dead ends: 72 [2022-07-13 15:02:52,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:52,290 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 14 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:52,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 119 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:02:52,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-13 15:02:52,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2022-07-13 15:02:52,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 69 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:52,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2022-07-13 15:02:52,294 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 13 [2022-07-13 15:02:52,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:52,294 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2022-07-13 15:02:52,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:52,295 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2022-07-13 15:02:52,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 15:02:52,295 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:52,295 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:52,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-13 15:02:52,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:02:52,503 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:52,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:52,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1794227426, now seen corresponding path program 1 times [2022-07-13 15:02:52,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:52,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [864096167] [2022-07-13 15:02:52,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:52,504 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:52,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:52,505 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:02:52,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-13 15:02:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:52,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 15:02:52,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:52,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:52,581 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:52,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:52,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [864096167] [2022-07-13 15:02:52,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [864096167] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:52,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:52,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:02:52,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996656020] [2022-07-13 15:02:52,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:52,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:02:52,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:52,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:02:52,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:02:52,589 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:52,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:52,723 INFO L93 Difference]: Finished difference Result 129 states and 143 transitions. [2022-07-13 15:02:52,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:02:52,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-13 15:02:52,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:52,724 INFO L225 Difference]: With dead ends: 129 [2022-07-13 15:02:52,724 INFO L226 Difference]: Without dead ends: 109 [2022-07-13 15:02:52,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:02:52,725 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 125 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:52,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 112 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:02:52,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-13 15:02:52,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 69. [2022-07-13 15:02:52,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 61 states have (on average 1.278688524590164) internal successors, (78), 68 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:52,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2022-07-13 15:02:52,729 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 14 [2022-07-13 15:02:52,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:52,730 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2022-07-13 15:02:52,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:52,730 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2022-07-13 15:02:52,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 15:02:52,730 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:52,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:52,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-13 15:02:52,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:02:52,938 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:52,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:52,939 INFO L85 PathProgramCache]: Analyzing trace with hash -140282483, now seen corresponding path program 1 times [2022-07-13 15:02:52,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:52,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687268042] [2022-07-13 15:02:52,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:52,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:52,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:52,941 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:02:52,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-13 15:02:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:52,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 15:02:52,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:52,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:53,000 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:53,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:53,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [687268042] [2022-07-13 15:02:53,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [687268042] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:53,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:53,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:02:53,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146458070] [2022-07-13 15:02:53,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:53,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:02:53,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:53,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:02:53,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:53,001 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:53,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:53,011 INFO L93 Difference]: Finished difference Result 134 states and 152 transitions. [2022-07-13 15:02:53,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:02:53,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-13 15:02:53,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:53,012 INFO L225 Difference]: With dead ends: 134 [2022-07-13 15:02:53,012 INFO L226 Difference]: Without dead ends: 93 [2022-07-13 15:02:53,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:53,013 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 24 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:53,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 143 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:53,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-13 15:02:53,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 72. [2022-07-13 15:02:53,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 64 states have (on average 1.28125) internal successors, (82), 71 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:53,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2022-07-13 15:02:53,017 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 18 [2022-07-13 15:02:53,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:53,017 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2022-07-13 15:02:53,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:53,017 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2022-07-13 15:02:53,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 15:02:53,017 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:53,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:53,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-13 15:02:53,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:02:53,230 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:53,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:53,231 INFO L85 PathProgramCache]: Analyzing trace with hash -53794182, now seen corresponding path program 1 times [2022-07-13 15:02:53,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:53,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251625929] [2022-07-13 15:02:53,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:53,231 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:53,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:53,232 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:02:53,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-13 15:02:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:53,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 15:02:53,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:53,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 15:02:53,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 15:02:53,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 15:02:53,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 15:02:53,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:53,408 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:53,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:53,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251625929] [2022-07-13 15:02:53,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [251625929] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:53,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:53,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:02:53,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936709249] [2022-07-13 15:02:53,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:53,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:02:53,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:53,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:02:53,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:02:53,410 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:53,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:53,772 INFO L93 Difference]: Finished difference Result 180 states and 204 transitions. [2022-07-13 15:02:53,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 15:02:53,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-13 15:02:53,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:53,774 INFO L225 Difference]: With dead ends: 180 [2022-07-13 15:02:53,774 INFO L226 Difference]: Without dead ends: 136 [2022-07-13 15:02:53,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-13 15:02:53,774 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 110 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:53,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 239 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 15:02:53,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-13 15:02:53,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 81. [2022-07-13 15:02:53,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 80 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:53,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2022-07-13 15:02:53,780 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 19 [2022-07-13 15:02:53,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:53,780 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2022-07-13 15:02:53,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:53,780 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2022-07-13 15:02:53,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 15:02:53,781 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:53,781 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:53,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-13 15:02:53,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:02:53,989 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:53,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:53,989 INFO L85 PathProgramCache]: Analyzing trace with hash -746851846, now seen corresponding path program 1 times [2022-07-13 15:02:53,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:53,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [560719587] [2022-07-13 15:02:53,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:53,990 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:53,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:53,991 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:02:53,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-13 15:02:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:54,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 15:02:54,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:54,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:54,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:54,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:54,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [560719587] [2022-07-13 15:02:54,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [560719587] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:54,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:54,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:02:54,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179780144] [2022-07-13 15:02:54,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:54,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:02:54,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:54,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:02:54,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:54,095 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:54,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:54,108 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2022-07-13 15:02:54,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:02:54,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-13 15:02:54,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:54,109 INFO L225 Difference]: With dead ends: 81 [2022-07-13 15:02:54,109 INFO L226 Difference]: Without dead ends: 79 [2022-07-13 15:02:54,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:54,110 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 13 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:54,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 123 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:54,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-13 15:02:54,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-07-13 15:02:54,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 72 states have (on average 1.25) internal successors, (90), 78 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:54,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2022-07-13 15:02:54,114 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 19 [2022-07-13 15:02:54,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:54,114 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2022-07-13 15:02:54,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:54,114 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2022-07-13 15:02:54,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 15:02:54,115 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:54,115 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:54,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-07-13 15:02:54,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:02:54,323 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:54,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:54,324 INFO L85 PathProgramCache]: Analyzing trace with hash -169331172, now seen corresponding path program 1 times [2022-07-13 15:02:54,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:54,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134456220] [2022-07-13 15:02:54,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:54,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:54,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:54,326 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:02:54,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-13 15:02:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:54,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 15:02:54,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:54,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 15:02:54,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 15:02:54,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:54,453 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:54,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:54,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134456220] [2022-07-13 15:02:54,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134456220] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:54,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:54,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:02:54,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525601208] [2022-07-13 15:02:54,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:54,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:02:54,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:54,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:02:54,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:02:54,455 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:54,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:54,624 INFO L93 Difference]: Finished difference Result 145 states and 166 transitions. [2022-07-13 15:02:54,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:02:54,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-13 15:02:54,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:54,625 INFO L225 Difference]: With dead ends: 145 [2022-07-13 15:02:54,625 INFO L226 Difference]: Without dead ends: 87 [2022-07-13 15:02:54,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:02:54,626 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 6 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:54,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 185 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 15:02:54,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-13 15:02:54,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2022-07-13 15:02:54,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 80 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:54,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2022-07-13 15:02:54,629 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 20 [2022-07-13 15:02:54,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:54,629 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2022-07-13 15:02:54,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:54,630 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2022-07-13 15:02:54,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 15:02:54,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:54,630 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:54,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-13 15:02:54,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:02:54,838 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:54,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:54,838 INFO L85 PathProgramCache]: Analyzing trace with hash -169329250, now seen corresponding path program 1 times [2022-07-13 15:02:54,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:54,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740424399] [2022-07-13 15:02:54,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:54,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:54,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:54,840 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:02:54,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-13 15:02:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:54,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 15:02:54,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:54,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 15:02:54,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 15:02:54,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:54,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:54,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:54,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740424399] [2022-07-13 15:02:54,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [740424399] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:54,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:54,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:02:54,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88128244] [2022-07-13 15:02:54,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:54,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:02:54,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:54,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:02:54,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:02:54,955 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:55,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:55,214 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2022-07-13 15:02:55,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:02:55,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-13 15:02:55,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:55,215 INFO L225 Difference]: With dead ends: 88 [2022-07-13 15:02:55,215 INFO L226 Difference]: Without dead ends: 86 [2022-07-13 15:02:55,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:02:55,216 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 3 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:55,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 183 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 15:02:55,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-13 15:02:55,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2022-07-13 15:02:55,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 75 states have (on average 1.24) internal successors, (93), 81 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:55,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2022-07-13 15:02:55,219 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 20 [2022-07-13 15:02:55,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:55,219 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2022-07-13 15:02:55,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:55,219 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2022-07-13 15:02:55,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 15:02:55,219 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:55,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:55,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-13 15:02:55,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:02:55,420 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:55,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:55,420 INFO L85 PathProgramCache]: Analyzing trace with hash -167482208, now seen corresponding path program 1 times [2022-07-13 15:02:55,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:55,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [742575001] [2022-07-13 15:02:55,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:55,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:55,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:55,422 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:02:55,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-13 15:02:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:55,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 15:02:55,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:55,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:55,608 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:55,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:55,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [742575001] [2022-07-13 15:02:55,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [742575001] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:55,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:55,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:02:55,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539525285] [2022-07-13 15:02:55,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:55,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:02:55,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:55,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:02:55,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:02:55,609 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:55,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:55,758 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2022-07-13 15:02:55,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:02:55,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-13 15:02:55,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:55,759 INFO L225 Difference]: With dead ends: 83 [2022-07-13 15:02:55,759 INFO L226 Difference]: Without dead ends: 81 [2022-07-13 15:02:55,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:02:55,760 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 1 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:55,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 173 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:02:55,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-13 15:02:55,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2022-07-13 15:02:55,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 73 states have (on average 1.2328767123287672) internal successors, (90), 78 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:55,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2022-07-13 15:02:55,763 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 20 [2022-07-13 15:02:55,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:55,763 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2022-07-13 15:02:55,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:55,763 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2022-07-13 15:02:55,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 15:02:55,763 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:55,763 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:55,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-13 15:02:55,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:02:55,964 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:02:55,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:55,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1528659518, now seen corresponding path program 1 times [2022-07-13 15:02:55,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:55,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65844855] [2022-07-13 15:02:55,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:55,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:55,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:55,967 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:02:55,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-13 15:02:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:56,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-13 15:02:56,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:56,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 15:02:56,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:56,776 INFO L356 Elim1Store]: treesize reduction 23, result has 56.6 percent of original size [2022-07-13 15:02:56,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 348 treesize of output 341 [2022-07-13 15:02:56,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:57,301 INFO L356 Elim1Store]: treesize reduction 23, result has 56.6 percent of original size [2022-07-13 15:02:57,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 227 treesize of output 220 [2022-07-13 15:02:57,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:57,506 INFO L356 Elim1Store]: treesize reduction 110, result has 13.4 percent of original size [2022-07-13 15:02:57,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 118 treesize of output 166 [2022-07-13 15:02:57,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:57,629 INFO L356 Elim1Store]: treesize reduction 110, result has 13.4 percent of original size [2022-07-13 15:02:57,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 118 treesize of output 166 [2022-07-13 15:02:57,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 67 [2022-07-13 15:02:57,763 INFO L356 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-07-13 15:02:57,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 87 [2022-07-13 15:02:57,821 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:02:57,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 15:02:57,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 15:02:57,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 15:02:57,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 15:02:58,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 15:02:58,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-13 15:02:58,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 70 [2022-07-13 15:02:59,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-13 15:03:00,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 42 [2022-07-13 15:03:00,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 42 [2022-07-13 15:03:00,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 31 treesize of output 24 [2022-07-13 15:03:02,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 59 [2022-07-13 15:03:03,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-07-13 15:03:03,198 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:03:03,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21