./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 15:02:37,951 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:02:37,953 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:02:37,998 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:02:37,998 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:02:38,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:02:38,001 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:02:38,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:02:38,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:02:38,009 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:02:38,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:02:38,012 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:02:38,012 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:02:38,014 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:02:38,015 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:02:38,018 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:02:38,019 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:02:38,020 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:02:38,021 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:02:38,026 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:02:38,028 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:02:38,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:02:38,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:02:38,030 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:02:38,032 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:02:38,038 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:02:38,038 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:02:38,038 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:02:38,039 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:02:38,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:02:38,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:02:38,041 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:02:38,043 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:02:38,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:02:38,044 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:02:38,045 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:02:38,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:02:38,046 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:02:38,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:02:38,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:02:38,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:02:38,049 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:02:38,050 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:38,077 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:02:38,078 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:02:38,078 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:02:38,078 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:02:38,079 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:02:38,079 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:02:38,080 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:02:38,080 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:02:38,080 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:02:38,081 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:02:38,081 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:02:38,081 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 15:02:38,081 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:02:38,082 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:02:38,082 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:02:38,082 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:02:38,082 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:02:38,082 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:02:38,083 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:02:38,084 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:02:38,084 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:02:38,084 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:02:38,084 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:02:38,085 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:02:38,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:02:38,085 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:02:38,085 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:02:38,085 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:02:38,086 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 15:02:38,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 15:02:38,086 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:02:38,086 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:02:38,086 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:02:38,087 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a [2022-07-13 15:02:38,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:02:38,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:02:38,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:02:38,332 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:02:38,333 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:02:38,334 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-2.i [2022-07-13 15:02:38,395 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce4612d15/fccf302825f94be6a3f30053900e1828/FLAGbc881361c [2022-07-13 15:02:38,823 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:02:38,823 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i [2022-07-13 15:02:38,837 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce4612d15/fccf302825f94be6a3f30053900e1828/FLAGbc881361c [2022-07-13 15:02:38,854 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce4612d15/fccf302825f94be6a3f30053900e1828 [2022-07-13 15:02:38,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:02:38,857 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:02:38,860 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:02:38,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:02:38,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:02:38,863 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,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b8b7ba8 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,864 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,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:02:38,916 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:02:39,200 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2022-07-13 15:02:39,207 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2022-07-13 15:02:39,209 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2022-07-13 15:02:39,209 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2022-07-13 15:02:39,211 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2022-07-13 15:02:39,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-2.i[22961,22974] [2022-07-13 15:02:39,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-2.i[23192,23205] [2022-07-13 15:02:39,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-2.i[23272,23285] [2022-07-13 15:02:39,219 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2022-07-13 15:02:39,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-2.i[23484,23497] [2022-07-13 15:02:39,222 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2022-07-13 15:02:39,225 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2022-07-13 15:02:39,225 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2022-07-13 15:02:39,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:02:39,241 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:02:39,278 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2022-07-13 15:02:39,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2022-07-13 15:02:39,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2022-07-13 15:02:39,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2022-07-13 15:02:39,283 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2022-07-13 15:02:39,284 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2022-07-13 15:02:39,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2022-07-13 15:02:39,286 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2022-07-13 15:02:39,286 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2022-07-13 15:02:39,287 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2022-07-13 15:02:39,288 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2022-07-13 15:02:39,289 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2022-07-13 15:02:39,289 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2022-07-13 15:02:39,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:02:39,312 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:02:39,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:39 WrapperNode [2022-07-13 15:02:39,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:02:39,313 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:02:39,313 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:02:39,314 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:02:39,319 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:39" (1/1) ... [2022-07-13 15:02:39,345 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:39" (1/1) ... [2022-07-13 15:02:39,375 INFO L137 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 225 [2022-07-13 15:02:39,377 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:02:39,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:02:39,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:02:39,378 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:02:39,385 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:39" (1/1) ... [2022-07-13 15:02:39,386 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:39" (1/1) ... [2022-07-13 15:02:39,405 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:39" (1/1) ... [2022-07-13 15:02:39,406 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:39" (1/1) ... [2022-07-13 15:02:39,412 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:39" (1/1) ... [2022-07-13 15:02:39,417 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:39" (1/1) ... [2022-07-13 15:02:39,419 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:39" (1/1) ... [2022-07-13 15:02:39,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:02:39,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:02:39,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:02:39,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:02:39,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:39" (1/1) ... [2022-07-13 15:02:39,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:02:39,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:02:39,460 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:39,485 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:39,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 15:02:39,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:02:39,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 15:02:39,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 15:02:39,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 15:02:39,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 15:02:39,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:02:39,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:02:39,632 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:02:39,648 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:02:39,979 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:02:39,986 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:02:39,988 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-07-13 15:02:39,990 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,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:02:40,012 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:02:40,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:02:40,016 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:02:40,016 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:40,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39db038f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:02:40, skipping insertion in model container [2022-07-13 15:02:40,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:39" (2/3) ... [2022-07-13 15:02:40,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39db038f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:02:40, skipping insertion in model container [2022-07-13 15:02:40,018 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:40,019 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2022-07-13 15:02:40,041 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:02:40,041 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2022-07-13 15:02:40,093 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:02:40,099 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@69274f3a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4401fa4d [2022-07-13 15:02:40,099 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-07-13 15:02:40,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 70 states have (on average 1.957142857142857) internal successors, (137), 83 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:40,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-13 15:02:40,108 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:40,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-13 15:02:40,109 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:40,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:40,115 INFO L85 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2022-07-13 15:02:40,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:40,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806468517] [2022-07-13 15:02:40,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:40,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:40,263 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,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:40,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806468517] [2022-07-13 15:02:40,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806468517] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:40,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:40,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:02:40,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434570285] [2022-07-13 15:02:40,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:40,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:02:40,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:40,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:02:40,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:40,297 INFO L87 Difference]: Start difference. First operand has 84 states, 70 states have (on average 1.957142857142857) internal successors, (137), 83 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:40,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:40,364 INFO L93 Difference]: Finished difference Result 182 states and 300 transitions. [2022-07-13 15:02:40,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:02:40,366 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:40,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:40,374 INFO L225 Difference]: With dead ends: 182 [2022-07-13 15:02:40,375 INFO L226 Difference]: Without dead ends: 96 [2022-07-13 15:02:40,378 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,382 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 85 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:40,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 104 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:40,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-13 15:02:40,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2022-07-13 15:02:40,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 77 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2022-07-13 15:02:40,426 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 4 [2022-07-13 15:02:40,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:40,426 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2022-07-13 15:02:40,427 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:40,427 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2022-07-13 15:02:40,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 15:02:40,427 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:40,427 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:40,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 15:02:40,428 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:40,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:40,428 INFO L85 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2022-07-13 15:02:40,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:40,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872518058] [2022-07-13 15:02:40,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:40,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:40,469 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,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:40,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872518058] [2022-07-13 15:02:40,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872518058] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:40,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:40,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:02:40,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594449792] [2022-07-13 15:02:40,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:40,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:02:40,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:40,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:02:40,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:40,472 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:40,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:40,485 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2022-07-13 15:02:40,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:02:40,486 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:40,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:40,487 INFO L225 Difference]: With dead ends: 81 [2022-07-13 15:02:40,487 INFO L226 Difference]: Without dead ends: 79 [2022-07-13 15:02:40,488 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,489 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:40,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 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:40,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-13 15:02:40,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-07-13 15:02:40,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 67 states have (on average 1.328358208955224) internal successors, (89), 78 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:40,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2022-07-13 15:02:40,496 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 10 [2022-07-13 15:02:40,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:40,496 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2022-07-13 15:02:40,497 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:40,497 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2022-07-13 15:02:40,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 15:02:40,497 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:40,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:40,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 15:02:40,498 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:40,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:40,499 INFO L85 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2022-07-13 15:02:40,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:40,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389472984] [2022-07-13 15:02:40,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:40,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:40,560 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,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:40,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389472984] [2022-07-13 15:02:40,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389472984] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:40,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:40,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:02:40,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010862018] [2022-07-13 15:02:40,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:40,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:02:40,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:40,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:02:40,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:02:40,563 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:40,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:40,612 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2022-07-13 15:02:40,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:02:40,612 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:40,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:40,613 INFO L225 Difference]: With dead ends: 80 [2022-07-13 15:02:40,613 INFO L226 Difference]: Without dead ends: 78 [2022-07-13 15:02:40,614 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,615 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:40,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 144 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:40,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-13 15:02:40,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2022-07-13 15:02:40,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.323076923076923) internal successors, (86), 75 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:40,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2022-07-13 15:02:40,620 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 10 [2022-07-13 15:02:40,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:40,621 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2022-07-13 15:02:40,621 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:40,621 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2022-07-13 15:02:40,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 15:02:40,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:40,622 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:40,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 15:02:40,622 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:40,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:40,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1712619113, now seen corresponding path program 1 times [2022-07-13 15:02:40,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:40,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294732058] [2022-07-13 15:02:40,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:40,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:40,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:02:40,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:40,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294732058] [2022-07-13 15:02:40,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294732058] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:40,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:40,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:02:40,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604482016] [2022-07-13 15:02:40,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:40,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:02:40,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:40,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:02:40,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:40,679 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:40,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:40,715 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2022-07-13 15:02:40,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:02:40,716 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,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:40,716 INFO L225 Difference]: With dead ends: 79 [2022-07-13 15:02:40,716 INFO L226 Difference]: Without dead ends: 75 [2022-07-13 15:02:40,717 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,718 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 16 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:40,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 129 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,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-13 15:02:40,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2022-07-13 15:02:40,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 71 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:40,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2022-07-13 15:02:40,723 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 15 [2022-07-13 15:02:40,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:40,723 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2022-07-13 15:02:40,723 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,723 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2022-07-13 15:02:40,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 15:02:40,724 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:40,724 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,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 15:02:40,724 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,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:40,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1551589151, now seen corresponding path program 1 times [2022-07-13 15:02:40,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:40,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890987309] [2022-07-13 15:02:40,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:40,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:40,777 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,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:40,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890987309] [2022-07-13 15:02:40,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890987309] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:40,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:40,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:02:40,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910577716] [2022-07-13 15:02:40,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:40,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:02:40,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:40,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:02:40,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:02:40,779 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:40,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:40,848 INFO L93 Difference]: Finished difference Result 190 states and 215 transitions. [2022-07-13 15:02:40,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:02:40,849 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,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:40,850 INFO L225 Difference]: With dead ends: 190 [2022-07-13 15:02:40,850 INFO L226 Difference]: Without dead ends: 126 [2022-07-13 15:02:40,851 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,851 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 57 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:40,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 190 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:02:40,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-13 15:02:40,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 74. [2022-07-13 15:02:40,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 73 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:40,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2022-07-13 15:02:40,857 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 16 [2022-07-13 15:02:40,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:40,857 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2022-07-13 15:02:40,857 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,857 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2022-07-13 15:02:40,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 15:02:40,858 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:40,858 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,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 15:02:40,858 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,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:40,859 INFO L85 PathProgramCache]: Analyzing trace with hash -2063319775, now seen corresponding path program 1 times [2022-07-13 15:02:40,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:40,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369177007] [2022-07-13 15:02:40,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:40,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:40,900 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,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:40,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369177007] [2022-07-13 15:02:40,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369177007] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:40,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:40,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:02:40,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319301557] [2022-07-13 15:02:40,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:40,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:02:40,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:40,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:02:40,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:02:40,902 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:40,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:40,963 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2022-07-13 15:02:40,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:02:40,963 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,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:40,964 INFO L225 Difference]: With dead ends: 134 [2022-07-13 15:02:40,964 INFO L226 Difference]: Without dead ends: 114 [2022-07-13 15:02:40,965 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,965 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 134 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:40,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 120 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:40,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-13 15:02:40,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 73. [2022-07-13 15:02:40,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 72 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:40,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2022-07-13 15:02:40,970 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 16 [2022-07-13 15:02:40,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:40,970 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2022-07-13 15:02:40,970 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,971 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2022-07-13 15:02:40,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 15:02:40,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:40,971 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,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 15:02:40,972 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,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:40,972 INFO L85 PathProgramCache]: Analyzing trace with hash -940628020, now seen corresponding path program 1 times [2022-07-13 15:02:40,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:40,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248858458] [2022-07-13 15:02:40,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:40,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:41,001 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,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:41,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248858458] [2022-07-13 15:02:41,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248858458] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:41,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:41,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:02:41,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677064086] [2022-07-13 15:02:41,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:41,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:02:41,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:41,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:02:41,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:41,004 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:41,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:41,016 INFO L93 Difference]: Finished difference Result 139 states and 159 transitions. [2022-07-13 15:02:41,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:02:41,016 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:41,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:41,017 INFO L225 Difference]: With dead ends: 139 [2022-07-13 15:02:41,017 INFO L226 Difference]: Without dead ends: 97 [2022-07-13 15:02:41,018 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,018 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 24 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:41,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 151 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:41,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-13 15:02:41,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2022-07-13 15:02:41,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 75 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:41,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2022-07-13 15:02:41,023 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 20 [2022-07-13 15:02:41,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:41,023 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2022-07-13 15:02:41,023 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:41,024 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2022-07-13 15:02:41,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 15:02:41,024 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:41,024 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:41,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 15:02:41,025 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:41,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:41,025 INFO L85 PathProgramCache]: Analyzing trace with hash 905291998, now seen corresponding path program 1 times [2022-07-13 15:02:41,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:41,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653573522] [2022-07-13 15:02:41,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:41,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:41,058 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,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:41,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653573522] [2022-07-13 15:02:41,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653573522] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:41,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:41,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:02:41,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716235104] [2022-07-13 15:02:41,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:41,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:02:41,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:41,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:02:41,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:41,060 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:41,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:41,075 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2022-07-13 15:02:41,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:02:41,076 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:41,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:41,077 INFO L225 Difference]: With dead ends: 76 [2022-07-13 15:02:41,077 INFO L226 Difference]: Without dead ends: 74 [2022-07-13 15:02:41,077 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,078 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 13 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:41,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 132 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:41,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-13 15:02:41,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-07-13 15:02:41,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 73 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:41,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2022-07-13 15:02:41,082 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 21 [2022-07-13 15:02:41,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:41,083 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2022-07-13 15:02:41,083 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:41,083 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2022-07-13 15:02:41,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 15:02:41,084 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:41,084 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:41,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 15:02:41,084 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:41,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:41,085 INFO L85 PathProgramCache]: Analyzing trace with hash 886650935, now seen corresponding path program 1 times [2022-07-13 15:02:41,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:41,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21303342] [2022-07-13 15:02:41,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:41,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:41,137 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,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:41,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21303342] [2022-07-13 15:02:41,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21303342] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:41,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:41,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:02:41,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739270944] [2022-07-13 15:02:41,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:41,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:02:41,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:41,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:02:41,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:02:41,140 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:41,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:41,201 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2022-07-13 15:02:41,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:02:41,201 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:41,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:41,202 INFO L225 Difference]: With dead ends: 75 [2022-07-13 15:02:41,202 INFO L226 Difference]: Without dead ends: 73 [2022-07-13 15:02:41,202 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:41,203 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:41,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 116 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:02:41,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-13 15:02:41,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2022-07-13 15:02:41,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 71 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:41,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2022-07-13 15:02:41,207 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 23 [2022-07-13 15:02:41,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:41,208 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2022-07-13 15:02:41,208 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:41,208 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2022-07-13 15:02:41,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 15:02:41,209 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:41,209 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:41,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 15:02:41,210 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:41,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:41,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1458355201, now seen corresponding path program 1 times [2022-07-13 15:02:41,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:41,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332599971] [2022-07-13 15:02:41,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:41,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:41,337 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,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:41,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332599971] [2022-07-13 15:02:41,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332599971] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:41,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:41,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 15:02:41,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980899553] [2022-07-13 15:02:41,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:41,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 15:02:41,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:41,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 15:02:41,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:02:41,340 INFO L87 Difference]: Start difference. First operand 72 states and 83 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,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:41,583 INFO L93 Difference]: Finished difference Result 202 states and 231 transitions. [2022-07-13 15:02:41,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 15:02:41,584 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,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:41,585 INFO L225 Difference]: With dead ends: 202 [2022-07-13 15:02:41,585 INFO L226 Difference]: Without dead ends: 159 [2022-07-13 15:02:41,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-07-13 15:02:41,586 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 310 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:41,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 244 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:02:41,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-13 15:02:41,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 94. [2022-07-13 15:02:41,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 93 states have internal predecessors, (109), 0 states have call successors, (0), 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,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 109 transitions. [2022-07-13 15:02:41,591 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 109 transitions. Word has length 24 [2022-07-13 15:02:41,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:41,591 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 109 transitions. [2022-07-13 15:02:41,592 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,592 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2022-07-13 15:02:41,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 15:02:41,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:41,593 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:41,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 15:02:41,593 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:41,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:41,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1357759361, now seen corresponding path program 1 times [2022-07-13 15:02:41,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:41,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560027664] [2022-07-13 15:02:41,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:41,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:41,843 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,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:41,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560027664] [2022-07-13 15:02:41,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560027664] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:41,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:41,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 15:02:41,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031505104] [2022-07-13 15:02:41,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:41,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 15:02:41,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:41,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 15:02:41,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:02:41,846 INFO L87 Difference]: Start difference. First operand 94 states and 109 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:42,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:42,195 INFO L93 Difference]: Finished difference Result 249 states and 280 transitions. [2022-07-13 15:02:42,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 15:02:42,199 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:42,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:42,202 INFO L225 Difference]: With dead ends: 249 [2022-07-13 15:02:42,202 INFO L226 Difference]: Without dead ends: 247 [2022-07-13 15:02:42,202 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:42,203 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 253 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:42,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 426 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 15:02:42,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-13 15:02:42,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 106. [2022-07-13 15:02:42,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 100 states have (on average 1.23) internal successors, (123), 105 states have internal predecessors, (123), 0 states have call successors, (0), 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,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 123 transitions. [2022-07-13 15:02:42,215 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 123 transitions. Word has length 24 [2022-07-13 15:02:42,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:42,215 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 123 transitions. [2022-07-13 15:02:42,216 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:42,216 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2022-07-13 15:02:42,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 15:02:42,221 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:42,221 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:42,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 15:02:42,222 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:42,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:42,222 INFO L85 PathProgramCache]: Analyzing trace with hash -545310703, now seen corresponding path program 1 times [2022-07-13 15:02:42,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:42,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831553188] [2022-07-13 15:02:42,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:42,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:42,297 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:42,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:42,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831553188] [2022-07-13 15:02:42,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831553188] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:42,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:42,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:02:42,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080620639] [2022-07-13 15:02:42,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:42,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:02:42,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:42,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:02:42,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:02:42,299 INFO L87 Difference]: Start difference. First operand 106 states and 123 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:42,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:42,378 INFO L93 Difference]: Finished difference Result 158 states and 182 transitions. [2022-07-13 15:02:42,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:02:42,379 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:42,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:42,380 INFO L225 Difference]: With dead ends: 158 [2022-07-13 15:02:42,380 INFO L226 Difference]: Without dead ends: 140 [2022-07-13 15:02:42,380 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:42,381 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 61 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:42,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 193 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:02:42,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-13 15:02:42,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 132. [2022-07-13 15:02:42,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 126 states have (on average 1.246031746031746) internal successors, (157), 131 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:42,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 157 transitions. [2022-07-13 15:02:42,403 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 157 transitions. Word has length 26 [2022-07-13 15:02:42,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:42,403 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 157 transitions. [2022-07-13 15:02:42,404 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:42,404 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 157 transitions. [2022-07-13 15:02:42,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 15:02:42,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:42,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] [2022-07-13 15:02:42,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 15:02:42,407 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:42,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:42,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1566334865, now seen corresponding path program 1 times [2022-07-13 15:02:42,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:42,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045483809] [2022-07-13 15:02:42,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:42,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:42,480 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:42,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:42,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045483809] [2022-07-13 15:02:42,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045483809] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:42,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:42,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:02:42,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986858190] [2022-07-13 15:02:42,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:42,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:02:42,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:42,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:02:42,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:42,483 INFO L87 Difference]: Start difference. First operand 132 states and 157 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:42,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:42,521 INFO L93 Difference]: Finished difference Result 132 states and 157 transitions. [2022-07-13 15:02:42,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:02:42,521 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:42,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:42,522 INFO L225 Difference]: With dead ends: 132 [2022-07-13 15:02:42,522 INFO L226 Difference]: Without dead ends: 130 [2022-07-13 15:02:42,523 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,524 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 51 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:42,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 78 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:42,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-13 15:02:42,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-07-13 15:02:42,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 125 states have (on average 1.24) internal successors, (155), 129 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:42,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 155 transitions. [2022-07-13 15:02:42,533 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 155 transitions. Word has length 26 [2022-07-13 15:02:42,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:42,533 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 155 transitions. [2022-07-13 15:02:42,534 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:42,534 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 155 transitions. [2022-07-13 15:02:42,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 15:02:42,535 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:42,536 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:42,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 15:02:42,538 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:42,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:42,538 INFO L85 PathProgramCache]: Analyzing trace with hash -988757936, now seen corresponding path program 1 times [2022-07-13 15:02:42,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:42,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495602965] [2022-07-13 15:02:42,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:42,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:42,751 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:42,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:42,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495602965] [2022-07-13 15:02:42,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495602965] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:42,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:42,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 15:02:42,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953381728] [2022-07-13 15:02:42,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:42,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 15:02:42,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:42,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 15:02:42,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:02:42,755 INFO L87 Difference]: Start difference. First operand 130 states and 155 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:43,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:43,054 INFO L93 Difference]: Finished difference Result 290 states and 338 transitions. [2022-07-13 15:02:43,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 15:02:43,055 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:43,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:43,056 INFO L225 Difference]: With dead ends: 290 [2022-07-13 15:02:43,056 INFO L226 Difference]: Without dead ends: 288 [2022-07-13 15:02:43,056 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:43,057 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 258 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:43,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 390 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 15:02:43,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-07-13 15:02:43,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 133. [2022-07-13 15:02:43,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.234375) internal successors, (158), 132 states have internal predecessors, (158), 0 states have call successors, (0), 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,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 158 transitions. [2022-07-13 15:02:43,065 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 158 transitions. Word has length 27 [2022-07-13 15:02:43,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:43,065 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 158 transitions. [2022-07-13 15:02:43,065 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:43,066 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 158 transitions. [2022-07-13 15:02:43,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 15:02:43,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:43,066 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:43,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 15:02:43,066 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:43,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:43,067 INFO L85 PathProgramCache]: Analyzing trace with hash 2026653164, now seen corresponding path program 1 times [2022-07-13 15:02:43,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:43,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717074682] [2022-07-13 15:02:43,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:43,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:43,113 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:43,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:43,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717074682] [2022-07-13 15:02:43,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717074682] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:02:43,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070130687] [2022-07-13 15:02:43,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:43,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:02:43,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:02:43,119 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:43,128 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:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:43,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-13 15:02:43,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:43,285 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,290 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,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:43,327 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,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:43,336 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,432 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,435 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,439 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:43,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:02:43,528 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:43,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070130687] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:02:43,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:02:43,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-07-13 15:02:43,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225580557] [2022-07-13 15:02:43,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:02:43,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 15:02:43,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:43,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 15:02:43,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:02:43,530 INFO L87 Difference]: Start difference. First operand 133 states and 158 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:43,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:43,677 INFO L93 Difference]: Finished difference Result 220 states and 257 transitions. [2022-07-13 15:02:43,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 15:02:43,677 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:43,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:43,678 INFO L225 Difference]: With dead ends: 220 [2022-07-13 15:02:43,678 INFO L226 Difference]: Without dead ends: 158 [2022-07-13 15:02:43,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-13 15:02:43,679 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 121 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:43,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 213 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:02:43,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-13 15:02:43,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 135. [2022-07-13 15:02:43,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.2153846153846153) internal successors, (158), 134 states have internal predecessors, (158), 0 states have call successors, (0), 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,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 158 transitions. [2022-07-13 15:02:43,686 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 158 transitions. Word has length 29 [2022-07-13 15:02:43,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:43,687 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 158 transitions. [2022-07-13 15:02:43,687 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:43,687 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 158 transitions. [2022-07-13 15:02:43,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 15:02:43,687 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:43,687 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:43,726 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:43,899 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:43,900 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:43,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:43,900 INFO L85 PathProgramCache]: Analyzing trace with hash -2133518130, now seen corresponding path program 1 times [2022-07-13 15:02:43,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:43,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449704362] [2022-07-13 15:02:43,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:43,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:44,099 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:44,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:44,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449704362] [2022-07-13 15:02:44,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449704362] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:44,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:44,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 15:02:44,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569543931] [2022-07-13 15:02:44,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:44,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:02:44,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:44,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:02:44,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:02:44,101 INFO L87 Difference]: Start difference. First operand 135 states and 158 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:44,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:44,241 INFO L93 Difference]: Finished difference Result 178 states and 200 transitions. [2022-07-13 15:02:44,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:02:44,242 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:44,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:44,242 INFO L225 Difference]: With dead ends: 178 [2022-07-13 15:02:44,242 INFO L226 Difference]: Without dead ends: 158 [2022-07-13 15:02:44,243 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:44,243 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 158 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:44,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 217 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:02:44,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-13 15:02:44,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 134. [2022-07-13 15:02:44,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 129 states have (on average 1.2093023255813953) internal successors, (156), 133 states have internal predecessors, (156), 0 states have call successors, (0), 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,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2022-07-13 15:02:44,250 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 29 [2022-07-13 15:02:44,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:44,250 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2022-07-13 15:02:44,250 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:44,251 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2022-07-13 15:02:44,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-13 15:02:44,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:44,251 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:44,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 15:02:44,251 INFO L420 AbstractCegarLoop]: === Iteration 17 === 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:44,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:44,252 INFO L85 PathProgramCache]: Analyzing trace with hash 830518973, now seen corresponding path program 1 times [2022-07-13 15:02:44,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:44,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544691152] [2022-07-13 15:02:44,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:44,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:44,337 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:44,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:44,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544691152] [2022-07-13 15:02:44,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544691152] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:02:44,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611063021] [2022-07-13 15:02:44,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:44,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:02:44,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:02:44,340 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:44,343 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:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:44,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-13 15:02:44,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:44,452 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:44,456 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:44,493 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-13 15:02:44,494 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:44,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:44,499 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:44,577 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:44,582 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:44,585 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:44,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:02:44,683 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:44,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611063021] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:02:44,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:02:44,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2022-07-13 15:02:44,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911123790] [2022-07-13 15:02:44,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:02:44,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:02:44,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:44,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:02:44,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:02:44,686 INFO L87 Difference]: Start difference. First operand 134 states and 156 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:44,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:44,837 INFO L93 Difference]: Finished difference Result 223 states and 253 transitions. [2022-07-13 15:02:44,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 15:02:44,838 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:44,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:44,838 INFO L225 Difference]: With dead ends: 223 [2022-07-13 15:02:44,839 INFO L226 Difference]: Without dead ends: 192 [2022-07-13 15:02:44,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-13 15:02:44,840 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 99 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:44,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 306 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:02:44,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-13 15:02:44,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 151. [2022-07-13 15:02:44,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 146 states have (on average 1.2397260273972603) internal successors, (181), 150 states have internal predecessors, (181), 0 states have call successors, (0), 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,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 181 transitions. [2022-07-13 15:02:44,848 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 181 transitions. Word has length 32 [2022-07-13 15:02:44,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:44,848 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 181 transitions. [2022-07-13 15:02:44,848 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:44,848 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 181 transitions. [2022-07-13 15:02:44,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-13 15:02:44,849 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:44,849 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, 1] [2022-07-13 15:02:44,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-13 15:02:45,049 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,SelfDestructingSolverStorable16 [2022-07-13 15:02:45,050 INFO L420 AbstractCegarLoop]: === Iteration 18 === 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:45,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:45,050 INFO L85 PathProgramCache]: Analyzing trace with hash -60835504, now seen corresponding path program 1 times [2022-07-13 15:02:45,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:45,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789842056] [2022-07-13 15:02:45,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:45,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:45,104 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:45,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:45,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789842056] [2022-07-13 15:02:45,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789842056] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:45,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:45,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:02:45,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801490170] [2022-07-13 15:02:45,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:45,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:02:45,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:45,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:02:45,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:45,106 INFO L87 Difference]: Start difference. First operand 151 states and 181 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:45,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:45,123 INFO L93 Difference]: Finished difference Result 310 states and 380 transitions. [2022-07-13 15:02:45,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:02:45,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-13 15:02:45,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:45,125 INFO L225 Difference]: With dead ends: 310 [2022-07-13 15:02:45,125 INFO L226 Difference]: Without dead ends: 228 [2022-07-13 15:02:45,126 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:45,126 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 26 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:45,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 161 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:45,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-07-13 15:02:45,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 188. [2022-07-13 15:02:45,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 183 states have (on average 1.2404371584699454) internal successors, (227), 187 states have internal predecessors, (227), 0 states have call successors, (0), 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,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 227 transitions. [2022-07-13 15:02:45,135 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 227 transitions. Word has length 32 [2022-07-13 15:02:45,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:45,136 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 227 transitions. [2022-07-13 15:02:45,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:45,136 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 227 transitions. [2022-07-13 15:02:45,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 15:02:45,137 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:45,137 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,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 15:02:45,137 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:45,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:45,138 INFO L85 PathProgramCache]: Analyzing trace with hash -431498650, now seen corresponding path program 1 times [2022-07-13 15:02:45,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:45,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365140883] [2022-07-13 15:02:45,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:45,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:45,229 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,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:45,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365140883] [2022-07-13 15:02:45,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365140883] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:45,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:45,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:02:45,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610744094] [2022-07-13 15:02:45,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:45,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:02:45,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:02:45,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:02:45,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:02:45,232 INFO L87 Difference]: Start difference. First operand 188 states and 227 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,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:45,313 INFO L93 Difference]: Finished difference Result 306 states and 371 transitions. [2022-07-13 15:02:45,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:02:45,314 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,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:45,315 INFO L225 Difference]: With dead ends: 306 [2022-07-13 15:02:45,315 INFO L226 Difference]: Without dead ends: 197 [2022-07-13 15:02:45,316 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,317 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 13 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:45,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 237 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:02:45,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-13 15:02:45,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 190. [2022-07-13 15:02:45,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 185 states have (on average 1.2378378378378379) internal successors, (229), 189 states have internal predecessors, (229), 0 states have call successors, (0), 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,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 229 transitions. [2022-07-13 15:02:45,326 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 229 transitions. Word has length 36 [2022-07-13 15:02:45,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:45,327 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 229 transitions. [2022-07-13 15:02:45,327 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,327 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 229 transitions. [2022-07-13 15:02:45,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 15:02:45,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:45,333 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,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 15:02:45,334 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:45,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:45,334 INFO L85 PathProgramCache]: Analyzing trace with hash 589569704, now seen corresponding path program 1 times [2022-07-13 15:02:45,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:02:45,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735701814] [2022-07-13 15:02:45,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:45,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:02:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:45,537 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,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:02:45,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735701814] [2022-07-13 15:02:45,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735701814] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:02:45,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879725250] [2022-07-13 15:02:45,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:45,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:02:45,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:02:45,544 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:45,545 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:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:45,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-13 15:02:45,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:45,711 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,729 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,732 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,836 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 15:02:45,837 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,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:45,847 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:45,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:45,857 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:45,866 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:45,871 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:46,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:46,076 INFO L356 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2022-07-13 15:02:46,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 143 treesize of output 87 [2022-07-13 15:02:46,146 INFO L356 Elim1Store]: treesize reduction 118, result has 29.8 percent of original size [2022-07-13 15:02:46,147 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-13 15:02:46,165 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:46,350 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:46,351 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_3 input size 89 context size 89 output size 89 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,355 INFO L158 Benchmark]: Toolchain (without parser) took 7497.94ms. Allocated memory was 94.4MB in the beginning and 140.5MB in the end (delta: 46.1MB). Free memory was 60.5MB in the beginning and 69.0MB in the end (delta: -8.5MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. [2022-07-13 15:02:46,355 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 94.4MB. Free memory is still 49.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:02:46,356 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.18ms. Allocated memory is still 94.4MB. Free memory was 60.3MB in the beginning and 60.2MB in the end (delta: 20.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 15:02:46,356 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.70ms. Allocated memory is still 94.4MB. Free memory was 60.2MB in the beginning and 57.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:02:46,356 INFO L158 Benchmark]: Boogie Preprocessor took 43.30ms. Allocated memory is still 94.4MB. Free memory was 57.8MB in the beginning and 55.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:02:46,356 INFO L158 Benchmark]: RCFGBuilder took 568.69ms. Allocated memory is still 94.4MB. Free memory was 55.7MB in the beginning and 36.3MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-13 15:02:46,356 INFO L158 Benchmark]: TraceAbstraction took 6342.51ms. Allocated memory was 113.2MB in the beginning and 140.5MB in the end (delta: 27.3MB). Free memory was 89.3MB in the beginning and 69.0MB in the end (delta: 20.3MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. [2022-07-13 15:02:46,358 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.18ms. Allocated memory is still 94.4MB. Free memory is still 49.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.18ms. Allocated memory is still 94.4MB. Free memory was 60.3MB in the beginning and 60.2MB in the end (delta: 20.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.70ms. Allocated memory is still 94.4MB. Free memory was 60.2MB in the beginning and 57.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.30ms. Allocated memory is still 94.4MB. Free memory was 57.8MB in the beginning and 55.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 568.69ms. Allocated memory is still 94.4MB. Free memory was 55.7MB in the beginning and 36.3MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6342.51ms. Allocated memory was 113.2MB in the beginning and 140.5MB in the end (delta: 27.3MB). Free memory was 89.3MB in the beginning and 69.0MB in the end (delta: 20.3MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_3 input size 89 context size 89 output size 89 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_3 input size 89 context size 89 output size 89: 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,381 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-2.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 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 15:02:48,245 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:02:48,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:02:48,285 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:02:48,285 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:02:48,287 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:02:48,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:02:48,292 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:02:48,293 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:02:48,296 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:02:48,297 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:02:48,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:02:48,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:02:48,303 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:02:48,305 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:02:48,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:02:48,308 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:02:48,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:02:48,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:02:48,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:02:48,318 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:02:48,318 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:02:48,319 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:02:48,321 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:02:48,322 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:02:48,328 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:02:48,328 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:02:48,329 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:02:48,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:02:48,329 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:02:48,330 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:02:48,330 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:02:48,332 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:02:48,332 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:02:48,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:02:48,335 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:02:48,335 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:02:48,335 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:02:48,335 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:02:48,336 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:02:48,336 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:02:48,337 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:02:48,342 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,363 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:02:48,364 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:02:48,364 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:02:48,364 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:02:48,365 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:02:48,365 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:02:48,365 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:02:48,366 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:02:48,366 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:02:48,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:02:48,366 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:02:48,366 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:02:48,367 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:02:48,367 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:02:48,367 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:02:48,367 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:02:48,367 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 15:02:48,367 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 15:02:48,368 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 15:02:48,368 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:02:48,368 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:02:48,368 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:02:48,368 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:02:48,368 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:02:48,369 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:02:48,369 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:02:48,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:02:48,369 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:02:48,369 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:02:48,370 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:02:48,370 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 15:02:48,370 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 15:02:48,370 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:02:48,370 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:02:48,370 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:02:48,371 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 15:02:48,371 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 -> 14067621d9a8f66625f13d1d9faf9b421dec38bd60b4ac0ad734bd36e2df123a [2022-07-13 15:02:48,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:02:48,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:02:48,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:02:48,689 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:02:48,689 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:02:48,691 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-2.i [2022-07-13 15:02:48,750 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/666ba5c2e/99747a260e314b6e8c38654d1af63c6c/FLAG26a1a85dc [2022-07-13 15:02:49,287 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:02:49,290 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i [2022-07-13 15:02:49,303 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/666ba5c2e/99747a260e314b6e8c38654d1af63c6c/FLAG26a1a85dc [2022-07-13 15:02:49,608 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/666ba5c2e/99747a260e314b6e8c38654d1af63c6c [2022-07-13 15:02:49,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:02:49,615 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:02:49,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:02:49,617 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:02:49,621 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:02:49,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:02:49" (1/1) ... [2022-07-13 15:02:49,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d7463f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:49, skipping insertion in model container [2022-07-13 15:02:49,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:02:49" (1/1) ... [2022-07-13 15:02:49,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:02:49,676 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:02:49,871 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2022-07-13 15:02:49,886 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2022-07-13 15:02:49,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2022-07-13 15:02:49,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2022-07-13 15:02:49,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2022-07-13 15:02:49,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2022-07-13 15:02:49,902 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2022-07-13 15:02:49,902 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2022-07-13 15:02:49,903 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2022-07-13 15:02:49,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2022-07-13 15:02:49,905 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2022-07-13 15:02:49,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2022-07-13 15:02:49,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2022-07-13 15:02:49,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:02:49,929 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:02:49,967 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2022-07-13 15:02:49,969 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2022-07-13 15:02:49,970 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2022-07-13 15:02:49,970 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2022-07-13 15:02:49,981 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2022-07-13 15:02:49,983 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2022-07-13 15:02:49,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2022-07-13 15:02:49,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2022-07-13 15:02:49,989 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2022-07-13 15:02:49,993 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2022-07-13 15:02:49,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2022-07-13 15:02:49,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2022-07-13 15:02:49,998 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2022-07-13 15:02:49,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:02:50,027 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:02:50,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:50 WrapperNode [2022-07-13 15:02:50,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:02:50,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:02:50,028 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:02:50,029 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:02:50,034 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:50" (1/1) ... [2022-07-13 15:02:50,065 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:50" (1/1) ... [2022-07-13 15:02:50,098 INFO L137 Inliner]: procedures = 120, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 223 [2022-07-13 15:02:50,098 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:02:50,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:02:50,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:02:50,099 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:02:50,106 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:50" (1/1) ... [2022-07-13 15:02:50,106 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:50" (1/1) ... [2022-07-13 15:02:50,119 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:50" (1/1) ... [2022-07-13 15:02:50,119 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:50" (1/1) ... [2022-07-13 15:02:50,133 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:50" (1/1) ... [2022-07-13 15:02:50,138 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:50" (1/1) ... [2022-07-13 15:02:50,151 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:50" (1/1) ... [2022-07-13 15:02:50,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:02:50,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:02:50,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:02:50,157 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:02:50,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:50" (1/1) ... [2022-07-13 15:02:50,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:02:50,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:02:50,197 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:50,235 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:50,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 15:02:50,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:02:50,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 15:02:50,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 15:02:50,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 15:02:50,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 15:02:50,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:02:50,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:02:50,404 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:02:50,406 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:02:50,890 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:02:50,895 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:02:50,896 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-07-13 15:02:50,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:02:50 BoogieIcfgContainer [2022-07-13 15:02:50,899 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:02:50,901 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:02:50,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:02:50,903 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:02:50,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:02:49" (1/3) ... [2022-07-13 15:02:50,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366ad93e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:02:50, skipping insertion in model container [2022-07-13 15:02:50,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:02:50" (2/3) ... [2022-07-13 15:02:50,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366ad93e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:02:50, skipping insertion in model container [2022-07-13 15:02:50,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:02:50" (3/3) ... [2022-07-13 15:02:50,907 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2022-07-13 15:02:50,938 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:02:50,939 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2022-07-13 15:02:51,004 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:02:51,010 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@737e4dc2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@30622c0c [2022-07-13 15:02:51,011 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-07-13 15:02:51,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 67 states have (on average 2.0) internal successors, (134), 80 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:51,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-13 15:02:51,023 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:51,024 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-13 15:02:51,024 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:51,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:51,029 INFO L85 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2022-07-13 15:02:51,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:51,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836934272] [2022-07-13 15:02:51,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:51,041 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:51,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:51,044 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:51,045 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:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:51,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 15:02:51,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:51,162 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,163 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:51,163 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:51,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1836934272] [2022-07-13 15:02:51,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1836934272] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:51,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:51,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:02:51,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370315954] [2022-07-13 15:02:51,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:51,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:02:51,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:51,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:02:51,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:51,201 INFO L87 Difference]: Start difference. First operand has 81 states, 67 states have (on average 2.0) internal successors, (134), 80 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) 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:51,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:51,289 INFO L93 Difference]: Finished difference Result 176 states and 294 transitions. [2022-07-13 15:02:51,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:02:51,294 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:51,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:51,301 INFO L225 Difference]: With dead ends: 176 [2022-07-13 15:02:51,302 INFO L226 Difference]: Without dead ends: 93 [2022-07-13 15:02:51,304 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:51,308 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 82 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 101 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.1s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:51,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 101 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 15:02:51,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-13 15:02:51,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2022-07-13 15:02:51,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 63 states have (on average 1.3492063492063493) 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:51,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2022-07-13 15:02:51,356 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 4 [2022-07-13 15:02:51,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:51,356 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2022-07-13 15:02:51,356 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:51,357 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2022-07-13 15:02:51,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 15:02:51,357 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:51,357 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:51,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-13 15:02:51,567 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:51,568 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:51,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:51,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1534452756, now seen corresponding path program 1 times [2022-07-13 15:02:51,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:51,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863203832] [2022-07-13 15:02:51,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:51,570 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:51,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:51,571 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:51,574 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:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:51,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 15:02:51,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:51,713 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,721 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,768 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,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:51,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:51,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863203832] [2022-07-13 15:02:51,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1863203832] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:51,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:51,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:02:51,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575787360] [2022-07-13 15:02:51,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:51,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:02:51,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:51,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:02:51,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:02:51,771 INFO L87 Difference]: Start difference. First operand 75 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:52,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:52,070 INFO L93 Difference]: Finished difference Result 198 states and 223 transitions. [2022-07-13 15:02:52,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:02:52,070 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:52,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:52,072 INFO L225 Difference]: With dead ends: 198 [2022-07-13 15:02:52,072 INFO L226 Difference]: Without dead ends: 130 [2022-07-13 15:02:52,072 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:52,073 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 58 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:52,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 198 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 15:02:52,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-13 15:02:52,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 77. [2022-07-13 15:02:52,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 76 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:52,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2022-07-13 15:02:52,081 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 9 [2022-07-13 15:02:52,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:52,082 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2022-07-13 15:02:52,082 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:52,082 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2022-07-13 15:02:52,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 15:02:52,082 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:52,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:52,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-13 15:02:52,292 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:52,293 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:52,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:52,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1534454678, now seen corresponding path program 1 times [2022-07-13 15:02:52,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:52,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001554361] [2022-07-13 15:02:52,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:52,294 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:52,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:52,296 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:52,298 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:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:52,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 15:02:52,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:52,374 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:52,381 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:52,451 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,451 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:52,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:52,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001554361] [2022-07-13 15:02:52,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001554361] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:52,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:52,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:02:52,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025556964] [2022-07-13 15:02:52,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:52,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:02:52,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:52,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:02:52,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:02:52,453 INFO L87 Difference]: Start difference. First operand 77 states and 87 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: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 131 states and 148 transitions. [2022-07-13 15:02:52,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:02:52,724 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:52,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:52,725 INFO L225 Difference]: With dead ends: 131 [2022-07-13 15:02:52,725 INFO L226 Difference]: Without dead ends: 129 [2022-07-13 15:02:52,725 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:52,726 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 55 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:52,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 196 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 15:02:52,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-13 15:02:52,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 78. [2022-07-13 15:02:52,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 77 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:52,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2022-07-13 15:02:52,734 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 9 [2022-07-13 15:02:52,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:52,734 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2022-07-13 15:02:52,734 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:52,734 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2022-07-13 15:02:52,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 15:02:52,735 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:52,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:52,746 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:52,945 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:52,946 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:52,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:52,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1536301720, now seen corresponding path program 1 times [2022-07-13 15:02:52,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:52,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [674013725] [2022-07-13 15:02:52,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:52,947 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:52,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:52,948 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:52,950 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:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:53,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 15:02:53,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:53,151 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,152 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:53,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:53,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [674013725] [2022-07-13 15:02:53,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [674013725] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:53,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:53,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:02:53,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542960700] [2022-07-13 15:02:53,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:53,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:02:53,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:53,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:02:53,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:02:53,155 INFO L87 Difference]: Start difference. First operand 78 states and 88 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:53,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:53,363 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2022-07-13 15:02:53,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:02:53,364 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:53,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:53,365 INFO L225 Difference]: With dead ends: 79 [2022-07-13 15:02:53,365 INFO L226 Difference]: Without dead ends: 77 [2022-07-13 15:02:53,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:02:53,366 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 1 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:53,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 216 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 15:02:53,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-13 15:02:53,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-07-13 15:02:53,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 64 states have (on average 1.328125) 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:53,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2022-07-13 15:02:53,374 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 9 [2022-07-13 15:02:53,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:53,374 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2022-07-13 15:02:53,374 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:53,374 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2022-07-13 15:02:53,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 15:02:53,375 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:53,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:53,390 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:53,586 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:53,587 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:53,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:53,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1743237117, now seen corresponding path program 1 times [2022-07-13 15:02:53,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:53,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905692591] [2022-07-13 15:02:53,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:53,588 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:53,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:53,590 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:53,591 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:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:53,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 15:02:53,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:53,721 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,722 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:53,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:53,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905692591] [2022-07-13 15:02:53,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905692591] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:53,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:53,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:02:53,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190939742] [2022-07-13 15:02:53,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:53,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:02:53,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:53,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:02:53,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:53,724 INFO L87 Difference]: Start difference. First operand 75 states and 85 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:53,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:53,808 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2022-07-13 15:02:53,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:02:53,809 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:53,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:53,810 INFO L225 Difference]: With dead ends: 77 [2022-07-13 15:02:53,810 INFO L226 Difference]: Without dead ends: 73 [2022-07-13 15:02:53,810 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:53,811 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 14 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 123 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:53,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 123 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:53,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-13 15:02:53,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-07-13 15:02:53,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 62 states have (on average 1.3064516129032258) 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:53,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-07-13 15:02:53,817 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 13 [2022-07-13 15:02:53,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:53,817 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-07-13 15:02:53,817 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:53,818 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-07-13 15:02:53,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 15:02:53,818 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:53,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 15:02:53,834 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:54,028 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:54,029 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:54,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:54,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1794227426, now seen corresponding path program 1 times [2022-07-13 15:02:54,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:54,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717124608] [2022-07-13 15:02:54,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:54,030 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:54,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:54,031 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:54,033 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:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:54,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 15:02:54,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:54,130 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,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:54,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:54,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1717124608] [2022-07-13 15:02:54,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1717124608] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:54,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:54,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:02:54,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573919456] [2022-07-13 15:02:54,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:54,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:02:54,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:54,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:02:54,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:02:54,135 INFO L87 Difference]: Start difference. First operand 71 states and 81 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:54,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:54,352 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2022-07-13 15:02:54,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:02:54,353 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:54,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:54,354 INFO L225 Difference]: With dead ends: 131 [2022-07-13 15:02:54,354 INFO L226 Difference]: Without dead ends: 111 [2022-07-13 15:02:54,354 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:54,355 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 131 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 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.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:54,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 116 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 15:02:54,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-13 15:02:54,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 70. [2022-07-13 15:02:54,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 69 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:54,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2022-07-13 15:02:54,361 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 14 [2022-07-13 15:02:54,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:54,361 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2022-07-13 15:02:54,361 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:54,361 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-07-13 15:02:54,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 15:02:54,362 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:54,362 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:54,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-13 15:02:54,573 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:54,574 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:54,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:54,574 INFO L85 PathProgramCache]: Analyzing trace with hash -140282291, now seen corresponding path program 1 times [2022-07-13 15:02:54,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:54,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630766736] [2022-07-13 15:02:54,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:54,575 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:54,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:54,576 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:54,578 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:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:54,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 15:02:54,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:54,655 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,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:54,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:54,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630766736] [2022-07-13 15:02:54,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1630766736] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:54,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:54,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:02:54,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156231416] [2022-07-13 15:02:54,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:54,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:02:54,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:54,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:02:54,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:54,657 INFO L87 Difference]: Start difference. First operand 70 states and 80 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:54,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:54,675 INFO L93 Difference]: Finished difference Result 136 states and 156 transitions. [2022-07-13 15:02:54,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:02:54,676 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:54,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:54,676 INFO L225 Difference]: With dead ends: 136 [2022-07-13 15:02:54,676 INFO L226 Difference]: Without dead ends: 94 [2022-07-13 15:02:54,677 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:54,678 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 24 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:54,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 145 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:54,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-13 15:02:54,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2022-07-13 15:02:54,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 72 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:54,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2022-07-13 15:02:54,683 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 18 [2022-07-13 15:02:54,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:54,683 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2022-07-13 15:02:54,683 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:54,683 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2022-07-13 15:02:54,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 15:02:54,684 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:54,684 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:54,698 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:54,894 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:54,894 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:54,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:54,895 INFO L85 PathProgramCache]: Analyzing trace with hash -53794182, now seen corresponding path program 1 times [2022-07-13 15:02:54,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:54,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1397558288] [2022-07-13 15:02:54,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:54,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:54,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:54,896 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:54,897 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:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:54,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 15:02:54,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:54,973 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,979 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:55,073 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:55,079 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:55,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:55,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:55,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:55,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1397558288] [2022-07-13 15:02:55,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1397558288] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:55,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:55,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:02:55,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283437543] [2022-07-13 15:02:55,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:55,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:02:55,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:55,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:02:55,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:02:55,096 INFO L87 Difference]: Start difference. First operand 73 states and 84 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:55,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:55,507 INFO L93 Difference]: Finished difference Result 183 states and 210 transitions. [2022-07-13 15:02:55,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 15:02:55,507 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:55,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:55,508 INFO L225 Difference]: With dead ends: 183 [2022-07-13 15:02:55,508 INFO L226 Difference]: Without dead ends: 138 [2022-07-13 15:02:55,509 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:55,509 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 112 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:55,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 247 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 15:02:55,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-13 15:02:55,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 82. [2022-07-13 15:02:55,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 81 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:55,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2022-07-13 15:02:55,515 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 19 [2022-07-13 15:02:55,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:55,515 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2022-07-13 15:02:55,516 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:55,516 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2022-07-13 15:02:55,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 15:02:55,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:55,516 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:55,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-13 15:02:55,726 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:55,727 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:55,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:55,727 INFO L85 PathProgramCache]: Analyzing trace with hash -746851846, now seen corresponding path program 1 times [2022-07-13 15:02:55,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:55,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018291029] [2022-07-13 15:02:55,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:55,728 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:55,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:55,729 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:55,730 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:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:55,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 15:02:55,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:55,863 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,863 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:55,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:55,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018291029] [2022-07-13 15:02:55,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018291029] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:55,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:55,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:02:55,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732183965] [2022-07-13 15:02:55,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:55,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:02:55,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:55,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:02:55,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:02:55,865 INFO L87 Difference]: Start difference. First operand 82 states and 94 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:55,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:55,884 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2022-07-13 15:02:55,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:02:55,885 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:55,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:55,885 INFO L225 Difference]: With dead ends: 82 [2022-07-13 15:02:55,886 INFO L226 Difference]: Without dead ends: 80 [2022-07-13 15:02:55,886 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:55,886 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 13 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:55,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 126 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:02:55,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-13 15:02:55,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-13 15:02:55,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 79 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:55,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2022-07-13 15:02:55,892 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 19 [2022-07-13 15:02:55,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:55,892 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2022-07-13 15:02:55,893 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:55,893 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2022-07-13 15:02:55,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 15:02:55,893 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:55,894 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,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-13 15:02:56,105 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:56,105 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:56,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:56,106 INFO L85 PathProgramCache]: Analyzing trace with hash -169331172, now seen corresponding path program 1 times [2022-07-13 15:02:56,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:56,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298790160] [2022-07-13 15:02:56,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:56,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:56,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:56,108 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:56,113 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:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:56,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 15:02:56,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:56,197 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:56,203 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:56,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:56,230 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:56,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:56,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1298790160] [2022-07-13 15:02:56,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1298790160] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:56,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:56,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:02:56,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893043421] [2022-07-13 15:02:56,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:56,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:02:56,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:56,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:02:56,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:02:56,232 INFO L87 Difference]: Start difference. First operand 80 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:56,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:56,442 INFO L93 Difference]: Finished difference Result 147 states and 170 transitions. [2022-07-13 15:02:56,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 15:02:56,443 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:56,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:56,444 INFO L225 Difference]: With dead ends: 147 [2022-07-13 15:02:56,444 INFO L226 Difference]: Without dead ends: 88 [2022-07-13 15:02:56,444 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:56,445 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 6 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:56,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 190 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 15:02:56,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-13 15:02:56,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2022-07-13 15:02:56,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 81 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:02:56,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2022-07-13 15:02:56,449 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 20 [2022-07-13 15:02:56,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:56,449 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2022-07-13 15:02:56,450 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:56,450 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2022-07-13 15:02:56,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 15:02:56,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:56,450 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:56,467 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:56,651 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:56,651 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:56,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:56,652 INFO L85 PathProgramCache]: Analyzing trace with hash -169329250, now seen corresponding path program 1 times [2022-07-13 15:02:56,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:56,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [344367544] [2022-07-13 15:02:56,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:56,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:56,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:56,653 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:56,654 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:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:56,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 15:02:56,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:56,738 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:56,744 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:56,774 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:56,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:56,775 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:56,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [344367544] [2022-07-13 15:02:56,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [344367544] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:56,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:56,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:02:56,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012501112] [2022-07-13 15:02:56,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:56,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:02:56,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:56,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:02:56,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:02:56,777 INFO L87 Difference]: Start difference. First operand 82 states and 94 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:56,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:56,969 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2022-07-13 15:02:56,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:02:56,970 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:56,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:56,971 INFO L225 Difference]: With dead ends: 89 [2022-07-13 15:02:56,971 INFO L226 Difference]: Without dead ends: 87 [2022-07-13 15:02:56,971 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:56,972 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 3 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:56,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 188 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 15:02:56,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-13 15:02:56,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2022-07-13 15:02:56,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 76 states have (on average 1.25) internal successors, (95), 82 states have internal predecessors, (95), 0 states have call successors, (0), 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:56,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2022-07-13 15:02:56,977 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 20 [2022-07-13 15:02:56,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:56,977 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2022-07-13 15:02:56,977 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:56,977 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2022-07-13 15:02:56,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 15:02:56,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:56,978 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:56,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-07-13 15:02:57,188 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:57,188 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:57,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:57,189 INFO L85 PathProgramCache]: Analyzing trace with hash -167482208, now seen corresponding path program 1 times [2022-07-13 15:02:57,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:57,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483025721] [2022-07-13 15:02:57,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:57,192 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:57,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:57,193 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:57,194 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:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:57,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 15:02:57,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:57,376 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:57,377 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:02:57,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:02:57,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [483025721] [2022-07-13 15:02:57,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [483025721] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:02:57,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:02:57,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:02:57,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139912730] [2022-07-13 15:02:57,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:02:57,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:02:57,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:02:57,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:02:57,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:02:57,378 INFO L87 Difference]: Start difference. First operand 83 states and 95 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:57,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:02:57,679 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2022-07-13 15:02:57,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:02:57,680 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:57,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:02:57,680 INFO L225 Difference]: With dead ends: 84 [2022-07-13 15:02:57,680 INFO L226 Difference]: Without dead ends: 82 [2022-07-13 15:02:57,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:02:57,681 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 1 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:02:57,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 178 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 15:02:57,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-13 15:02:57,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2022-07-13 15:02:57,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 79 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:57,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2022-07-13 15:02:57,686 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 20 [2022-07-13 15:02:57,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:02:57,686 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2022-07-13 15:02:57,686 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:57,686 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2022-07-13 15:02:57,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 15:02:57,687 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:02:57,687 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:57,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-07-13 15:02:57,899 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:57,900 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:57,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:02:57,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1528659518, now seen corresponding path program 1 times [2022-07-13 15:02:57,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:02:57,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610641152] [2022-07-13 15:02:57,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:02:57,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:02:57,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:02:57,902 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:57,903 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:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:02:58,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-13 15:02:58,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:02:58,081 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:58,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:58,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:58,221 INFO L356 Elim1Store]: treesize reduction 89, result has 7.3 percent of original size [2022-07-13 15:02:58,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 149 [2022-07-13 15:02:58,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:58,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:58,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 96 [2022-07-13 15:02:58,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:58,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:02:58,301 INFO L356 Elim1Store]: treesize reduction 58, result has 51.3 percent of original size [2022-07-13 15:02:58,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 92 [2022-07-13 15:02:58,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 41 [2022-07-13 15:02:58,335 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-13 15:02:58,336 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 17 [2022-07-13 15:02:58,386 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:58,583 INFO L356 Elim1Store]: treesize reduction 29, result has 34.1 percent of original size [2022-07-13 15:02:58,584 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 22 treesize of output 32 [2022-07-13 15:02:58,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2022-07-13 15:03:20,816 WARN L233 SmtUtils]: Spent 22.07s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 15:03:43,186 WARN L233 SmtUtils]: Spent 22.05s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 15:03:44,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:03:44,021 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:03:44,038 INFO L356 Elim1Store]: treesize reduction 51, result has 5.6 percent of original size [2022-07-13 15:03:44,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 86 [2022-07-13 15:03:44,141 INFO L356 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2022-07-13 15:03:44,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 115 [2022-07-13 15:03:44,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-13 15:03:44,326 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:03:44,334 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 19 treesize of output 11 [2022-07-13 15:03:44,336 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 11 treesize of output 7 [2022-07-13 15:03:44,378 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:03:44,379 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:03:44,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:03:44,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610641152] [2022-07-13 15:03:44,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610641152] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:03:44,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:03:44,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 15:03:44,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403828337] [2022-07-13 15:03:44,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:03:44,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 15:03:44,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:03:44,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 15:03:44,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:03:44,380 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 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:04:06,602 WARN L233 SmtUtils]: Spent 22.09s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 15:04:28,710 WARN L233 SmtUtils]: Spent 22.05s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 15:04:28,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:04:28,855 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2022-07-13 15:04:28,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 15:04:28,855 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-07-13 15:04:28,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:04:28,857 INFO L225 Difference]: With dead ends: 141 [2022-07-13 15:04:28,857 INFO L226 Difference]: Without dead ends: 139 [2022-07-13 15:04:28,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 88.5s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-13 15:04:28,858 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 66 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:04:28,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 362 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 150 Unchecked, 0.3s Time] [2022-07-13 15:04:28,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-13 15:04:28,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 94. [2022-07-13 15:04:28,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 88 states have (on average 1.2272727272727273) internal successors, (108), 93 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:04:28,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2022-07-13 15:04:28,866 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 22 [2022-07-13 15:04:28,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:04:28,867 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2022-07-13 15:04:28,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 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:04:28,868 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2022-07-13 15:04:28,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 15:04:28,869 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:04:28,869 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:04:28,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-13 15:04:29,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:04:29,080 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:04:29,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:04:29,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1745239424, now seen corresponding path program 1 times [2022-07-13 15:04:29,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:04:29,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083060031] [2022-07-13 15:04:29,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:04:29,081 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:04:29,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:04:29,082 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:04:29,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-13 15:04:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:04:29,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 15:04:29,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:04:29,324 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:04:29,327 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:04:29,342 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:04:29,342 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:04:29,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:04:29,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083060031] [2022-07-13 15:04:29,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2083060031] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:04:29,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:04:29,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 15:04:29,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326881652] [2022-07-13 15:04:29,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:04:29,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:04:29,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:04:29,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:04:29,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:04:29,344 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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:04:29,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:04:29,950 INFO L93 Difference]: Finished difference Result 193 states and 222 transitions. [2022-07-13 15:04:29,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 15:04:29,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-07-13 15:04:29,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:04:29,952 INFO L225 Difference]: With dead ends: 193 [2022-07-13 15:04:29,952 INFO L226 Difference]: Without dead ends: 150 [2022-07-13 15:04:29,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-13 15:04:29,953 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 108 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 15:04:29,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 278 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 15:04:29,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-13 15:04:29,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 91. [2022-07-13 15:04:29,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 90 states have internal predecessors, (105), 0 states have call successors, (0), 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:04:29,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2022-07-13 15:04:29,959 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 22 [2022-07-13 15:04:29,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:04:29,959 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2022-07-13 15:04:29,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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:04:29,959 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2022-07-13 15:04:29,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 15:04:29,960 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:04:29,960 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:04:29,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-13 15:04:30,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:04:30,168 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:04:30,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:04:30,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1090169010, now seen corresponding path program 1 times [2022-07-13 15:04:30,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:04:30,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724296581] [2022-07-13 15:04:30,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:04:30,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:04:30,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:04:30,170 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:04:30,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-13 15:04:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:04:30,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 15:04:30,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:04:30,272 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:04:30,278 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:04:30,374 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:04:30,377 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:04:30,388 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:04:30,389 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:04:30,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:04:30,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724296581] [2022-07-13 15:04:30,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724296581] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:04:30,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:04:30,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 15:04:30,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767337467] [2022-07-13 15:04:30,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:04:30,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 15:04:30,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:04:30,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 15:04:30,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 15:04:30,392 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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:04:30,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:04:30,647 INFO L93 Difference]: Finished difference Result 147 states and 169 transitions. [2022-07-13 15:04:30,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 15:04:30,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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:04:30,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:04:30,648 INFO L225 Difference]: With dead ends: 147 [2022-07-13 15:04:30,649 INFO L226 Difference]: Without dead ends: 129 [2022-07-13 15:04:30,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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:04:30,649 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 23 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:04:30,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 188 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 15:04:30,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-13 15:04:30,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 121. [2022-07-13 15:04:30,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 115 states have (on average 1.2521739130434784) internal successors, (144), 120 states have internal predecessors, (144), 0 states have call successors, (0), 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:04:30,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 144 transitions. [2022-07-13 15:04:30,656 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 144 transitions. Word has length 24 [2022-07-13 15:04:30,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:04:30,657 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 144 transitions. [2022-07-13 15:04:30,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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:04:30,657 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 144 transitions. [2022-07-13 15:04:30,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 15:04:30,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:04:30,658 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:04:30,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-07-13 15:04:30,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:04:30,868 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:04:30,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:04:30,868 INFO L85 PathProgramCache]: Analyzing trace with hash -2028302030, now seen corresponding path program 1 times [2022-07-13 15:04:30,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:04:30,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456632116] [2022-07-13 15:04:30,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:04:30,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:04:30,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:04:30,870 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:04:30,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-13 15:04:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:04:31,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 15:04:31,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:04:31,110 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 31 treesize of output 19 [2022-07-13 15:04:31,112 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 25 treesize of output 13 [2022-07-13 15:04:31,127 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:04:31,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:04:31,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:04:31,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456632116] [2022-07-13 15:04:31,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456632116] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:04:31,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:04:31,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 15:04:31,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496734234] [2022-07-13 15:04:31,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:04:31,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:04:31,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:04:31,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:04:31,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:04:31,129 INFO L87 Difference]: Start difference. First operand 121 states and 144 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:04:31,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:04:31,806 INFO L93 Difference]: Finished difference Result 228 states and 266 transitions. [2022-07-13 15:04:31,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 15:04:31,820 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:04:31,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:04:31,821 INFO L225 Difference]: With dead ends: 228 [2022-07-13 15:04:31,821 INFO L226 Difference]: Without dead ends: 185 [2022-07-13 15:04:31,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-13 15:04:31,822 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 122 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 15:04:31,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 348 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 15:04:31,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-13 15:04:31,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 121. [2022-07-13 15:04:31,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 115 states have (on average 1.2434782608695651) internal successors, (143), 120 states have internal predecessors, (143), 0 states have call successors, (0), 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:04:31,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 143 transitions. [2022-07-13 15:04:31,830 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 143 transitions. Word has length 24 [2022-07-13 15:04:31,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:04:31,830 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 143 transitions. [2022-07-13 15:04:31,830 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:04:31,830 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 143 transitions. [2022-07-13 15:04:31,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 15:04:31,833 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:04:31,834 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:04:31,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-13 15:04:32,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:04:32,046 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:04:32,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:04:32,046 INFO L85 PathProgramCache]: Analyzing trace with hash 272520560, now seen corresponding path program 1 times [2022-07-13 15:04:32,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:04:32,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334772648] [2022-07-13 15:04:32,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:04:32,047 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:04:32,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:04:32,048 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:04:32,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-13 15:04:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:04:32,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 15:04:32,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:04:32,309 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:04:32,312 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:04:32,324 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:04:32,324 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:04:32,324 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:04:32,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334772648] [2022-07-13 15:04:32,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334772648] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:04:32,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:04:32,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 15:04:32,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330268330] [2022-07-13 15:04:32,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:04:32,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 15:04:32,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:04:32,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 15:04:32,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 15:04:32,326 INFO L87 Difference]: Start difference. First operand 121 states and 143 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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:04:32,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:04:32,792 INFO L93 Difference]: Finished difference Result 168 states and 197 transitions. [2022-07-13 15:04:32,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 15:04:32,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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:04:32,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:04:32,793 INFO L225 Difference]: With dead ends: 168 [2022-07-13 15:04:32,793 INFO L226 Difference]: Without dead ends: 150 [2022-07-13 15:04:32,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:04:32,794 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 25 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 15:04:32,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 245 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 15:04:32,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-13 15:04:32,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 112. [2022-07-13 15:04:32,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 106 states have (on average 1.2547169811320755) internal successors, (133), 111 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:04:32,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2022-07-13 15:04:32,800 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 24 [2022-07-13 15:04:32,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:04:32,801 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2022-07-13 15:04:32,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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:04:32,801 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2022-07-13 15:04:32,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-13 15:04:32,802 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:04:32,802 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] [2022-07-13 15:04:32,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-07-13 15:04:33,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:04:33,012 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:04:33,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:04:33,012 INFO L85 PathProgramCache]: Analyzing trace with hash -753351988, now seen corresponding path program 1 times [2022-07-13 15:04:33,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:04:33,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219197251] [2022-07-13 15:04:33,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:04:33,012 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:04:33,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:04:33,014 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:04:33,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-13 15:04:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:04:33,176 WARN L261 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 93 conjunts are in the unsatisfiable core [2022-07-13 15:04:33,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:04:33,186 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:04:33,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:04:33,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:04:33,285 INFO L356 Elim1Store]: treesize reduction 99, result has 8.3 percent of original size [2022-07-13 15:04:33,286 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 271 treesize of output 193 [2022-07-13 15:04:33,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:04:33,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:04:33,295 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2022-07-13 15:04:33,308 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-13 15:04:33,308 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 17 [2022-07-13 15:04:33,644 INFO L356 Elim1Store]: treesize reduction 35, result has 7.9 percent of original size [2022-07-13 15:04:33,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 37 [2022-07-13 15:04:33,657 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-13 15:04:33,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 16 [2022-07-13 15:04:33,679 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:04:33,679 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:04:33,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:04:33,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219197251] [2022-07-13 15:04:33,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1219197251] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:04:33,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:04:33,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 15:04:33,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245109768] [2022-07-13 15:04:33,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:04:33,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 15:04:33,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:04:33,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 15:04:33,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:04:33,680 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:04:34,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:04:34,376 INFO L93 Difference]: Finished difference Result 167 states and 196 transitions. [2022-07-13 15:04:34,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 15:04:34,377 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-13 15:04:34,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:04:34,378 INFO L225 Difference]: With dead ends: 167 [2022-07-13 15:04:34,378 INFO L226 Difference]: Without dead ends: 165 [2022-07-13 15:04:34,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-07-13 15:04:34,379 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 64 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 15:04:34,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 377 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 127 Invalid, 0 Unknown, 42 Unchecked, 0.6s Time] [2022-07-13 15:04:34,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-13 15:04:34,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 115. [2022-07-13 15:04:34,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 114 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:04:34,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 136 transitions. [2022-07-13 15:04:34,386 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 136 transitions. Word has length 25 [2022-07-13 15:04:34,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:04:34,386 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 136 transitions. [2022-07-13 15:04:34,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:04:34,386 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 136 transitions. [2022-07-13 15:04:34,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 15:04:34,387 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:04:34,387 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] [2022-07-13 15:04:34,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-13 15:04:34,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:04:34,595 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:04:34,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:04:34,596 INFO L85 PathProgramCache]: Analyzing trace with hash 363058206, now seen corresponding path program 1 times [2022-07-13 15:04:34,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:04:34,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409622424] [2022-07-13 15:04:34,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:04:34,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:04:34,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:04:34,597 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:04:34,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-13 15:04:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:04:34,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 15:04:34,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:04:34,787 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:04:34,789 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:04:34,802 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:04:34,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:04:34,856 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-13 15:04:34,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-07-13 15:04:34,865 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-07-13 15:04:34,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2022-07-13 15:04:34,892 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:04:34,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:04:34,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409622424] [2022-07-13 15:04:34,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1409622424] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:04:34,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:04:34,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-07-13 15:04:34,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552161647] [2022-07-13 15:04:34,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:04:34,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 15:04:34,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:04:34,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 15:04:34,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:04:34,894 INFO L87 Difference]: Start difference. First operand 115 states and 136 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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:04:35,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:04:35,600 INFO L93 Difference]: Finished difference Result 257 states and 301 transitions. [2022-07-13 15:04:35,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 15:04:35,601 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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 27 [2022-07-13 15:04:35,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:04:35,602 INFO L225 Difference]: With dead ends: 257 [2022-07-13 15:04:35,602 INFO L226 Difference]: Without dead ends: 178 [2022-07-13 15:04:35,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-13 15:04:35,603 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 259 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 15:04:35,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 280 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 15:04:35,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-13 15:04:35,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 133. [2022-07-13 15:04:35,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 127 states have (on average 1.2677165354330708) internal successors, (161), 132 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:04:35,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 161 transitions. [2022-07-13 15:04:35,610 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 161 transitions. Word has length 27 [2022-07-13 15:04:35,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:04:35,611 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 161 transitions. [2022-07-13 15:04:35,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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:04:35,611 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 161 transitions. [2022-07-13 15:04:35,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-13 15:04:35,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:04:35,612 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] [2022-07-13 15:04:35,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-13 15:04:35,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:04:35,822 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-13 15:04:35,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:04:35,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1334430447, now seen corresponding path program 1 times [2022-07-13 15:04:35,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:04:35,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [446733686] [2022-07-13 15:04:35,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:04:35,823 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:04:35,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:04:35,824 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:04:35,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-13 15:04:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:04:35,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 15:04:35,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:04:35,996 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:04:35,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 15:04:35,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:04:35,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [446733686] [2022-07-13 15:04:35,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [446733686] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:04:35,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:04:35,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:04:35,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148938125] [2022-07-13 15:04:35,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:04:35,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:04:35,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:04:35,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:04:35,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:04:35,998 INFO L87 Difference]: Start difference. First operand 133 states and 161 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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:04:36,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:04:36,027 INFO L93 Difference]: Finished difference Result 296 states and 366 transitions. [2022-07-13 15:04:36,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:04:36,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-07-13 15:04:36,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:04:36,028 INFO L225 Difference]: With dead ends: 296 [2022-07-13 15:04:36,028 INFO L226 Difference]: Without dead ends: 212 [2022-07-13 15:04:36,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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:04:36,029 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 28 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 15:04:36,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 161 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 15:04:36,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-07-13 15:04:36,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 170. [2022-07-13 15:04:36,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 164 states have (on average 1.2621951219512195) internal successors, (207), 169 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:04:36,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 207 transitions. [2022-07-13 15:04:36,038 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 207 transitions. Word has length 30 [2022-07-13 15:04:36,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:04:36,038 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 207 transitions. [2022-07-13 15:04:36,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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:04:36,039 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 207 transitions. [2022-07-13 15:04:36,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-13 15:04:36,039 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:04:36,039 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, 1] [2022-07-13 15:04:36,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-13 15:04:36,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:04:36,254 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:04:36,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:04:36,254 INFO L85 PathProgramCache]: Analyzing trace with hash -721495, now seen corresponding path program 1 times [2022-07-13 15:04:36,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:04:36,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164192378] [2022-07-13 15:04:36,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:04:36,255 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:04:36,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:04:36,256 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:04:36,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-13 15:04:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:04:36,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-13 15:04:36,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:04:36,421 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:04:36,440 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:04:36,446 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:04:36,537 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 15:04:36,537 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:04:36,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:04:36,546 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:04:36,549 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:04:36,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:04:36,558 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:04:36,562 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:04:36,659 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 15:04:36,659 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:04:36,664 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:04:36,808 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:04:36,815 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:04:36,815 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:04:36,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:04:36,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:04:36,929 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1405) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv0 32))) (forall ((v_ArrVal_1404 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1404) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2022-07-13 15:04:37,171 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1398 (_ BitVec 32))) (or (and (forall ((v_ArrVal_1404 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_1398)) v_ArrVal_1398 v_ArrVal_1404) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv0 32))) (forall ((v_ArrVal_1405 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32))) v_ArrVal_1398 v_ArrVal_1405) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv0 32)))) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_1398))))) is different from false [2022-07-13 15:04:37,277 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-07-13 15:04:37,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2022-07-13 15:04:37,287 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-13 15:04:37,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2022-07-13 15:04:37,291 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:04:37,311 INFO L356 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2022-07-13 15:04:37,311 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 1 [2022-07-13 15:04:37,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:04:37,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 15:04:37,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164192378] [2022-07-13 15:04:37,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164192378] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:04:37,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 15:04:37,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-07-13 15:04:37,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234934316] [2022-07-13 15:04:37,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 15:04:37,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 15:04:37,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 15:04:37,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 15:04:37,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=116, Unknown=6, NotChecked=46, Total=210 [2022-07-13 15:04:37,342 INFO L87 Difference]: Start difference. First operand 170 states and 207 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:04:39,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:04:39,012 INFO L93 Difference]: Finished difference Result 384 states and 456 transitions. [2022-07-13 15:04:39,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 15:04:39,013 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-13 15:04:39,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:04:39,014 INFO L225 Difference]: With dead ends: 384 [2022-07-13 15:04:39,014 INFO L226 Difference]: Without dead ends: 290 [2022-07-13 15:04:39,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=262, Unknown=6, NotChecked=70, Total=420 [2022-07-13 15:04:39,015 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 237 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 293 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-13 15:04:39,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 728 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 328 Invalid, 0 Unknown, 293 Unchecked, 1.4s Time] [2022-07-13 15:04:39,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-07-13 15:04:39,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 191. [2022-07-13 15:04:39,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 185 states have (on average 1.2486486486486486) internal successors, (231), 190 states have internal predecessors, (231), 0 states have call successors, (0), 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:04:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 231 transitions. [2022-07-13 15:04:39,025 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 231 transitions. Word has length 32 [2022-07-13 15:04:39,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:04:39,025 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 231 transitions. [2022-07-13 15:04:39,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:04:39,026 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 231 transitions. [2022-07-13 15:04:39,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-13 15:04:39,026 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:04:39,026 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, 1] [2022-07-13 15:04:39,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-13 15:04:39,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 15:04:39,238 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:04:39,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:04:39,238 INFO L85 PathProgramCache]: Analyzing trace with hash -572234199, now seen corresponding path program 1 times [2022-07-13 15:04:39,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 15:04:39,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801650150] [2022-07-13 15:04:39,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:04:39,239 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 15:04:39,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 15:04:39,240 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 15:04:39,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-13 15:04:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:04:39,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-13 15:04:39,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:04:39,465 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:04:39,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:04:40,189 INFO L356 Elim1Store]: treesize reduction 23, result has 56.6 percent of original size [2022-07-13 15:04:40,190 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 646 treesize of output 593 [2022-07-13 15:04:40,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:04:40,761 INFO L356 Elim1Store]: treesize reduction 23, result has 56.6 percent of original size [2022-07-13 15:04:40,761 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 489 treesize of output 436 [2022-07-13 15:04:40,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:04:40,968 INFO L356 Elim1Store]: treesize reduction 110, result has 13.4 percent of original size [2022-07-13 15:04:40,969 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 226 treesize of output 250 [2022-07-13 15:04:41,036 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 191 treesize of output 119 [2022-07-13 15:04:41,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:04:41,180 INFO L356 Elim1Store]: treesize reduction 110, result has 13.4 percent of original size [2022-07-13 15:04:41,180 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 226 treesize of output 250 [2022-07-13 15:04:41,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:04:41,224 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 0 case distinctions, treesize of input 199 treesize of output 128 [2022-07-13 15:04:41,372 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 15:04:41,372 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 24 [2022-07-13 15:04:41,423 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:04:41,473 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:04:41,504 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:04:42,595 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 10 treesize of output 9 [2022-07-13 15:04:42,667 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:04:42,674 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 44 [2022-07-13 15:04:42,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-07-13 15:04:43,078 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 21 treesize of output 17 [2022-07-13 15:04:43,496 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:04:43,598 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:04:43,666 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:04:43,675 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 44 [2022-07-13 15:04:43,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:04:43,722 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 44 [2022-07-13 15:04:44,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2022-07-13 15:04:44,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2022-07-13 15:04:44,602 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 34 treesize of output 20 [2022-07-13 15:04:44,679 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 26 treesize of output 14 [2022-07-13 15:04:45,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:04:45,042 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:04:45,062 INFO L356 Elim1Store]: treesize reduction 94, result has 1.1 percent of original size [2022-07-13 15:04:45,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 302 treesize of output 271 [2022-07-13 15:04:45,074 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 274 treesize of output 230 [2022-07-13 15:04:45,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:04:45,151 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-07-13 15:04:45,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 248 treesize of output 237 [2022-07-13 15:04:45,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:04:45,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:04:45,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:04:45,173 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:04:45,178 INFO L356 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-07-13 15:04:45,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 92 [2022-07-13 15:04:45,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:04:45,273 INFO L356 Elim1Store]: treesize reduction -1, result has 101.9 percent of original size [2022-07-13 15:04:45,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 78 [2022-07-13 15:04:45,290 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:04:45,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2022-07-13 15:04:45,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:04:45,346 INFO L356 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2022-07-13 15:04:45,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 84 [2022-07-13 15:04:45,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:04:45,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:04:45,713 INFO L356 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2022-07-13 15:04:45,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 97 treesize of output 70 [2022-07-13 15:04:45,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 15:04:45,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2022-07-13 15:04:46,278 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 15:04:46,310 INFO L356 Elim1Store]: treesize reduction 32, result has 27.3 percent of original size [2022-07-13 15:04:46,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 62 [2022-07-13 15:04:46,328 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-13 15:04:46,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 24 [2022-07-13 15:04:46,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:04:46,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:04:48,851 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:04:48,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 169 [2022-07-13 15:04:48,866 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 15:04:48,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 157 [2022-07-13 15:04:50,225 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1594 (_ BitVec 32))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv0 32))) v_ArrVal_1594 v_arrayElimArr_18)) (.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1594)) v_ArrVal_1594 v_arrayElimArr_17)) (.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) .cse5)) (.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) .cse5))) (or (not (= (select |c_#valid| v_ArrVal_1594) (_ bv0 1))) (and (= .cse0 (_ bv0 32)) (= .cse1 (_ bv0 32))) (not (= (select v_arrayElimArr_18 (_ bv4 32)) (_ bv0 32))) (not (= (_ bv0 32) (select v_arrayElimArr_17 (_ bv4 32)))) (let ((.cse3 (bvadd (_ bv4 32) .cse0))) (and (= (select (select .cse2 .cse1) .cse3) (_ bv0 32)) (= (select (select .cse4 .cse1) .cse3) (_ bv0 32)))))))) is different from false [2022-07-13 15:06:15,869 WARN L233 SmtUtils]: Spent 1.33m on a formula simplification. DAG size of input: 64 DAG size of output: 40 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-13 15:06:15,869 INFO L356 Elim1Store]: treesize reduction 146, result has 36.8 percent of original size [2022-07-13 15:06:15,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 22507 treesize of output 20164