./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-sorted-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-sorted-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 618946a6e113450d0f3efa55a455801e1c2225c3ba6f88e87a9e8ad02019b85f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 18:14:23,452 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 18:14:23,454 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 18:14:23,499 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 18:14:23,500 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 18:14:23,501 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 18:14:23,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 18:14:23,503 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 18:14:23,504 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 18:14:23,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 18:14:23,506 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 18:14:23,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 18:14:23,507 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 18:14:23,508 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 18:14:23,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 18:14:23,510 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 18:14:23,515 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 18:14:23,518 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 18:14:23,520 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 18:14:23,527 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 18:14:23,528 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 18:14:23,533 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 18:14:23,534 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 18:14:23,535 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 18:14:23,537 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 18:14:23,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 18:14:23,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 18:14:23,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 18:14:23,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 18:14:23,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 18:14:23,542 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 18:14:23,543 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 18:14:23,544 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 18:14:23,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 18:14:23,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 18:14:23,546 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 18:14:23,547 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 18:14:23,548 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 18:14:23,548 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 18:14:23,549 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 18:14:23,549 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 18:14:23,550 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-21 18:14:23,572 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 18:14:23,579 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 18:14:23,579 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 18:14:23,580 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 18:14:23,580 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 18:14:23,581 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 18:14:23,581 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 18:14:23,582 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 18:14:23,582 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 18:14:23,582 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 18:14:23,583 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 18:14:23,583 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 18:14:23,583 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 18:14:23,583 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 18:14:23,584 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 18:14:23,584 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-21 18:14:23,584 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-21 18:14:23,584 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-21 18:14:23,584 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 18:14:23,584 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-21 18:14:23,585 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 18:14:23,585 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 18:14:23,585 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 18:14:23,585 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 18:14:23,585 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 18:14:23,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:14:23,587 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 18:14:23,587 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 18:14:23,587 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 18:14:23,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 18:14:23,587 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 18:14:23,588 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 618946a6e113450d0f3efa55a455801e1c2225c3ba6f88e87a9e8ad02019b85f [2021-12-21 18:14:23,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 18:14:23,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 18:14:23,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 18:14:23,838 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 18:14:23,839 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 18:14:23,840 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-sorted-2.i [2021-12-21 18:14:23,901 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/570f3a83a/b783d59b76bb4d57b7c79c7d118d1b90/FLAGe4e71bdda [2021-12-21 18:14:24,295 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 18:14:24,295 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i [2021-12-21 18:14:24,310 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/570f3a83a/b783d59b76bb4d57b7c79c7d118d1b90/FLAGe4e71bdda [2021-12-21 18:14:24,660 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/570f3a83a/b783d59b76bb4d57b7c79c7d118d1b90 [2021-12-21 18:14:24,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 18:14:24,663 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 18:14:24,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 18:14:24,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 18:14:24,669 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 18:14:24,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:14:24" (1/1) ... [2021-12-21 18:14:24,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70e6d3aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:14:24, skipping insertion in model container [2021-12-21 18:14:24,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:14:24" (1/1) ... [2021-12-21 18:14:24,678 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 18:14:24,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 18:14:24,933 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-sorted-2.i[22317,22330] [2021-12-21 18:14:24,936 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-sorted-2.i[22452,22465] [2021-12-21 18:14:24,938 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-sorted-2.i[22612,22625] [2021-12-21 18:14:24,941 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-sorted-2.i[22941,22954] [2021-12-21 18:14:24,941 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-sorted-2.i[23005,23018] [2021-12-21 18:14:24,942 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-sorted-2.i[23136,23149] [2021-12-21 18:14:24,943 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-sorted-2.i[23200,23213] [2021-12-21 18:14:24,946 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:14:24,951 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 18:14:24,977 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-sorted-2.i[22317,22330] [2021-12-21 18:14:24,979 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-sorted-2.i[22452,22465] [2021-12-21 18:14:24,980 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-sorted-2.i[22612,22625] [2021-12-21 18:14:24,982 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-sorted-2.i[22941,22954] [2021-12-21 18:14:24,983 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[23005,23018] [2021-12-21 18:14:24,984 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-sorted-2.i[23136,23149] [2021-12-21 18:14:24,985 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-sorted-2.i[23200,23213] [2021-12-21 18:14:24,987 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:14:25,008 INFO L208 MainTranslator]: Completed translation [2021-12-21 18:14:25,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:14:25 WrapperNode [2021-12-21 18:14:25,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 18:14:25,010 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 18:14:25,010 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 18:14:25,010 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 18:14:25,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:14:25" (1/1) ... [2021-12-21 18:14:25,032 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:14:25" (1/1) ... [2021-12-21 18:14:25,065 INFO L137 Inliner]: procedures = 119, calls = 40, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 199 [2021-12-21 18:14:25,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 18:14:25,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 18:14:25,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 18:14:25,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 18:14:25,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:14:25" (1/1) ... [2021-12-21 18:14:25,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:14:25" (1/1) ... [2021-12-21 18:14:25,092 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:14:25" (1/1) ... [2021-12-21 18:14:25,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:14:25" (1/1) ... [2021-12-21 18:14:25,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:14:25" (1/1) ... [2021-12-21 18:14:25,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:14:25" (1/1) ... [2021-12-21 18:14:25,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:14:25" (1/1) ... [2021-12-21 18:14:25,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 18:14:25,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 18:14:25,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 18:14:25,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 18:14:25,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:14:25" (1/1) ... [2021-12-21 18:14:25,144 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:14:25,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:14:25,164 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-21 18:14:25,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-21 18:14:25,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 18:14:25,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 18:14:25,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 18:14:25,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 18:14:25,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 18:14:25,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 18:14:25,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 18:14:25,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 18:14:25,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 18:14:25,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 18:14:25,302 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 18:14:25,303 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 18:14:25,735 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 18:14:25,741 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 18:14:25,741 INFO L299 CfgBuilder]: Removed 20 assume(true) statements. [2021-12-21 18:14:25,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:14:25 BoogieIcfgContainer [2021-12-21 18:14:25,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 18:14:25,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 18:14:25,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 18:14:25,748 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 18:14:25,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 06:14:24" (1/3) ... [2021-12-21 18:14:25,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73079437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:14:25, skipping insertion in model container [2021-12-21 18:14:25,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:14:25" (2/3) ... [2021-12-21 18:14:25,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73079437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:14:25, skipping insertion in model container [2021-12-21 18:14:25,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:14:25" (3/3) ... [2021-12-21 18:14:25,750 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-sorted-2.i [2021-12-21 18:14:25,754 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 18:14:25,754 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 71 error locations. [2021-12-21 18:14:25,788 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 18:14:25,797 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 18:14:25,797 INFO L340 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2021-12-21 18:14:25,810 INFO L276 IsEmpty]: Start isEmpty. Operand has 166 states, 94 states have (on average 2.1702127659574466) internal successors, (204), 165 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:25,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-21 18:14:25,814 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:14:25,815 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-21 18:14:25,815 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:14:25,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:14:25,820 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-21 18:14:25,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:14:25,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080017337] [2021-12-21 18:14:25,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:25,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:14:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:25,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:14:25,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:14:25,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080017337] [2021-12-21 18:14:25,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080017337] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:14:25,979 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:14:25,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:14:25,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768613483] [2021-12-21 18:14:25,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:14:25,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:14:25,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:14:26,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:14:26,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:14:26,007 INFO L87 Difference]: Start difference. First operand has 166 states, 94 states have (on average 2.1702127659574466) internal successors, (204), 165 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:26,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:14:26,118 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2021-12-21 18:14:26,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:14:26,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-21 18:14:26,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:14:26,127 INFO L225 Difference]: With dead ends: 170 [2021-12-21 18:14:26,128 INFO L226 Difference]: Without dead ends: 166 [2021-12-21 18:14:26,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:14:26,131 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:14:26,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 116 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:14:26,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-12-21 18:14:26,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2021-12-21 18:14:26,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 93 states have (on average 1.8602150537634408) internal successors, (173), 161 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:26,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2021-12-21 18:14:26,164 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 3 [2021-12-21 18:14:26,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:14:26,165 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2021-12-21 18:14:26,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:26,165 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2021-12-21 18:14:26,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-21 18:14:26,166 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:14:26,166 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-21 18:14:26,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 18:14:26,166 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:14:26,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:14:26,167 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-21 18:14:26,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:14:26,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493009913] [2021-12-21 18:14:26,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:26,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:14:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:26,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:14:26,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:14:26,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493009913] [2021-12-21 18:14:26,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493009913] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:14:26,224 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:14:26,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:14:26,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388214888] [2021-12-21 18:14:26,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:14:26,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:14:26,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:14:26,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:14:26,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:14:26,227 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:26,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:14:26,354 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2021-12-21 18:14:26,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:14:26,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-21 18:14:26,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:14:26,359 INFO L225 Difference]: With dead ends: 164 [2021-12-21 18:14:26,360 INFO L226 Difference]: Without dead ends: 164 [2021-12-21 18:14:26,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:14:26,364 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 156 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:14:26,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 114 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:14:26,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-12-21 18:14:26,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2021-12-21 18:14:26,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 93 states have (on average 1.8387096774193548) internal successors, (171), 159 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:26,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 171 transitions. [2021-12-21 18:14:26,383 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 171 transitions. Word has length 3 [2021-12-21 18:14:26,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:14:26,383 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 171 transitions. [2021-12-21 18:14:26,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:26,384 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 171 transitions. [2021-12-21 18:14:26,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-21 18:14:26,384 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:14:26,384 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:14:26,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 18:14:26,385 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:14:26,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:14:26,386 INFO L85 PathProgramCache]: Analyzing trace with hash 59263661, now seen corresponding path program 1 times [2021-12-21 18:14:26,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:14:26,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140051927] [2021-12-21 18:14:26,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:26,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:14:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:26,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:14:26,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:14:26,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140051927] [2021-12-21 18:14:26,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140051927] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:14:26,486 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:14:26,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 18:14:26,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712500217] [2021-12-21 18:14:26,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:14:26,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 18:14:26,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:14:26,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 18:14:26,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 18:14:26,490 INFO L87 Difference]: Start difference. First operand 160 states and 171 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:26,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:14:26,666 INFO L93 Difference]: Finished difference Result 168 states and 182 transitions. [2021-12-21 18:14:26,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 18:14:26,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2021-12-21 18:14:26,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:14:26,668 INFO L225 Difference]: With dead ends: 168 [2021-12-21 18:14:26,668 INFO L226 Difference]: Without dead ends: 168 [2021-12-21 18:14:26,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:14:26,671 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 276 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:14:26,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 88 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:14:26,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-12-21 18:14:26,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 157. [2021-12-21 18:14:26,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 107 states have (on average 1.6728971962616823) internal successors, (179), 156 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:26,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 179 transitions. [2021-12-21 18:14:26,695 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 179 transitions. Word has length 8 [2021-12-21 18:14:26,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:14:26,696 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 179 transitions. [2021-12-21 18:14:26,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 179 transitions. [2021-12-21 18:14:26,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-21 18:14:26,697 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:14:26,697 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:14:26,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 18:14:26,697 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:14:26,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:14:26,698 INFO L85 PathProgramCache]: Analyzing trace with hash 59263662, now seen corresponding path program 1 times [2021-12-21 18:14:26,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:14:26,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514115401] [2021-12-21 18:14:26,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:26,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:14:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:26,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:14:26,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:14:26,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514115401] [2021-12-21 18:14:26,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514115401] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:14:26,776 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:14:26,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 18:14:26,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100589201] [2021-12-21 18:14:26,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:14:26,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 18:14:26,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:14:26,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 18:14:26,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 18:14:26,778 INFO L87 Difference]: Start difference. First operand 157 states and 179 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:26,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:14:26,981 INFO L93 Difference]: Finished difference Result 240 states and 264 transitions. [2021-12-21 18:14:26,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 18:14:26,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2021-12-21 18:14:26,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:14:26,983 INFO L225 Difference]: With dead ends: 240 [2021-12-21 18:14:26,983 INFO L226 Difference]: Without dead ends: 240 [2021-12-21 18:14:26,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:14:26,984 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 315 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:14:26,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 146 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:14:26,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-12-21 18:14:26,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 206. [2021-12-21 18:14:26,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 156 states have (on average 1.5705128205128205) internal successors, (245), 205 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:26,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 245 transitions. [2021-12-21 18:14:26,990 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 245 transitions. Word has length 8 [2021-12-21 18:14:26,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:14:26,990 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 245 transitions. [2021-12-21 18:14:26,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:26,990 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 245 transitions. [2021-12-21 18:14:26,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-21 18:14:26,990 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:14:26,990 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:14:26,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 18:14:26,991 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:14:26,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:14:26,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1117776432, now seen corresponding path program 1 times [2021-12-21 18:14:26,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:14:26,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724045847] [2021-12-21 18:14:26,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:26,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:14:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:27,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:14:27,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:14:27,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724045847] [2021-12-21 18:14:27,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724045847] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:14:27,020 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:14:27,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 18:14:27,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648908464] [2021-12-21 18:14:27,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:14:27,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:14:27,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:14:27,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:14:27,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:14:27,022 INFO L87 Difference]: Start difference. First operand 206 states and 245 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:27,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:14:27,044 INFO L93 Difference]: Finished difference Result 246 states and 288 transitions. [2021-12-21 18:14:27,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:14:27,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-21 18:14:27,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:14:27,050 INFO L225 Difference]: With dead ends: 246 [2021-12-21 18:14:27,050 INFO L226 Difference]: Without dead ends: 246 [2021-12-21 18:14:27,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:14:27,051 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 111 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:14:27,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 217 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:14:27,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-12-21 18:14:27,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 216. [2021-12-21 18:14:27,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 166 states have (on average 1.5602409638554218) internal successors, (259), 215 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:27,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 259 transitions. [2021-12-21 18:14:27,063 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 259 transitions. Word has length 10 [2021-12-21 18:14:27,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:14:27,063 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 259 transitions. [2021-12-21 18:14:27,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:27,064 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 259 transitions. [2021-12-21 18:14:27,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-21 18:14:27,064 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:14:27,064 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:14:27,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 18:14:27,065 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:14:27,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:14:27,066 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2021-12-21 18:14:27,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:14:27,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175226484] [2021-12-21 18:14:27,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:27,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:14:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:27,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:14:27,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:14:27,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175226484] [2021-12-21 18:14:27,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175226484] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:14:27,144 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:14:27,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:14:27,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419440504] [2021-12-21 18:14:27,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:14:27,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:14:27,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:14:27,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:14:27,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:14:27,146 INFO L87 Difference]: Start difference. First operand 216 states and 259 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:27,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:14:27,355 INFO L93 Difference]: Finished difference Result 222 states and 264 transitions. [2021-12-21 18:14:27,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 18:14:27,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-21 18:14:27,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:14:27,356 INFO L225 Difference]: With dead ends: 222 [2021-12-21 18:14:27,356 INFO L226 Difference]: Without dead ends: 222 [2021-12-21 18:14:27,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-21 18:14:27,357 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 106 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:14:27,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 372 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:14:27,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-12-21 18:14:27,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 215. [2021-12-21 18:14:27,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 166 states have (on average 1.5481927710843373) internal successors, (257), 214 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:27,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 257 transitions. [2021-12-21 18:14:27,361 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 257 transitions. Word has length 12 [2021-12-21 18:14:27,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:14:27,362 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 257 transitions. [2021-12-21 18:14:27,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:27,362 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 257 transitions. [2021-12-21 18:14:27,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-21 18:14:27,362 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:14:27,362 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:14:27,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-21 18:14:27,362 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:14:27,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:14:27,363 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2021-12-21 18:14:27,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:14:27,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458329296] [2021-12-21 18:14:27,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:27,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:14:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:27,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:14:27,461 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:14:27,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458329296] [2021-12-21 18:14:27,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458329296] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:14:27,462 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:14:27,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:14:27,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564056324] [2021-12-21 18:14:27,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:14:27,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:14:27,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:14:27,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:14:27,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:14:27,464 INFO L87 Difference]: Start difference. First operand 215 states and 257 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:27,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:14:27,691 INFO L93 Difference]: Finished difference Result 211 states and 250 transitions. [2021-12-21 18:14:27,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 18:14:27,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-21 18:14:27,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:14:27,693 INFO L225 Difference]: With dead ends: 211 [2021-12-21 18:14:27,693 INFO L226 Difference]: Without dead ends: 211 [2021-12-21 18:14:27,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-21 18:14:27,694 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 15 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:14:27,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 456 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:14:27,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-12-21 18:14:27,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 205. [2021-12-21 18:14:27,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 161 states have (on average 1.515527950310559) internal successors, (244), 204 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:27,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 244 transitions. [2021-12-21 18:14:27,699 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 244 transitions. Word has length 12 [2021-12-21 18:14:27,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:14:27,699 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 244 transitions. [2021-12-21 18:14:27,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:27,699 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 244 transitions. [2021-12-21 18:14:27,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-21 18:14:27,700 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:14:27,700 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:14:27,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-21 18:14:27,700 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:14:27,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:14:27,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1270421215, now seen corresponding path program 1 times [2021-12-21 18:14:27,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:14:27,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770493149] [2021-12-21 18:14:27,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:27,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:14:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 18:14:27,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:14:27,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770493149] [2021-12-21 18:14:27,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770493149] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:14:27,746 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:14:27,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 18:14:27,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608270255] [2021-12-21 18:14:27,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:14:27,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 18:14:27,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:14:27,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 18:14:27,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 18:14:27,748 INFO L87 Difference]: Start difference. First operand 205 states and 244 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) [2021-12-21 18:14:27,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:14:27,853 INFO L93 Difference]: Finished difference Result 237 states and 260 transitions. [2021-12-21 18:14:27,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 18:14:27,854 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 21 [2021-12-21 18:14:27,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:14:27,855 INFO L225 Difference]: With dead ends: 237 [2021-12-21 18:14:27,855 INFO L226 Difference]: Without dead ends: 237 [2021-12-21 18:14:27,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:14:27,858 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 283 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:14:27,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 196 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:14:27,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-12-21 18:14:27,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 203. [2021-12-21 18:14:27,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 160 states have (on average 1.5) internal successors, (240), 202 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 240 transitions. [2021-12-21 18:14:27,864 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 240 transitions. Word has length 21 [2021-12-21 18:14:27,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:14:27,864 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 240 transitions. [2021-12-21 18:14:27,864 INFO L471 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) [2021-12-21 18:14:27,864 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 240 transitions. [2021-12-21 18:14:27,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-21 18:14:27,865 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:14:27,866 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:14:27,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-21 18:14:27,867 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:14:27,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:14:27,867 INFO L85 PathProgramCache]: Analyzing trace with hash -697189136, now seen corresponding path program 1 times [2021-12-21 18:14:27,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:14:27,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976116398] [2021-12-21 18:14:27,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:27,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:14:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:28,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:14:28,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:14:28,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976116398] [2021-12-21 18:14:28,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976116398] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:14:28,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652403798] [2021-12-21 18:14:28,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:28,041 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:14:28,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:14:28,042 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:14:28,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-21 18:14:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:28,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-21 18:14:28,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:14:28,222 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:14:28,317 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-21 18:14:28,318 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-21 18:14:28,365 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:14:28,497 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:14:28,497 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-21 18:14:28,569 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:14:28,569 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-21 18:14:28,743 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:14:28,744 INFO L387 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-21 18:14:28,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:14:28,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:14:29,245 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:14:29,246 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2021-12-21 18:14:29,255 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:14:29,256 INFO L387 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 34 treesize of output 37 [2021-12-21 18:14:29,261 INFO L387 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 9 [2021-12-21 18:14:30,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:14:30,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652403798] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:14:30,387 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:14:30,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2021-12-21 18:14:30,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291143439] [2021-12-21 18:14:30,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:14:30,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-21 18:14:30,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:14:30,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-21 18:14:30,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=738, Unknown=9, NotChecked=0, Total=870 [2021-12-21 18:14:30,390 INFO L87 Difference]: Start difference. First operand 203 states and 240 transitions. Second operand has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:31,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:14:31,538 INFO L93 Difference]: Finished difference Result 660 states and 757 transitions. [2021-12-21 18:14:31,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-21 18:14:31,538 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-21 18:14:31,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:14:31,541 INFO L225 Difference]: With dead ends: 660 [2021-12-21 18:14:31,541 INFO L226 Difference]: Without dead ends: 660 [2021-12-21 18:14:31,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=359, Invalid=1702, Unknown=9, NotChecked=0, Total=2070 [2021-12-21 18:14:31,542 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 1340 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 2302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1153 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-21 18:14:31,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1340 Valid, 1400 Invalid, 2302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1055 Invalid, 0 Unknown, 1153 Unchecked, 0.6s Time] [2021-12-21 18:14:31,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2021-12-21 18:14:31,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 225. [2021-12-21 18:14:31,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 182 states have (on average 1.467032967032967) internal successors, (267), 224 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:31,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 267 transitions. [2021-12-21 18:14:31,549 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 267 transitions. Word has length 27 [2021-12-21 18:14:31,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:14:31,549 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 267 transitions. [2021-12-21 18:14:31,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:31,549 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 267 transitions. [2021-12-21 18:14:31,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-21 18:14:31,550 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:14:31,550 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:14:31,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-21 18:14:31,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:14:31,771 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:14:31,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:14:31,772 INFO L85 PathProgramCache]: Analyzing trace with hash -697189135, now seen corresponding path program 1 times [2021-12-21 18:14:31,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:14:31,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096067045] [2021-12-21 18:14:31,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:31,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:14:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:31,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:14:31,974 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:14:31,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096067045] [2021-12-21 18:14:31,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096067045] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:14:31,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972426143] [2021-12-21 18:14:31,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:31,975 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:14:31,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:14:31,980 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:14:32,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-21 18:14:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:32,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-21 18:14:32,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:14:32,082 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:14:32,145 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:14:32,153 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:14:32,154 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:14:32,183 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:14:32,191 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:14:32,320 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-21 18:14:32,320 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-21 18:14:32,324 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-21 18:14:32,344 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:14:32,344 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-21 18:14:32,421 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:14:32,421 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-21 18:14:32,425 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-21 18:14:32,598 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:14:32,599 INFO L387 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 18:14:32,602 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:14:32,604 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:14:32,605 INFO L387 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 25 treesize of output 16 [2021-12-21 18:14:32,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:14:32,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:14:33,320 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:14:33,321 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 51 [2021-12-21 18:14:33,326 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:14:33,326 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 51 [2021-12-21 18:14:33,338 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:14:33,338 INFO L387 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 74 treesize of output 77 [2021-12-21 18:14:33,346 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:14:33,346 INFO L387 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 125 treesize of output 120 [2021-12-21 18:14:33,352 INFO L387 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 89 treesize of output 85 [2021-12-21 18:14:33,356 INFO L387 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 85 treesize of output 81 [2021-12-21 18:14:33,360 INFO L387 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 81 treesize of output 79 [2021-12-21 18:14:33,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:14:33,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972426143] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:14:33,823 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:14:33,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-12-21 18:14:33,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885524036] [2021-12-21 18:14:33,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:14:33,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-21 18:14:33,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:14:33,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-21 18:14:33,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=879, Unknown=11, NotChecked=0, Total=992 [2021-12-21 18:14:33,825 INFO L87 Difference]: Start difference. First operand 225 states and 267 transitions. Second operand has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 32 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:35,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:14:35,343 INFO L93 Difference]: Finished difference Result 472 states and 532 transitions. [2021-12-21 18:14:35,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-21 18:14:35,343 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 32 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-21 18:14:35,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:14:35,345 INFO L225 Difference]: With dead ends: 472 [2021-12-21 18:14:35,345 INFO L226 Difference]: Without dead ends: 472 [2021-12-21 18:14:35,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=441, Invalid=2410, Unknown=11, NotChecked=0, Total=2862 [2021-12-21 18:14:35,347 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 1348 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 2082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 803 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-21 18:14:35,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1348 Valid, 1395 Invalid, 2082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1183 Invalid, 0 Unknown, 803 Unchecked, 0.7s Time] [2021-12-21 18:14:35,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-12-21 18:14:35,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 225. [2021-12-21 18:14:35,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 182 states have (on average 1.4615384615384615) internal successors, (266), 224 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:35,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 266 transitions. [2021-12-21 18:14:35,352 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 266 transitions. Word has length 27 [2021-12-21 18:14:35,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:14:35,353 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 266 transitions. [2021-12-21 18:14:35,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 32 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:35,353 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 266 transitions. [2021-12-21 18:14:35,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-21 18:14:35,354 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:14:35,354 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:14:35,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-21 18:14:35,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-21 18:14:35,577 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:14:35,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:14:35,577 INFO L85 PathProgramCache]: Analyzing trace with hash 24884122, now seen corresponding path program 1 times [2021-12-21 18:14:35,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:14:35,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202988019] [2021-12-21 18:14:35,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:35,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:14:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:35,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 18:14:35,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:14:35,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202988019] [2021-12-21 18:14:35,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202988019] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:14:35,624 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:14:35,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 18:14:35,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603301495] [2021-12-21 18:14:35,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:14:35,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:14:35,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:14:35,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:14:35,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:14:35,626 INFO L87 Difference]: Start difference. First operand 225 states and 266 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:35,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:14:35,632 INFO L93 Difference]: Finished difference Result 227 states and 268 transitions. [2021-12-21 18:14:35,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:14:35,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-21 18:14:35,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:14:35,633 INFO L225 Difference]: With dead ends: 227 [2021-12-21 18:14:35,634 INFO L226 Difference]: Without dead ends: 227 [2021-12-21 18:14:35,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:14:35,634 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:14:35,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 284 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:14:35,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-12-21 18:14:35,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2021-12-21 18:14:35,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 184 states have (on average 1.4565217391304348) internal successors, (268), 226 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:35,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 268 transitions. [2021-12-21 18:14:35,639 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 268 transitions. Word has length 29 [2021-12-21 18:14:35,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:14:35,639 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 268 transitions. [2021-12-21 18:14:35,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:35,640 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 268 transitions. [2021-12-21 18:14:35,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-21 18:14:35,641 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:14:35,641 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:14:35,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-21 18:14:35,641 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:14:35,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:14:35,642 INFO L85 PathProgramCache]: Analyzing trace with hash -197370768, now seen corresponding path program 1 times [2021-12-21 18:14:35,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:14:35,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958350783] [2021-12-21 18:14:35,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:35,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:14:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:35,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:14:35,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:14:35,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958350783] [2021-12-21 18:14:35,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958350783] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:14:35,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562611923] [2021-12-21 18:14:35,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:35,987 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:14:35,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:14:35,992 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:14:35,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-21 18:14:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:36,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-21 18:14:36,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:14:36,093 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:14:36,106 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 18:14:36,177 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:14:36,177 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:14:36,222 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:14:36,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:14:36,228 INFO L387 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-21 18:14:36,276 INFO L387 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 16 treesize of output 8 [2021-12-21 18:14:36,345 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-21 18:14:36,376 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-21 18:14:36,517 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:14:36,519 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:14:36,519 INFO L387 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 17 treesize of output 10 [2021-12-21 18:14:36,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:14:36,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:14:36,663 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_391 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_391) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_75|)) 0))) is different from false [2021-12-21 18:14:36,726 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_391 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_391) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_75|)) 0) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|)))) is different from false [2021-12-21 18:14:36,740 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_391 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int)) (or (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_391) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_75|)) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|)))) is different from false [2021-12-21 18:14:36,764 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_389 Int) (v_ArrVal_391 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_389)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_391) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_75|)) 0) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|)))) is different from false [2021-12-21 18:14:36,913 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_389 Int) (v_ArrVal_391 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc3#1.base_12| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_77| Int)) (or (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_77| v_ArrVal_389)) |v_ULTIMATE.start_main_#t~malloc3#1.base_12| v_ArrVal_391) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_75|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_77| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|)))) is different from false [2021-12-21 18:14:36,924 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:14:36,928 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:14:36,929 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2021-12-21 18:14:36,937 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:14:36,940 INFO L387 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 36 treesize of output 36 [2021-12-21 18:14:36,944 INFO L387 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 [2021-12-21 18:14:37,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:14:37,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562611923] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:14:37,045 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:14:37,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 35 [2021-12-21 18:14:37,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350644517] [2021-12-21 18:14:37,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:14:37,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-21 18:14:37,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:14:37,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-21 18:14:37,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=770, Unknown=5, NotChecked=300, Total=1190 [2021-12-21 18:14:37,048 INFO L87 Difference]: Start difference. First operand 227 states and 268 transitions. Second operand has 35 states, 35 states have (on average 2.6) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:37,458 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (or (= |c_ULTIMATE.start_main_~marked~0#1| 0) (and (not .cse0) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~marked~0#1| 1))) (<= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) 4) 0) (<= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_389 Int) (v_ArrVal_391 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_389)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_391) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_75|)) 0) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) .cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (<= 0 |c_ULTIMATE.start_main_~x~0#1.offset|) (= |c_ULTIMATE.start_main_#t~malloc3#1.offset| 0))) is different from false [2021-12-21 18:14:39,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:14:39,006 INFO L93 Difference]: Finished difference Result 427 states and 492 transitions. [2021-12-21 18:14:39,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-21 18:14:39,007 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.6) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-21 18:14:39,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:14:39,009 INFO L225 Difference]: With dead ends: 427 [2021-12-21 18:14:39,009 INFO L226 Difference]: Without dead ends: 427 [2021-12-21 18:14:39,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=502, Invalid=2268, Unknown=10, NotChecked=642, Total=3422 [2021-12-21 18:14:39,010 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 678 mSDsluCounter, 1693 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 2888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1512 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-21 18:14:39,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [678 Valid, 1785 Invalid, 2888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1279 Invalid, 0 Unknown, 1512 Unchecked, 0.7s Time] [2021-12-21 18:14:39,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-12-21 18:14:39,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 228. [2021-12-21 18:14:39,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 185 states have (on average 1.454054054054054) internal successors, (269), 227 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:39,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 269 transitions. [2021-12-21 18:14:39,015 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 269 transitions. Word has length 32 [2021-12-21 18:14:39,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:14:39,015 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 269 transitions. [2021-12-21 18:14:39,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.6) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:39,016 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 269 transitions. [2021-12-21 18:14:39,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-21 18:14:39,016 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:14:39,017 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:14:39,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-21 18:14:39,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:14:39,217 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:14:39,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:14:39,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1640100151, now seen corresponding path program 1 times [2021-12-21 18:14:39,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:14:39,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643385116] [2021-12-21 18:14:39,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:39,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:14:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:39,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 18:14:39,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:14:39,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643385116] [2021-12-21 18:14:39,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643385116] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:14:39,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:14:39,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 18:14:39,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439775680] [2021-12-21 18:14:39,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:14:39,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 18:14:39,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:14:39,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 18:14:39,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:14:39,296 INFO L87 Difference]: Start difference. First operand 228 states and 269 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:39,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:14:39,483 INFO L93 Difference]: Finished difference Result 246 states and 289 transitions. [2021-12-21 18:14:39,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 18:14:39,484 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-21 18:14:39,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:14:39,485 INFO L225 Difference]: With dead ends: 246 [2021-12-21 18:14:39,485 INFO L226 Difference]: Without dead ends: 246 [2021-12-21 18:14:39,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:14:39,485 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 34 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:14:39,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 595 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:14:39,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-12-21 18:14:39,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 237. [2021-12-21 18:14:39,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 194 states have (on average 1.4381443298969072) internal successors, (279), 236 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:39,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 279 transitions. [2021-12-21 18:14:39,490 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 279 transitions. Word has length 32 [2021-12-21 18:14:39,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:14:39,490 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 279 transitions. [2021-12-21 18:14:39,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:39,490 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 279 transitions. [2021-12-21 18:14:39,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-21 18:14:39,491 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:14:39,491 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:14:39,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-21 18:14:39,491 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:14:39,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:14:39,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1640159733, now seen corresponding path program 1 times [2021-12-21 18:14:39,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:14:39,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622710922] [2021-12-21 18:14:39,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:39,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:14:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:39,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 18:14:39,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:14:39,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622710922] [2021-12-21 18:14:39,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622710922] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:14:39,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:14:39,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:14:39,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87506683] [2021-12-21 18:14:39,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:14:39,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:14:39,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:14:39,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:14:39,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:14:39,524 INFO L87 Difference]: Start difference. First operand 237 states and 279 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:39,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:14:39,591 INFO L93 Difference]: Finished difference Result 234 states and 273 transitions. [2021-12-21 18:14:39,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:14:39,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-21 18:14:39,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:14:39,593 INFO L225 Difference]: With dead ends: 234 [2021-12-21 18:14:39,593 INFO L226 Difference]: Without dead ends: 234 [2021-12-21 18:14:39,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:14:39,594 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 78 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:14:39,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 151 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:14:39,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-12-21 18:14:39,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2021-12-21 18:14:39,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 194 states have (on average 1.407216494845361) internal successors, (273), 233 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:39,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 273 transitions. [2021-12-21 18:14:39,598 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 273 transitions. Word has length 32 [2021-12-21 18:14:39,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:14:39,599 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 273 transitions. [2021-12-21 18:14:39,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:39,599 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 273 transitions. [2021-12-21 18:14:39,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-21 18:14:39,600 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:14:39,600 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:14:39,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-21 18:14:39,600 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:14:39,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:14:39,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1640159732, now seen corresponding path program 1 times [2021-12-21 18:14:39,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:14:39,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351117482] [2021-12-21 18:14:39,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:39,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:14:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:39,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 18:14:39,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:14:39,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351117482] [2021-12-21 18:14:39,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351117482] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:14:39,626 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:14:39,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:14:39,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914613637] [2021-12-21 18:14:39,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:14:39,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:14:39,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:14:39,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:14:39,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:14:39,628 INFO L87 Difference]: Start difference. First operand 234 states and 273 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:39,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:14:39,679 INFO L93 Difference]: Finished difference Result 232 states and 267 transitions. [2021-12-21 18:14:39,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:14:39,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-21 18:14:39,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:14:39,680 INFO L225 Difference]: With dead ends: 232 [2021-12-21 18:14:39,680 INFO L226 Difference]: Without dead ends: 232 [2021-12-21 18:14:39,681 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:14:39,681 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 67 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:14:39,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 173 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:14:39,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-12-21 18:14:39,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2021-12-21 18:14:39,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 194 states have (on average 1.3762886597938144) internal successors, (267), 230 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:39,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 267 transitions. [2021-12-21 18:14:39,685 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 267 transitions. Word has length 32 [2021-12-21 18:14:39,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:14:39,686 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 267 transitions. [2021-12-21 18:14:39,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:39,686 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 267 transitions. [2021-12-21 18:14:39,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-21 18:14:39,686 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:14:39,687 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:14:39,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-21 18:14:39,687 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:14:39,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:14:39,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1267662762, now seen corresponding path program 1 times [2021-12-21 18:14:39,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:14:39,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672289816] [2021-12-21 18:14:39,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:39,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:14:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:39,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 18:14:39,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:14:39,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672289816] [2021-12-21 18:14:39,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672289816] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:14:39,734 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:14:39,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:14:39,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139343301] [2021-12-21 18:14:39,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:14:39,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:14:39,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:14:39,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:14:39,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:14:39,735 INFO L87 Difference]: Start difference. First operand 231 states and 267 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:39,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:14:39,931 INFO L93 Difference]: Finished difference Result 254 states and 291 transitions. [2021-12-21 18:14:39,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:14:39,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-21 18:14:39,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:14:39,933 INFO L225 Difference]: With dead ends: 254 [2021-12-21 18:14:39,933 INFO L226 Difference]: Without dead ends: 254 [2021-12-21 18:14:39,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-21 18:14:39,934 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 113 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:14:39,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 334 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:14:39,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-12-21 18:14:39,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 238. [2021-12-21 18:14:39,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 201 states have (on average 1.3880597014925373) internal successors, (279), 237 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:39,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 279 transitions. [2021-12-21 18:14:39,938 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 279 transitions. Word has length 36 [2021-12-21 18:14:39,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:14:39,938 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 279 transitions. [2021-12-21 18:14:39,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:39,938 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 279 transitions. [2021-12-21 18:14:39,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-21 18:14:39,938 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:14:39,938 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:14:39,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-21 18:14:39,939 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:14:39,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:14:39,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1267662761, now seen corresponding path program 1 times [2021-12-21 18:14:39,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:14:39,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557729726] [2021-12-21 18:14:39,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:39,939 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:14:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:40,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:14:40,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:14:40,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557729726] [2021-12-21 18:14:40,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557729726] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:14:40,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567788587] [2021-12-21 18:14:40,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:40,176 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:14:40,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:14:40,180 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:14:40,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-21 18:14:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:40,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-21 18:14:40,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:14:40,381 INFO L387 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 23 treesize of output 15 [2021-12-21 18:14:40,384 INFO L387 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 28 treesize of output 16 [2021-12-21 18:14:40,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 18:14:40,418 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:14:40,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567788587] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:14:40,418 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 18:14:40,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 18 [2021-12-21 18:14:40,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442011900] [2021-12-21 18:14:40,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:14:40,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:14:40,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:14:40,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:14:40,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-12-21 18:14:40,420 INFO L87 Difference]: Start difference. First operand 238 states and 279 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:40,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:14:40,656 INFO L93 Difference]: Finished difference Result 250 states and 286 transitions. [2021-12-21 18:14:40,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 18:14:40,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-21 18:14:40,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:14:40,658 INFO L225 Difference]: With dead ends: 250 [2021-12-21 18:14:40,658 INFO L226 Difference]: Without dead ends: 250 [2021-12-21 18:14:40,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2021-12-21 18:14:40,659 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 69 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:14:40,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 407 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:14:40,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-12-21 18:14:40,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 236. [2021-12-21 18:14:40,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 201 states have (on average 1.36318407960199) internal successors, (274), 235 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:40,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 274 transitions. [2021-12-21 18:14:40,663 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 274 transitions. Word has length 36 [2021-12-21 18:14:40,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:14:40,664 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 274 transitions. [2021-12-21 18:14:40,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:40,664 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 274 transitions. [2021-12-21 18:14:40,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-21 18:14:40,665 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:14:40,665 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:14:40,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-21 18:14:40,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-21 18:14:40,888 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:14:40,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:14:40,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1546801846, now seen corresponding path program 1 times [2021-12-21 18:14:40,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:14:40,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789192657] [2021-12-21 18:14:40,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:40,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:14:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:41,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:14:41,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:14:41,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789192657] [2021-12-21 18:14:41,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789192657] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:14:41,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233864643] [2021-12-21 18:14:41,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:41,255 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:14:41,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:14:41,257 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:14:41,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-21 18:14:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:41,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 61 conjunts are in the unsatisfiable core [2021-12-21 18:14:41,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:14:41,362 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:14:41,405 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:14:41,405 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:14:41,420 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:14:41,426 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:14:41,534 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:14:41,534 INFO L387 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 22 treesize of output 22 [2021-12-21 18:14:41,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:14:41,542 INFO L387 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 21 [2021-12-21 18:14:41,619 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:14:41,619 INFO L387 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 50 treesize of output 47 [2021-12-21 18:14:41,623 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-21 18:14:41,627 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-12-21 18:14:42,001 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:14:42,002 INFO L387 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2021-12-21 18:14:42,006 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:14:42,007 INFO L387 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 18:14:42,041 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 18:14:42,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:14:42,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:14:42,225 INFO L387 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 77 treesize of output 57 [2021-12-21 18:14:42,748 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:14:42,748 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 60 [2021-12-21 18:14:42,753 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:14:42,753 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 60 [2021-12-21 18:14:42,760 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:14:42,760 INFO L387 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 82 treesize of output 81 [2021-12-21 18:14:42,769 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:14:42,770 INFO L387 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 92 treesize of output 95 [2021-12-21 18:14:42,779 INFO L387 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 64 treesize of output 62 [2021-12-21 18:14:42,791 INFO L387 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 62 treesize of output 60 [2021-12-21 18:14:42,796 INFO L387 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 60 treesize of output 58 [2021-12-21 18:14:43,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:14:43,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233864643] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:14:43,140 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:14:43,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 33 [2021-12-21 18:14:43,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522848910] [2021-12-21 18:14:43,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:14:43,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-21 18:14:43,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:14:43,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-21 18:14:43,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=949, Unknown=1, NotChecked=0, Total=1056 [2021-12-21 18:14:43,142 INFO L87 Difference]: Start difference. First operand 236 states and 274 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:43,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:14:43,836 INFO L93 Difference]: Finished difference Result 272 states and 311 transitions. [2021-12-21 18:14:43,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-21 18:14:43,836 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 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 38 [2021-12-21 18:14:43,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:14:43,837 INFO L225 Difference]: With dead ends: 272 [2021-12-21 18:14:43,837 INFO L226 Difference]: Without dead ends: 272 [2021-12-21 18:14:43,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=193, Invalid=1528, Unknown=1, NotChecked=0, Total=1722 [2021-12-21 18:14:43,838 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 114 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 397 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 18:14:43,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 1617 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 688 Invalid, 0 Unknown, 397 Unchecked, 0.4s Time] [2021-12-21 18:14:43,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-12-21 18:14:43,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 244. [2021-12-21 18:14:43,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 209 states have (on average 1.3588516746411483) internal successors, (284), 243 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:43,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 284 transitions. [2021-12-21 18:14:43,844 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 284 transitions. Word has length 38 [2021-12-21 18:14:43,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:14:43,844 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 284 transitions. [2021-12-21 18:14:43,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:43,844 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 284 transitions. [2021-12-21 18:14:43,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-21 18:14:43,845 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:14:43,845 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:14:43,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-21 18:14:44,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-21 18:14:44,055 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:14:44,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:14:44,056 INFO L85 PathProgramCache]: Analyzing trace with hash -247701985, now seen corresponding path program 2 times [2021-12-21 18:14:44,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:14:44,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951275642] [2021-12-21 18:14:44,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:44,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:14:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:44,304 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:14:44,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:14:44,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951275642] [2021-12-21 18:14:44,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951275642] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:14:44,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152803526] [2021-12-21 18:14:44,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 18:14:44,306 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:14:44,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:14:44,309 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:14:44,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-21 18:14:44,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 18:14:44,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 18:14:44,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-21 18:14:44,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:14:44,423 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:14:44,486 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:14:44,487 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:14:44,513 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:14:44,605 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:14:44,605 INFO L387 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 22 treesize of output 22 [2021-12-21 18:14:44,644 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:14:44,644 INFO L387 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 22 treesize of output 22 [2021-12-21 18:14:44,669 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:14:44,670 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:14:44,714 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-21 18:14:44,714 INFO L387 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 1 case distinctions, treesize of input 27 treesize of output 22 [2021-12-21 18:14:44,853 INFO L353 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-21 18:14:44,853 INFO L387 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 3 case distinctions, treesize of input 47 treesize of output 49 [2021-12-21 18:14:44,866 INFO L387 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 12 treesize of output 8 [2021-12-21 18:14:44,978 INFO L353 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-21 18:14:44,978 INFO L387 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 3 case distinctions, treesize of input 56 treesize of output 56 [2021-12-21 18:14:44,982 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2021-12-21 18:14:44,982 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-21 18:14:44,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2021-12-21 18:14:44,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469059432] [2021-12-21 18:14:44,982 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-21 18:14:44,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-21 18:14:44,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:14:44,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-21 18:14:44,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2021-12-21 18:14:44,984 INFO L87 Difference]: Start difference. First operand 244 states and 284 transitions. Second operand has 17 states, 16 states have (on average 2.375) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:44,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-21 18:14:44,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2021-12-21 18:14:44,985 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:14:44,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:14:45,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-21 18:14:45,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:14:45,208 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@5bb4ff46 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) 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) [2021-12-21 18:14:45,212 INFO L158 Benchmark]: Toolchain (without parser) took 20548.40ms. Allocated memory was 94.4MB in the beginning and 172.0MB in the end (delta: 77.6MB). Free memory was 65.6MB in the beginning and 69.3MB in the end (delta: -3.7MB). Peak memory consumption was 72.9MB. Max. memory is 16.1GB. [2021-12-21 18:14:45,212 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 71.3MB. Free memory is still 36.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 18:14:45,212 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.83ms. Allocated memory is still 94.4MB. Free memory was 65.6MB in the beginning and 61.8MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-21 18:14:45,212 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.60ms. Allocated memory is still 94.4MB. Free memory was 61.8MB in the beginning and 59.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 18:14:45,212 INFO L158 Benchmark]: Boogie Preprocessor took 66.83ms. Allocated memory is still 94.4MB. Free memory was 59.5MB in the beginning and 57.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 18:14:45,213 INFO L158 Benchmark]: RCFGBuilder took 609.79ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 57.6MB in the beginning and 86.6MB in the end (delta: -29.0MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2021-12-21 18:14:45,213 INFO L158 Benchmark]: TraceAbstraction took 19466.68ms. Allocated memory was 117.4MB in the beginning and 172.0MB in the end (delta: 54.5MB). Free memory was 86.6MB in the beginning and 69.3MB in the end (delta: 17.3MB). Peak memory consumption was 71.6MB. Max. memory is 16.1GB. [2021-12-21 18:14:45,214 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.17ms. Allocated memory is still 71.3MB. Free memory is still 36.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.83ms. Allocated memory is still 94.4MB. Free memory was 65.6MB in the beginning and 61.8MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.60ms. Allocated memory is still 94.4MB. Free memory was 61.8MB in the beginning and 59.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.83ms. Allocated memory is still 94.4MB. Free memory was 59.5MB in the beginning and 57.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 609.79ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 57.6MB in the beginning and 86.6MB in the end (delta: -29.0MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * TraceAbstraction took 19466.68ms. Allocated memory was 117.4MB in the beginning and 172.0MB in the end (delta: 54.5MB). Free memory was 86.6MB in the beginning and 69.3MB in the end (delta: 17.3MB). Peak memory consumption was 71.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@5bb4ff46 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@5bb4ff46: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-21 18:14:45,244 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-sorted-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 618946a6e113450d0f3efa55a455801e1c2225c3ba6f88e87a9e8ad02019b85f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 18:14:47,035 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 18:14:47,037 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 18:14:47,061 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 18:14:47,061 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 18:14:47,063 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 18:14:47,064 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 18:14:47,065 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 18:14:47,067 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 18:14:47,067 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 18:14:47,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 18:14:47,069 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 18:14:47,070 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 18:14:47,071 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 18:14:47,072 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 18:14:47,073 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 18:14:47,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 18:14:47,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 18:14:47,076 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 18:14:47,077 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 18:14:47,079 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 18:14:47,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 18:14:47,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 18:14:47,084 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 18:14:47,087 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 18:14:47,093 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 18:14:47,093 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 18:14:47,094 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 18:14:47,094 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 18:14:47,095 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 18:14:47,095 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 18:14:47,096 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 18:14:47,096 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 18:14:47,098 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 18:14:47,099 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 18:14:47,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 18:14:47,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 18:14:47,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 18:14:47,102 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 18:14:47,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 18:14:47,104 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 18:14:47,104 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-21 18:14:47,136 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 18:14:47,138 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 18:14:47,138 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 18:14:47,138 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 18:14:47,139 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 18:14:47,139 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 18:14:47,140 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 18:14:47,140 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 18:14:47,141 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 18:14:47,141 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 18:14:47,142 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 18:14:47,142 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 18:14:47,142 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 18:14:47,142 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 18:14:47,142 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 18:14:47,143 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-21 18:14:47,143 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-21 18:14:47,143 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-21 18:14:47,143 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 18:14:47,144 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-21 18:14:47,144 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-21 18:14:47,144 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-21 18:14:47,144 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 18:14:47,144 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 18:14:47,145 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 18:14:47,145 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 18:14:47,150 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 18:14:47,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:14:47,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 18:14:47,151 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 18:14:47,151 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-21 18:14:47,151 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-21 18:14:47,152 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 18:14:47,152 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-21 18:14:47,152 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 618946a6e113450d0f3efa55a455801e1c2225c3ba6f88e87a9e8ad02019b85f [2021-12-21 18:14:47,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 18:14:47,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 18:14:47,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 18:14:47,489 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 18:14:47,490 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 18:14:47,491 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-sorted-2.i [2021-12-21 18:14:47,545 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83555aecc/954c5533362a49ea95455c5689476636/FLAG4ce5830c9 [2021-12-21 18:14:48,026 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 18:14:48,029 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i [2021-12-21 18:14:48,046 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83555aecc/954c5533362a49ea95455c5689476636/FLAG4ce5830c9 [2021-12-21 18:14:48,360 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83555aecc/954c5533362a49ea95455c5689476636 [2021-12-21 18:14:48,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 18:14:48,363 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 18:14:48,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 18:14:48,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 18:14:48,367 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 18:14:48,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:14:48" (1/1) ... [2021-12-21 18:14:48,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dfec260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:14:48, skipping insertion in model container [2021-12-21 18:14:48,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:14:48" (1/1) ... [2021-12-21 18:14:48,375 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 18:14:48,410 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 18:14:48,645 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[22317,22330] [2021-12-21 18:14:48,650 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-sorted-2.i[22452,22465] [2021-12-21 18:14:48,654 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i[22612,22625] [2021-12-21 18:14:48,660 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-sorted-2.i[22941,22954] [2021-12-21 18:14:48,663 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-sorted-2.i[23005,23018] [2021-12-21 18:14:48,665 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-sorted-2.i[23136,23149] [2021-12-21 18:14:48,665 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-sorted-2.i[23200,23213] [2021-12-21 18:14:48,674 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:14:48,687 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 18:14:48,731 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-sorted-2.i[22317,22330] [2021-12-21 18:14:48,733 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-sorted-2.i[22452,22465] [2021-12-21 18:14:48,734 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-sorted-2.i[22612,22625] [2021-12-21 18:14:48,736 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-sorted-2.i[22941,22954] [2021-12-21 18:14:48,737 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-sorted-2.i[23005,23018] [2021-12-21 18:14:48,738 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-sorted-2.i[23136,23149] [2021-12-21 18:14:48,739 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-sorted-2.i[23200,23213] [2021-12-21 18:14:48,740 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:14:48,765 INFO L208 MainTranslator]: Completed translation [2021-12-21 18:14:48,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:14:48 WrapperNode [2021-12-21 18:14:48,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 18:14:48,767 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 18:14:48,767 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 18:14:48,767 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 18:14:48,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:14:48" (1/1) ... [2021-12-21 18:14:48,786 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:14:48" (1/1) ... [2021-12-21 18:14:48,811 INFO L137 Inliner]: procedures = 122, calls = 40, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 192 [2021-12-21 18:14:48,811 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 18:14:48,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 18:14:48,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 18:14:48,816 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 18:14:48,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:14:48" (1/1) ... [2021-12-21 18:14:48,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:14:48" (1/1) ... [2021-12-21 18:14:48,830 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:14:48" (1/1) ... [2021-12-21 18:14:48,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:14:48" (1/1) ... [2021-12-21 18:14:48,852 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:14:48" (1/1) ... [2021-12-21 18:14:48,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:14:48" (1/1) ... [2021-12-21 18:14:48,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:14:48" (1/1) ... [2021-12-21 18:14:48,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 18:14:48,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 18:14:48,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 18:14:48,863 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 18:14:48,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:14:48" (1/1) ... [2021-12-21 18:14:48,877 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:14:48,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:14:48,900 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-21 18:14:48,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-21 18:14:48,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-21 18:14:48,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 18:14:48,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 18:14:48,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 18:14:48,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 18:14:48,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 18:14:48,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-21 18:14:48,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-21 18:14:48,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 18:14:48,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 18:14:49,084 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 18:14:49,092 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 18:14:49,625 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 18:14:49,632 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 18:14:49,632 INFO L299 CfgBuilder]: Removed 20 assume(true) statements. [2021-12-21 18:14:49,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:14:49 BoogieIcfgContainer [2021-12-21 18:14:49,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 18:14:49,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 18:14:49,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 18:14:49,638 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 18:14:49,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 06:14:48" (1/3) ... [2021-12-21 18:14:49,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28b67259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:14:49, skipping insertion in model container [2021-12-21 18:14:49,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:14:48" (2/3) ... [2021-12-21 18:14:49,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28b67259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:14:49, skipping insertion in model container [2021-12-21 18:14:49,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:14:49" (3/3) ... [2021-12-21 18:14:49,640 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-sorted-2.i [2021-12-21 18:14:49,645 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 18:14:49,645 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 71 error locations. [2021-12-21 18:14:49,680 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 18:14:49,686 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 18:14:49,686 INFO L340 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2021-12-21 18:14:49,701 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 90 states have (on average 2.2111111111111112) internal successors, (199), 161 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:49,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-21 18:14:49,708 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:14:49,708 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-21 18:14:49,709 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:14:49,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:14:49,715 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-21 18:14:49,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:14:49,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937116296] [2021-12-21 18:14:49,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:49,726 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:14:49,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:14:49,733 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) [2021-12-21 18:14:49,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-21 18:14:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:49,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 18:14:49,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:14:49,867 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:14:49,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:14:49,875 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:14:49,875 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:14:49,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937116296] [2021-12-21 18:14:49,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937116296] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:14:49,876 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:14:49,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:14:49,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449604794] [2021-12-21 18:14:49,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:14:49,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:14:49,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:14:49,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:14:49,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:14:49,911 INFO L87 Difference]: Start difference. First operand has 162 states, 90 states have (on average 2.2111111111111112) internal successors, (199), 161 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:50,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:14:50,137 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions. [2021-12-21 18:14:50,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:14:50,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-21 18:14:50,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:14:50,146 INFO L225 Difference]: With dead ends: 166 [2021-12-21 18:14:50,146 INFO L226 Difference]: Without dead ends: 162 [2021-12-21 18:14:50,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:14:50,155 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 155 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:14:50,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 111 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:14:50,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-12-21 18:14:50,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2021-12-21 18:14:50,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 89 states have (on average 1.8876404494382022) internal successors, (168), 157 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:50,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 168 transitions. [2021-12-21 18:14:50,204 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 168 transitions. Word has length 3 [2021-12-21 18:14:50,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:14:50,204 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 168 transitions. [2021-12-21 18:14:50,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:50,205 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 168 transitions. [2021-12-21 18:14:50,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-21 18:14:50,205 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:14:50,205 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-21 18:14:50,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-21 18:14:50,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:14:50,414 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:14:50,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:14:50,415 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-21 18:14:50,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:14:50,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993553644] [2021-12-21 18:14:50,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:50,416 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:14:50,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:14:50,417 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) [2021-12-21 18:14:50,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-21 18:14:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:50,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 18:14:50,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:14:50,471 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:14:50,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:14:50,478 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:14:50,479 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:14:50,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1993553644] [2021-12-21 18:14:50,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1993553644] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:14:50,479 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:14:50,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:14:50,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291134546] [2021-12-21 18:14:50,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:14:50,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:14:50,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:14:50,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:14:50,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:14:50,482 INFO L87 Difference]: Start difference. First operand 158 states and 168 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:50,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:14:50,736 INFO L93 Difference]: Finished difference Result 160 states and 170 transitions. [2021-12-21 18:14:50,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:14:50,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-21 18:14:50,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:14:50,738 INFO L225 Difference]: With dead ends: 160 [2021-12-21 18:14:50,738 INFO L226 Difference]: Without dead ends: 160 [2021-12-21 18:14:50,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:14:50,740 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 151 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:14:50,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 109 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:14:50,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-21 18:14:50,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2021-12-21 18:14:50,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 89 states have (on average 1.8651685393258426) internal successors, (166), 155 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:50,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 166 transitions. [2021-12-21 18:14:50,748 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 166 transitions. Word has length 3 [2021-12-21 18:14:50,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:14:50,748 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 166 transitions. [2021-12-21 18:14:50,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:50,748 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 166 transitions. [2021-12-21 18:14:50,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-21 18:14:50,748 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:14:50,748 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:14:50,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-21 18:14:50,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:14:50,949 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:14:50,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:14:50,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027173, now seen corresponding path program 1 times [2021-12-21 18:14:50,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:14:50,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195409242] [2021-12-21 18:14:50,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:50,951 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:14:50,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:14:50,952 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) [2021-12-21 18:14:50,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-21 18:14:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:51,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 18:14:51,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:14:51,021 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:14:51,057 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-21 18:14:51,058 INFO L387 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 12 treesize of output 17 [2021-12-21 18:14:51,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:14:51,069 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:14:51,070 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:14:51,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1195409242] [2021-12-21 18:14:51,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1195409242] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:14:51,070 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:14:51,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 18:14:51,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676396895] [2021-12-21 18:14:51,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:14:51,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 18:14:51,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:14:51,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 18:14:51,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 18:14:51,072 INFO L87 Difference]: Start difference. First operand 156 states and 166 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:51,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:14:51,400 INFO L93 Difference]: Finished difference Result 164 states and 177 transitions. [2021-12-21 18:14:51,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 18:14:51,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-12-21 18:14:51,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:14:51,401 INFO L225 Difference]: With dead ends: 164 [2021-12-21 18:14:51,402 INFO L226 Difference]: Without dead ends: 164 [2021-12-21 18:14:51,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:14:51,403 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 267 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:14:51,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 83 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 18:14:51,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-12-21 18:14:51,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 153. [2021-12-21 18:14:51,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 103 states have (on average 1.6893203883495145) internal successors, (174), 152 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:51,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 174 transitions. [2021-12-21 18:14:51,417 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 174 transitions. Word has length 7 [2021-12-21 18:14:51,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:14:51,417 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 174 transitions. [2021-12-21 18:14:51,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:51,417 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 174 transitions. [2021-12-21 18:14:51,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-21 18:14:51,418 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:14:51,418 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:14:51,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-21 18:14:51,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:14:51,627 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:14:51,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:14:51,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027174, now seen corresponding path program 1 times [2021-12-21 18:14:51,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:14:51,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404374742] [2021-12-21 18:14:51,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:51,628 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:14:51,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:14:51,630 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) [2021-12-21 18:14:51,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-21 18:14:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:51,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 18:14:51,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:14:51,717 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:14:51,771 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:14:51,771 INFO L387 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 12 treesize of output 14 [2021-12-21 18:14:51,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:14:51,789 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:14:51,789 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:14:51,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404374742] [2021-12-21 18:14:51,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [404374742] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:14:51,790 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:14:51,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 18:14:51,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190884426] [2021-12-21 18:14:51,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:14:51,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 18:14:51,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:14:51,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 18:14:51,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 18:14:51,792 INFO L87 Difference]: Start difference. First operand 153 states and 174 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:52,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:14:52,210 INFO L93 Difference]: Finished difference Result 233 states and 255 transitions. [2021-12-21 18:14:52,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 18:14:52,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-12-21 18:14:52,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:14:52,212 INFO L225 Difference]: With dead ends: 233 [2021-12-21 18:14:52,212 INFO L226 Difference]: Without dead ends: 233 [2021-12-21 18:14:52,212 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:14:52,213 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 303 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 18:14:52,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [303 Valid, 136 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-21 18:14:52,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-12-21 18:14:52,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 199. [2021-12-21 18:14:52,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 149 states have (on average 1.5838926174496644) internal successors, (236), 198 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:52,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 236 transitions. [2021-12-21 18:14:52,222 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 236 transitions. Word has length 7 [2021-12-21 18:14:52,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:14:52,223 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 236 transitions. [2021-12-21 18:14:52,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:52,223 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 236 transitions. [2021-12-21 18:14:52,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-21 18:14:52,223 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:14:52,224 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:14:52,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-21 18:14:52,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:14:52,427 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:14:52,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:14:52,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1837264999, now seen corresponding path program 1 times [2021-12-21 18:14:52,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:14:52,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271697594] [2021-12-21 18:14:52,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:52,429 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:14:52,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:14:52,430 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) [2021-12-21 18:14:52,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-21 18:14:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:52,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 18:14:52,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:14:52,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:14:52,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:14:52,493 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:14:52,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271697594] [2021-12-21 18:14:52,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271697594] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:14:52,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:14:52,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 18:14:52,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238912294] [2021-12-21 18:14:52,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:14:52,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:14:52,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:14:52,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:14:52,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:14:52,496 INFO L87 Difference]: Start difference. First operand 199 states and 236 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:52,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:14:52,514 INFO L93 Difference]: Finished difference Result 237 states and 277 transitions. [2021-12-21 18:14:52,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:14:52,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-21 18:14:52,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:14:52,517 INFO L225 Difference]: With dead ends: 237 [2021-12-21 18:14:52,522 INFO L226 Difference]: Without dead ends: 237 [2021-12-21 18:14:52,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:14:52,525 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 107 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:14:52,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 210 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:14:52,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-12-21 18:14:52,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 207. [2021-12-21 18:14:52,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 157 states have (on average 1.5796178343949046) internal successors, (248), 206 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:52,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 248 transitions. [2021-12-21 18:14:52,549 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 248 transitions. Word has length 9 [2021-12-21 18:14:52,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:14:52,549 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 248 transitions. [2021-12-21 18:14:52,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:52,550 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 248 transitions. [2021-12-21 18:14:52,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-21 18:14:52,550 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:14:52,550 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:14:52,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-21 18:14:52,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:14:52,755 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:14:52,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:14:52,756 INFO L85 PathProgramCache]: Analyzing trace with hash 406735527, now seen corresponding path program 1 times [2021-12-21 18:14:52,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:14:52,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348424854] [2021-12-21 18:14:52,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:52,757 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:14:52,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:14:52,761 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) [2021-12-21 18:14:52,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-21 18:14:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:52,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 18:14:52,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:14:52,858 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:14:52,879 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:14:52,904 INFO L387 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 17 treesize of output 9 [2021-12-21 18:14:52,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:14:52,922 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:14:52,922 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:14:52,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1348424854] [2021-12-21 18:14:52,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1348424854] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:14:52,925 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:14:52,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:14:52,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933961029] [2021-12-21 18:14:52,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:14:52,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:14:52,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:14:52,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:14:52,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:14:52,927 INFO L87 Difference]: Start difference. First operand 207 states and 248 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:53,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:14:53,405 INFO L93 Difference]: Finished difference Result 213 states and 253 transitions. [2021-12-21 18:14:53,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 18:14:53,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-12-21 18:14:53,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:14:53,406 INFO L225 Difference]: With dead ends: 213 [2021-12-21 18:14:53,407 INFO L226 Difference]: Without dead ends: 213 [2021-12-21 18:14:53,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-21 18:14:53,408 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 101 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 18:14:53,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 347 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-21 18:14:53,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-12-21 18:14:53,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 206. [2021-12-21 18:14:53,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 157 states have (on average 1.5668789808917198) internal successors, (246), 205 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:53,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 246 transitions. [2021-12-21 18:14:53,418 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 246 transitions. Word has length 11 [2021-12-21 18:14:53,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:14:53,419 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 246 transitions. [2021-12-21 18:14:53,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:53,419 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 246 transitions. [2021-12-21 18:14:53,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-21 18:14:53,419 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:14:53,420 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:14:53,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-21 18:14:53,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:14:53,626 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:14:53,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:14:53,626 INFO L85 PathProgramCache]: Analyzing trace with hash 406735528, now seen corresponding path program 1 times [2021-12-21 18:14:53,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:14:53,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941816070] [2021-12-21 18:14:53,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:53,627 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:14:53,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:14:53,628 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) [2021-12-21 18:14:53,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-21 18:14:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:53,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-21 18:14:53,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:14:53,709 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:14:53,731 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:14:53,736 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:14:53,768 INFO L387 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 17 treesize of output 9 [2021-12-21 18:14:53,773 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 18:14:53,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:14:53,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:14:53,810 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:14:53,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [941816070] [2021-12-21 18:14:53,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [941816070] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:14:53,811 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:14:53,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:14:53,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444920141] [2021-12-21 18:14:53,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:14:53,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:14:53,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:14:53,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:14:53,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:14:53,812 INFO L87 Difference]: Start difference. First operand 206 states and 246 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:54,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:14:54,348 INFO L93 Difference]: Finished difference Result 202 states and 239 transitions. [2021-12-21 18:14:54,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 18:14:54,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-12-21 18:14:54,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:14:54,350 INFO L225 Difference]: With dead ends: 202 [2021-12-21 18:14:54,350 INFO L226 Difference]: Without dead ends: 202 [2021-12-21 18:14:54,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-21 18:14:54,351 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 13 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 18:14:54,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 428 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-21 18:14:54,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-12-21 18:14:54,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 197. [2021-12-21 18:14:54,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 153 states have (on average 1.5294117647058822) internal successors, (234), 196 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:54,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 234 transitions. [2021-12-21 18:14:54,355 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 234 transitions. Word has length 11 [2021-12-21 18:14:54,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:14:54,355 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 234 transitions. [2021-12-21 18:14:54,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:54,355 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 234 transitions. [2021-12-21 18:14:54,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-21 18:14:54,356 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:14:54,356 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:14:54,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-21 18:14:54,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:14:54,565 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:14:54,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:14:54,566 INFO L85 PathProgramCache]: Analyzing trace with hash 415940479, now seen corresponding path program 1 times [2021-12-21 18:14:54,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:14:54,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1956845083] [2021-12-21 18:14:54,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:54,567 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:14:54,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:14:54,568 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) [2021-12-21 18:14:54,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-21 18:14:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:54,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 18:14:54,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:14:54,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 18:14:54,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:14:54,699 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:14:54,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1956845083] [2021-12-21 18:14:54,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1956845083] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:14:54,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:14:54,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 18:14:54,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291571647] [2021-12-21 18:14:54,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:14:54,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 18:14:54,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:14:54,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 18:14:54,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 18:14:54,701 INFO L87 Difference]: Start difference. First operand 197 states and 234 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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) [2021-12-21 18:14:54,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:14:54,928 INFO L93 Difference]: Finished difference Result 228 states and 249 transitions. [2021-12-21 18:14:54,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 18:14:54,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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 [2021-12-21 18:14:54,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:14:54,932 INFO L225 Difference]: With dead ends: 228 [2021-12-21 18:14:54,933 INFO L226 Difference]: Without dead ends: 228 [2021-12-21 18:14:54,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:14:54,933 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 273 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:14:54,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 186 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:14:54,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-12-21 18:14:54,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 195. [2021-12-21 18:14:54,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 152 states have (on average 1.513157894736842) internal successors, (230), 194 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:14:54,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 230 transitions. [2021-12-21 18:14:54,938 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 230 transitions. Word has length 18 [2021-12-21 18:14:54,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:14:54,939 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 230 transitions. [2021-12-21 18:14:54,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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) [2021-12-21 18:14:54,939 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 230 transitions. [2021-12-21 18:14:54,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-21 18:14:54,940 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:14:54,940 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:14:54,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-21 18:14:55,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:14:55,144 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:14:55,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:14:55,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1799357454, now seen corresponding path program 1 times [2021-12-21 18:14:55,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:14:55,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2000405960] [2021-12-21 18:14:55,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:14:55,145 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:14:55,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:14:55,146 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) [2021-12-21 18:14:55,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-21 18:14:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:14:55,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-21 18:14:55,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:14:55,279 INFO L353 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-21 18:14:55,279 INFO L387 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 12 treesize of output 21 [2021-12-21 18:14:55,393 INFO L353 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-12-21 18:14:55,394 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2021-12-21 18:14:55,499 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:14:55,808 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:14:55,809 INFO L387 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 47 treesize of output 43 [2021-12-21 18:14:55,959 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:14:55,960 INFO L387 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 44 treesize of output 43 [2021-12-21 18:14:56,420 INFO L387 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 41 treesize of output 25 [2021-12-21 18:14:56,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:14:56,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:14:56,698 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_182) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2021-12-21 18:14:56,805 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:14:56,805 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2021-12-21 18:14:56,817 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:14:56,817 INFO L387 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 34 treesize of output 37 [2021-12-21 18:14:56,822 INFO L387 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 9 [2021-12-21 18:15:09,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:15:09,310 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:15:09,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2000405960] [2021-12-21 18:15:09,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2000405960] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:15:09,310 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:15:09,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2021-12-21 18:15:09,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583212309] [2021-12-21 18:15:09,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:15:09,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-21 18:15:09,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:15:09,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-21 18:15:09,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=313, Unknown=7, NotChecked=36, Total=420 [2021-12-21 18:15:09,311 INFO L87 Difference]: Start difference. First operand 195 states and 230 transitions. Second operand has 21 states, 20 states have (on average 2.4) internal successors, (48), 21 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:15:09,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:15:09,795 INFO L93 Difference]: Finished difference Result 219 states and 260 transitions. [2021-12-21 18:15:09,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 18:15:09,795 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 21 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-21 18:15:09,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:15:09,796 INFO L225 Difference]: With dead ends: 219 [2021-12-21 18:15:09,796 INFO L226 Difference]: Without dead ends: 219 [2021-12-21 18:15:09,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=139, Invalid=508, Unknown=7, NotChecked=48, Total=702 [2021-12-21 18:15:09,797 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 39 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 549 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:15:09,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 973 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 549 Unchecked, 0.2s Time] [2021-12-21 18:15:09,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-12-21 18:15:09,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 214. [2021-12-21 18:15:09,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 171 states have (on average 1.4853801169590644) internal successors, (254), 213 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:15:09,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 254 transitions. [2021-12-21 18:15:09,802 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 254 transitions. Word has length 24 [2021-12-21 18:15:09,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:15:09,802 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 254 transitions. [2021-12-21 18:15:09,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 21 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:15:09,802 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 254 transitions. [2021-12-21 18:15:09,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-21 18:15:09,803 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:15:09,804 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:15:09,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-21 18:15:10,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:15:10,014 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:15:10,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:15:10,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1799357455, now seen corresponding path program 1 times [2021-12-21 18:15:10,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:15:10,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684453677] [2021-12-21 18:15:10,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:10,015 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:15:10,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:15:10,016 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) [2021-12-21 18:15:10,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-21 18:15:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:10,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-21 18:15:10,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:15:10,121 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:15:10,177 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:15:10,178 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:15:10,187 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:15:10,221 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:15:10,230 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:15:10,362 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-21 18:15:10,363 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-21 18:15:10,367 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-21 18:15:10,388 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:15:10,389 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-21 18:15:10,463 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:15:10,463 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-21 18:15:10,467 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-21 18:15:10,620 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-21 18:15:10,624 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 18:15:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:15:10,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:15:10,937 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_226 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_225 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_226 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-21 18:15:11,002 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_225 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_226 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_226 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32)))))) is different from false [2021-12-21 18:15:11,032 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_225 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_226 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_226) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_225) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_226 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_226) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) is different from false [2021-12-21 18:15:11,065 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:15:11,065 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2021-12-21 18:15:11,080 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:15:11,080 INFO L387 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 43 [2021-12-21 18:15:11,088 INFO L387 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 15 treesize of output 11 [2021-12-21 18:15:11,133 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:15:11,134 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-21 18:15:11,144 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:15:11,145 INFO L387 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 1 case distinctions, treesize of input 29 treesize of output 30 [2021-12-21 18:15:11,148 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:15:11,151 INFO L387 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-12-21 18:15:11,154 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:15:11,157 INFO L387 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-12-21 18:15:11,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:15:11,305 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:15:11,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684453677] [2021-12-21 18:15:11,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [684453677] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:15:11,305 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:15:11,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2021-12-21 18:15:11,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902707950] [2021-12-21 18:15:11,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:15:11,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-21 18:15:11,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:15:11,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-21 18:15:11,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=227, Unknown=3, NotChecked=96, Total=380 [2021-12-21 18:15:11,310 INFO L87 Difference]: Start difference. First operand 214 states and 254 transitions. Second operand has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:15:14,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:15:14,385 INFO L93 Difference]: Finished difference Result 402 states and 461 transitions. [2021-12-21 18:15:14,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-21 18:15:14,386 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-21 18:15:14,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:15:14,387 INFO L225 Difference]: With dead ends: 402 [2021-12-21 18:15:14,388 INFO L226 Difference]: Without dead ends: 402 [2021-12-21 18:15:14,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=136, Invalid=425, Unknown=3, NotChecked=138, Total=702 [2021-12-21 18:15:14,389 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 439 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 1836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 764 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:15:14,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [439 Valid, 941 Invalid, 1836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1041 Invalid, 0 Unknown, 764 Unchecked, 2.1s Time] [2021-12-21 18:15:14,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2021-12-21 18:15:14,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 214. [2021-12-21 18:15:14,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 171 states have (on average 1.4795321637426901) internal successors, (253), 213 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:15:14,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 253 transitions. [2021-12-21 18:15:14,394 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 253 transitions. Word has length 24 [2021-12-21 18:15:14,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:15:14,394 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 253 transitions. [2021-12-21 18:15:14,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:15:14,394 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 253 transitions. [2021-12-21 18:15:14,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-21 18:15:14,395 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:15:14,395 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:15:14,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-21 18:15:14,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:15:14,603 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:15:14,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:15:14,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1680561416, now seen corresponding path program 1 times [2021-12-21 18:15:14,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:15:14,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2118511410] [2021-12-21 18:15:14,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:14,604 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:15:14,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:15:14,606 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) [2021-12-21 18:15:14,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-21 18:15:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:14,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 18:15:14,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:15:14,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 18:15:14,728 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:15:14,728 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:15:14,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2118511410] [2021-12-21 18:15:14,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2118511410] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:15:14,728 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:15:14,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 18:15:14,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200346089] [2021-12-21 18:15:14,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:15:14,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:15:14,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:15:14,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:15:14,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:15:14,730 INFO L87 Difference]: Start difference. First operand 214 states and 253 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:15:14,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:15:14,737 INFO L93 Difference]: Finished difference Result 216 states and 255 transitions. [2021-12-21 18:15:14,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:15:14,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-21 18:15:14,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:15:14,739 INFO L225 Difference]: With dead ends: 216 [2021-12-21 18:15:14,739 INFO L226 Difference]: Without dead ends: 216 [2021-12-21 18:15:14,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:15:14,740 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:15:14,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:15:14,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-12-21 18:15:14,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2021-12-21 18:15:14,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 173 states have (on average 1.4739884393063585) internal successors, (255), 215 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:15:14,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 255 transitions. [2021-12-21 18:15:14,745 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 255 transitions. Word has length 26 [2021-12-21 18:15:14,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:15:14,747 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 255 transitions. [2021-12-21 18:15:14,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:15:14,747 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 255 transitions. [2021-12-21 18:15:14,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-21 18:15:14,751 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:15:14,751 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:15:14,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-12-21 18:15:14,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:15:14,961 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:15:14,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:15:14,961 INFO L85 PathProgramCache]: Analyzing trace with hash -558780366, now seen corresponding path program 1 times [2021-12-21 18:15:14,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:15:14,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [581826281] [2021-12-21 18:15:14,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:14,962 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:15:14,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:15:14,963 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) [2021-12-21 18:15:14,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-21 18:15:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:15,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 18:15:15,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:15:15,099 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:15:15,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 18:15:15,103 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:15:15,103 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:15:15,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [581826281] [2021-12-21 18:15:15,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [581826281] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:15:15,104 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:15:15,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:15:15,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000318235] [2021-12-21 18:15:15,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:15:15,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:15:15,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:15:15,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:15:15,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:15:15,106 INFO L87 Difference]: Start difference. First operand 216 states and 255 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:15:15,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:15:15,244 INFO L93 Difference]: Finished difference Result 214 states and 249 transitions. [2021-12-21 18:15:15,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:15:15,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-21 18:15:15,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:15:15,245 INFO L225 Difference]: With dead ends: 214 [2021-12-21 18:15:15,246 INFO L226 Difference]: Without dead ends: 214 [2021-12-21 18:15:15,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:15:15,246 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 70 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:15:15,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 163 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:15:15,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-12-21 18:15:15,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2021-12-21 18:15:15,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 173 states have (on average 1.439306358381503) internal successors, (249), 212 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:15:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 249 transitions. [2021-12-21 18:15:15,251 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 249 transitions. Word has length 27 [2021-12-21 18:15:15,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:15:15,251 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 249 transitions. [2021-12-21 18:15:15,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:15:15,252 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 249 transitions. [2021-12-21 18:15:15,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-21 18:15:15,252 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:15:15,252 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:15:15,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-21 18:15:15,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:15:15,467 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:15:15,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:15:15,468 INFO L85 PathProgramCache]: Analyzing trace with hash -558780365, now seen corresponding path program 1 times [2021-12-21 18:15:15,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:15:15,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315992984] [2021-12-21 18:15:15,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:15,469 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:15:15,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:15:15,469 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) [2021-12-21 18:15:15,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-21 18:15:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:15,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 18:15:15,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:15:15,586 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:15:15,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 18:15:15,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:15:15,595 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:15:15,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315992984] [2021-12-21 18:15:15,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1315992984] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:15:15,595 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:15:15,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:15:15,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835943028] [2021-12-21 18:15:15,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:15:15,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:15:15,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:15:15,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:15:15,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:15:15,597 INFO L87 Difference]: Start difference. First operand 213 states and 249 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:15:15,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:15:15,766 INFO L93 Difference]: Finished difference Result 210 states and 243 transitions. [2021-12-21 18:15:15,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:15:15,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-21 18:15:15,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:15:15,768 INFO L225 Difference]: With dead ends: 210 [2021-12-21 18:15:15,768 INFO L226 Difference]: Without dead ends: 210 [2021-12-21 18:15:15,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:15:15,768 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 75 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:15:15,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 141 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:15:15,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-12-21 18:15:15,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2021-12-21 18:15:15,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 173 states have (on average 1.4046242774566473) internal successors, (243), 209 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:15:15,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 243 transitions. [2021-12-21 18:15:15,773 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 243 transitions. Word has length 27 [2021-12-21 18:15:15,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:15:15,773 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 243 transitions. [2021-12-21 18:15:15,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:15:15,773 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 243 transitions. [2021-12-21 18:15:15,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-21 18:15:15,774 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:15:15,774 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:15:15,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-21 18:15:15,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:15:15,987 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:15:15,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:15:15,988 INFO L85 PathProgramCache]: Analyzing trace with hash -142290181, now seen corresponding path program 1 times [2021-12-21 18:15:15,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:15:15,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299215457] [2021-12-21 18:15:15,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:15,988 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:15:15,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:15:15,990 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) [2021-12-21 18:15:15,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-21 18:15:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:16,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-21 18:15:16,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:15:16,180 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 18:15:16,183 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 18:15:16,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 18:15:16,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:15:16,200 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:15:16,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299215457] [2021-12-21 18:15:16,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299215457] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:15:16,200 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:15:16,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 18:15:16,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259626144] [2021-12-21 18:15:16,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:15:16,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:15:16,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:15:16,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:15:16,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:15:16,201 INFO L87 Difference]: Start difference. First operand 210 states and 243 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:15:16,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:15:16,646 INFO L93 Difference]: Finished difference Result 219 states and 252 transitions. [2021-12-21 18:15:16,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:15:16,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2021-12-21 18:15:16,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:15:16,647 INFO L225 Difference]: With dead ends: 219 [2021-12-21 18:15:16,647 INFO L226 Difference]: Without dead ends: 219 [2021-12-21 18:15:16,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-21 18:15:16,648 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 25 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 18:15:16,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 414 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-21 18:15:16,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-12-21 18:15:16,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 214. [2021-12-21 18:15:16,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 177 states have (on average 1.4011299435028248) internal successors, (248), 213 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:15:16,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 248 transitions. [2021-12-21 18:15:16,653 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 248 transitions. Word has length 28 [2021-12-21 18:15:16,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:15:16,653 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 248 transitions. [2021-12-21 18:15:16,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:15:16,653 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 248 transitions. [2021-12-21 18:15:16,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-21 18:15:16,654 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:15:16,654 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:15:16,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-21 18:15:16,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:15:16,864 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:15:16,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:15:16,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1957250928, now seen corresponding path program 1 times [2021-12-21 18:15:16,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:15:16,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [987917304] [2021-12-21 18:15:16,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:16,866 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:15:16,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:15:16,867 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) [2021-12-21 18:15:16,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-21 18:15:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:16,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-21 18:15:16,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:15:16,988 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:15:17,040 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:15:17,041 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:15:17,075 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:15:17,083 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:15:17,208 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-21 18:15:17,208 INFO L387 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 25 [2021-12-21 18:15:17,214 INFO L387 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 [2021-12-21 18:15:17,241 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:15:17,242 INFO L387 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 22 treesize of output 22 [2021-12-21 18:15:17,311 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:15:17,311 INFO L387 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 54 treesize of output 51 [2021-12-21 18:15:17,316 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-12-21 18:15:17,319 INFO L387 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 35 treesize of output 35 [2021-12-21 18:15:17,486 INFO L387 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 33 treesize of output 21 [2021-12-21 18:15:17,489 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2021-12-21 18:15:17,522 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 18:15:17,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:15:17,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:15:17,720 INFO L387 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 50 treesize of output 30 [2021-12-21 18:15:17,728 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32))))) is different from false [2021-12-21 18:15:17,770 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_413) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_#t~mem4#1.offset|))) (forall ((v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_411) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_#t~mem4#1.base|))) is different from false [2021-12-21 18:15:17,784 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_411) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_413) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-21 18:15:17,802 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:15:17,803 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-12-21 18:15:17,813 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:15:17,813 INFO L387 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 30 treesize of output 33 [2021-12-21 18:15:17,817 INFO L387 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 9 treesize of output 7 [2021-12-21 18:15:17,846 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-21 18:15:17,846 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2021-12-21 18:15:17,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:15:17,957 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:15:17,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [987917304] [2021-12-21 18:15:17,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [987917304] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:15:17,957 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:15:17,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2021-12-21 18:15:17,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850928261] [2021-12-21 18:15:17,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:15:17,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-21 18:15:17,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:15:17,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-21 18:15:17,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=336, Unknown=3, NotChecked=114, Total=506 [2021-12-21 18:15:17,959 INFO L87 Difference]: Start difference. First operand 214 states and 248 transitions. Second operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:15:19,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:15:19,842 INFO L93 Difference]: Finished difference Result 360 states and 407 transitions. [2021-12-21 18:15:19,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-21 18:15:19,843 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 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 29 [2021-12-21 18:15:19,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:15:19,844 INFO L225 Difference]: With dead ends: 360 [2021-12-21 18:15:19,844 INFO L226 Difference]: Without dead ends: 360 [2021-12-21 18:15:19,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=187, Invalid=752, Unknown=3, NotChecked=180, Total=1122 [2021-12-21 18:15:19,845 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 425 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 1758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 674 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:15:19,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [425 Valid, 1315 Invalid, 1758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1043 Invalid, 0 Unknown, 674 Unchecked, 1.3s Time] [2021-12-21 18:15:19,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-12-21 18:15:19,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 216. [2021-12-21 18:15:19,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 179 states have (on average 1.3966480446927374) internal successors, (250), 215 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:15:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 250 transitions. [2021-12-21 18:15:19,850 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 250 transitions. Word has length 29 [2021-12-21 18:15:19,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:15:19,850 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 250 transitions. [2021-12-21 18:15:19,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:15:19,850 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 250 transitions. [2021-12-21 18:15:19,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-21 18:15:19,851 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:15:19,851 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:15:19,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-12-21 18:15:20,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:15:20,061 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:15:20,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:15:20,061 INFO L85 PathProgramCache]: Analyzing trace with hash 247061139, now seen corresponding path program 1 times [2021-12-21 18:15:20,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:15:20,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810078374] [2021-12-21 18:15:20,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:20,062 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:15:20,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:15:20,063 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) [2021-12-21 18:15:20,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-21 18:15:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:20,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 18:15:20,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:15:20,226 INFO L387 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 17 treesize of output 9 [2021-12-21 18:15:20,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 18:15:20,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:15:20,239 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:15:20,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810078374] [2021-12-21 18:15:20,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810078374] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:15:20,239 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:15:20,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:15:20,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102410577] [2021-12-21 18:15:20,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:15:20,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:15:20,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:15:20,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:15:20,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:15:20,242 INFO L87 Difference]: Start difference. First operand 216 states and 250 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:15:20,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:15:20,700 INFO L93 Difference]: Finished difference Result 235 states and 269 transitions. [2021-12-21 18:15:20,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:15:20,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-21 18:15:20,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:15:20,702 INFO L225 Difference]: With dead ends: 235 [2021-12-21 18:15:20,702 INFO L226 Difference]: Without dead ends: 235 [2021-12-21 18:15:20,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-21 18:15:20,702 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 106 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 18:15:20,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 303 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-21 18:15:20,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-12-21 18:15:20,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 221. [2021-12-21 18:15:20,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 184 states have (on average 1.4076086956521738) internal successors, (259), 220 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:15:20,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 259 transitions. [2021-12-21 18:15:20,706 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 259 transitions. Word has length 31 [2021-12-21 18:15:20,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:15:20,706 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 259 transitions. [2021-12-21 18:15:20,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:15:20,706 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 259 transitions. [2021-12-21 18:15:20,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-21 18:15:20,707 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:15:20,707 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:15:20,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-21 18:15:20,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:15:20,919 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-21 18:15:20,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:15:20,920 INFO L85 PathProgramCache]: Analyzing trace with hash 247061140, now seen corresponding path program 1 times [2021-12-21 18:15:20,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:15:20,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [842973013] [2021-12-21 18:15:20,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:20,920 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:15:20,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:15:20,922 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) [2021-12-21 18:15:20,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-21 18:15:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:21,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-21 18:15:21,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:15:21,169 INFO L387 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 23 treesize of output 15 [2021-12-21 18:15:21,172 INFO L387 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 34 treesize of output 18 [2021-12-21 18:15:21,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 18:15:21,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:15:21,254 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:15:21,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [842973013] [2021-12-21 18:15:21,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [842973013] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:15:21,254 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:15:21,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:15:21,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727454135] [2021-12-21 18:15:21,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:15:21,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:15:21,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:15:21,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:15:21,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:15:21,255 INFO L87 Difference]: Start difference. First operand 221 states and 259 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)