./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-01-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 2ea18b6ba0d977117db11fbdff34c486def646c3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 06:39:42,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 06:39:42,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 06:39:42,311 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 06:39:42,311 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 06:39:42,312 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 06:39:42,313 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 06:39:42,314 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 06:39:42,315 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 06:39:42,315 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 06:39:42,316 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 06:39:42,317 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 06:39:42,317 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 06:39:42,318 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 06:39:42,319 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 06:39:42,319 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 06:39:42,320 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 06:39:42,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 06:39:42,322 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 06:39:42,323 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 06:39:42,324 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 06:39:42,324 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 06:39:42,325 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 06:39:42,326 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 06:39:42,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 06:39:42,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 06:39:42,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 06:39:42,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 06:39:42,328 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 06:39:42,329 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 06:39:42,329 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 06:39:42,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 06:39:42,330 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 06:39:42,330 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 06:39:42,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 06:39:42,331 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 06:39:42,332 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 06:39:42,332 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 06:39:42,332 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 06:39:42,333 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 06:39:42,333 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 06:39:42,334 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-08-27 06:39:42,349 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 06:39:42,349 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 06:39:42,349 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 06:39:42,349 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 06:39:42,350 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 06:39:42,350 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 06:39:42,350 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 06:39:42,351 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 06:39:42,351 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 06:39:42,351 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 06:39:42,351 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 06:39:42,351 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 06:39:42,351 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 06:39:42,351 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 06:39:42,351 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 06:39:42,352 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 06:39:42,352 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 06:39:42,352 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 06:39:42,358 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 06:39:42,359 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 06:39:42,359 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 06:39:42,359 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 06:39:42,359 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 06:39:42,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:39:42,359 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 06:39:42,359 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 06:39:42,359 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 06:39:42,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 06:39:42,360 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 06:39:42,360 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 -> 2ea18b6ba0d977117db11fbdff34c486def646c3 [2021-08-27 06:39:42,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 06:39:42,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 06:39:42,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 06:39:42,596 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 06:39:42,597 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 06:39:42,598 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-2.i [2021-08-27 06:39:42,650 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfe269eed/3a4d8b1dbc534c7ab247968b685dd402/FLAGb2e9fd2dd [2021-08-27 06:39:43,042 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 06:39:43,043 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i [2021-08-27 06:39:43,050 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfe269eed/3a4d8b1dbc534c7ab247968b685dd402/FLAGb2e9fd2dd [2021-08-27 06:39:43,059 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfe269eed/3a4d8b1dbc534c7ab247968b685dd402 [2021-08-27 06:39:43,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 06:39:43,062 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 06:39:43,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 06:39:43,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 06:39:43,066 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 06:39:43,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:39:43" (1/1) ... [2021-08-27 06:39:43,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e9c88d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:39:43, skipping insertion in model container [2021-08-27 06:39:43,067 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:39:43" (1/1) ... [2021-08-27 06:39:43,071 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 06:39:43,098 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 06:39:43,371 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2021-08-27 06:39:43,374 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2021-08-27 06:39:43,375 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2021-08-27 06:39:43,376 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2021-08-27 06:39:43,388 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2021-08-27 06:39:43,389 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2021-08-27 06:39:43,390 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2021-08-27 06:39:43,390 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2021-08-27 06:39:43,391 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2021-08-27 06:39:43,392 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2021-08-27 06:39:43,393 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2021-08-27 06:39:43,394 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2021-08-27 06:39:43,394 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2021-08-27 06:39:43,397 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:39:43,402 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 06:39:43,421 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2021-08-27 06:39:43,423 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2021-08-27 06:39:43,424 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2021-08-27 06:39:43,424 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2021-08-27 06:39:43,426 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2021-08-27 06:39:43,426 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2021-08-27 06:39:43,427 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2021-08-27 06:39:43,428 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2021-08-27 06:39:43,428 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2021-08-27 06:39:43,429 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2021-08-27 06:39:43,430 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2021-08-27 06:39:43,430 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2021-08-27 06:39:43,431 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2021-08-27 06:39:43,432 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:39:43,450 INFO L208 MainTranslator]: Completed translation [2021-08-27 06:39:43,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:39:43 WrapperNode [2021-08-27 06:39:43,450 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 06:39:43,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 06:39:43,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 06:39:43,451 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 06:39:43,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:39:43" (1/1) ... [2021-08-27 06:39:43,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:39:43" (1/1) ... [2021-08-27 06:39:43,467 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:39:43" (1/1) ... [2021-08-27 06:39:43,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:39:43" (1/1) ... [2021-08-27 06:39:43,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:39:43" (1/1) ... [2021-08-27 06:39:43,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:39:43" (1/1) ... [2021-08-27 06:39:43,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:39:43" (1/1) ... [2021-08-27 06:39:43,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 06:39:43,491 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 06:39:43,491 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 06:39:43,491 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 06:39:43,492 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:39:43" (1/1) ... [2021-08-27 06:39:43,496 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:39:43,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:39:43,509 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 06:39:43,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 06:39:43,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 06:39:43,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 06:39:43,556 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 06:39:43,556 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 06:39:43,556 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 06:39:43,556 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 06:39:43,556 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 06:39:43,556 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 06:39:43,556 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 06:39:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 06:39:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 06:39:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 06:39:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 06:39:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 06:39:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 06:39:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 06:39:43,557 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 06:39:43,558 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 06:39:43,558 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 06:39:43,558 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 06:39:43,558 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 06:39:43,558 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 06:39:43,558 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 06:39:43,558 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 06:39:43,558 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 06:39:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 06:39:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 06:39:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 06:39:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 06:39:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 06:39:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 06:39:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 06:39:43,560 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 06:39:43,560 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 06:39:43,560 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 06:39:43,560 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 06:39:43,560 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 06:39:43,560 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 06:39:43,560 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 06:39:43,560 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 06:39:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 06:39:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 06:39:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 06:39:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 06:39:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 06:39:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 06:39:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 06:39:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 06:39:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 06:39:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 06:39:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 06:39:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 06:39:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 06:39:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 06:39:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 06:39:43,563 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 06:39:43,563 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 06:39:43,563 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 06:39:43,563 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 06:39:43,563 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 06:39:43,563 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 06:39:43,563 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 06:39:43,564 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 06:39:43,564 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 06:39:43,564 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 06:39:43,564 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 06:39:43,564 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 06:39:43,564 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 06:39:43,564 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 06:39:43,564 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 06:39:43,565 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 06:39:43,565 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 06:39:43,565 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 06:39:43,565 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 06:39:43,565 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 06:39:43,565 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 06:39:43,565 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 06:39:43,565 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 06:39:43,566 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 06:39:43,566 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 06:39:43,566 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 06:39:43,571 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 06:39:43,571 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 06:39:43,571 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 06:39:43,571 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 06:39:43,572 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 06:39:43,572 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 06:39:43,572 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 06:39:43,572 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 06:39:43,572 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 06:39:43,572 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 06:39:43,572 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 06:39:43,572 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 06:39:43,572 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 06:39:43,573 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 06:39:43,573 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 06:39:43,573 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 06:39:43,573 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 06:39:43,573 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 06:39:43,573 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 06:39:43,573 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 06:39:43,573 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 06:39:43,574 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 06:39:43,574 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 06:39:43,574 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 06:39:43,574 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 06:39:43,574 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 06:39:43,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 06:39:43,574 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 06:39:43,574 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 06:39:43,575 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 06:39:43,575 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 06:39:43,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 06:39:43,575 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 06:39:43,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 06:39:43,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 06:39:43,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 06:39:43,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 06:39:43,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 06:39:43,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 06:39:43,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 06:39:43,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 06:39:43,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 06:39:44,045 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 06:39:44,045 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2021-08-27 06:39:44,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:39:44 BoogieIcfgContainer [2021-08-27 06:39:44,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 06:39:44,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 06:39:44,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 06:39:44,049 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 06:39:44,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 06:39:43" (1/3) ... [2021-08-27 06:39:44,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@183011ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:39:44, skipping insertion in model container [2021-08-27 06:39:44,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:39:43" (2/3) ... [2021-08-27 06:39:44,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@183011ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:39:44, skipping insertion in model container [2021-08-27 06:39:44,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:39:44" (3/3) ... [2021-08-27 06:39:44,051 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2021-08-27 06:39:44,055 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 06:39:44,055 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2021-08-27 06:39:44,081 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 06:39:44,085 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, mConcurrency=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-08-27 06:39:44,085 INFO L340 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2021-08-27 06:39:44,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 200 states, 115 states have (on average 2.1652173913043478) internal successors, (249), 195 states have internal predecessors, (249), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 06:39:44,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 06:39:44,102 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:44,107 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:44,107 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:44,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:44,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1164341321, now seen corresponding path program 1 times [2021-08-27 06:39:44,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:44,116 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728451610] [2021-08-27 06:39:44,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:44,117 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:44,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:44,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:44,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:44,299 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728451610] [2021-08-27 06:39:44,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728451610] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:44,300 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:44,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 06:39:44,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438995316] [2021-08-27 06:39:44,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:39:44,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:44,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:39:44,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:39:44,326 INFO L87 Difference]: Start difference. First operand has 200 states, 115 states have (on average 2.1652173913043478) internal successors, (249), 195 states have internal predecessors, (249), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:44,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:44,626 INFO L93 Difference]: Finished difference Result 201 states and 212 transitions. [2021-08-27 06:39:44,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:39:44,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-08-27 06:39:44,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:44,634 INFO L225 Difference]: With dead ends: 201 [2021-08-27 06:39:44,634 INFO L226 Difference]: Without dead ends: 197 [2021-08-27 06:39:44,635 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.5ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:39:44,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-08-27 06:39:44,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 192. [2021-08-27 06:39:44,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 117 states have (on average 1.7264957264957266) internal successors, (202), 188 states have internal predecessors, (202), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:44,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 205 transitions. [2021-08-27 06:39:44,662 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 205 transitions. Word has length 7 [2021-08-27 06:39:44,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:44,663 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 205 transitions. [2021-08-27 06:39:44,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:44,663 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 205 transitions. [2021-08-27 06:39:44,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 06:39:44,663 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:44,664 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:44,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 06:39:44,664 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:44,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:44,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1164341322, now seen corresponding path program 1 times [2021-08-27 06:39:44,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:44,665 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038403739] [2021-08-27 06:39:44,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:44,665 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:44,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:44,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:44,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:44,714 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038403739] [2021-08-27 06:39:44,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038403739] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:44,714 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:44,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 06:39:44,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485175968] [2021-08-27 06:39:44,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:39:44,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:44,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:39:44,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:39:44,716 INFO L87 Difference]: Start difference. First operand 192 states and 205 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:44,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:44,935 INFO L93 Difference]: Finished difference Result 222 states and 234 transitions. [2021-08-27 06:39:44,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:39:44,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-08-27 06:39:44,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:44,937 INFO L225 Difference]: With dead ends: 222 [2021-08-27 06:39:44,937 INFO L226 Difference]: Without dead ends: 222 [2021-08-27 06:39:44,938 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.7ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:39:44,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-08-27 06:39:44,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 202. [2021-08-27 06:39:44,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 134 states have (on average 1.664179104477612) internal successors, (223), 198 states have internal predecessors, (223), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:44,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 226 transitions. [2021-08-27 06:39:44,944 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 226 transitions. Word has length 7 [2021-08-27 06:39:44,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:44,944 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 226 transitions. [2021-08-27 06:39:44,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:44,945 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 226 transitions. [2021-08-27 06:39:44,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-27 06:39:44,945 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:44,945 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:44,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 06:39:44,946 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:44,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:44,946 INFO L82 PathProgramCache]: Analyzing trace with hash -2054455159, now seen corresponding path program 1 times [2021-08-27 06:39:44,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:44,946 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305517211] [2021-08-27 06:39:44,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:44,947 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:44,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:44,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:44,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:44,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305517211] [2021-08-27 06:39:44,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305517211] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:44,988 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:44,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:39:44,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269441508] [2021-08-27 06:39:44,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:39:44,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:44,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:39:44,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:39:44,990 INFO L87 Difference]: Start difference. First operand 202 states and 226 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:45,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:45,184 INFO L93 Difference]: Finished difference Result 217 states and 229 transitions. [2021-08-27 06:39:45,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:39:45,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-08-27 06:39:45,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:45,185 INFO L225 Difference]: With dead ends: 217 [2021-08-27 06:39:45,185 INFO L226 Difference]: Without dead ends: 217 [2021-08-27 06:39:45,186 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:39:45,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-08-27 06:39:45,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 200. [2021-08-27 06:39:45,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 133 states have (on average 1.6541353383458646) internal successors, (220), 196 states have internal predecessors, (220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:45,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 223 transitions. [2021-08-27 06:39:45,191 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 223 transitions. Word has length 9 [2021-08-27 06:39:45,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:45,191 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 223 transitions. [2021-08-27 06:39:45,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:45,191 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 223 transitions. [2021-08-27 06:39:45,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 06:39:45,192 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:45,192 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:45,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 06:39:45,192 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr9REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:45,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:45,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1492111941, now seen corresponding path program 1 times [2021-08-27 06:39:45,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:45,193 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864192241] [2021-08-27 06:39:45,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:45,193 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:45,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:45,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:45,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:45,248 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864192241] [2021-08-27 06:39:45,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864192241] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:45,248 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:45,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:39:45,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178095267] [2021-08-27 06:39:45,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:39:45,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:45,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:39:45,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:39:45,249 INFO L87 Difference]: Start difference. First operand 200 states and 223 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:45,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:45,495 INFO L93 Difference]: Finished difference Result 199 states and 222 transitions. [2021-08-27 06:39:45,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:39:45,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-08-27 06:39:45,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:45,496 INFO L225 Difference]: With dead ends: 199 [2021-08-27 06:39:45,496 INFO L226 Difference]: Without dead ends: 199 [2021-08-27 06:39:45,497 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 31.2ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:39:45,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-08-27 06:39:45,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-08-27 06:39:45,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 133 states have (on average 1.6466165413533835) internal successors, (219), 195 states have internal predecessors, (219), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:45,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 222 transitions. [2021-08-27 06:39:45,510 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 222 transitions. Word has length 15 [2021-08-27 06:39:45,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:45,511 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 222 transitions. [2021-08-27 06:39:45,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:45,511 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 222 transitions. [2021-08-27 06:39:45,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 06:39:45,511 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:45,512 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:45,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 06:39:45,512 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr10REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:45,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:45,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1492111940, now seen corresponding path program 1 times [2021-08-27 06:39:45,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:45,513 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314060656] [2021-08-27 06:39:45,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:45,513 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:45,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:45,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:45,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:45,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:45,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314060656] [2021-08-27 06:39:45,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314060656] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:45,583 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:45,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:39:45,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15359592] [2021-08-27 06:39:45,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:39:45,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:45,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:39:45,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:39:45,585 INFO L87 Difference]: Start difference. First operand 199 states and 222 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:45,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:45,830 INFO L93 Difference]: Finished difference Result 198 states and 221 transitions. [2021-08-27 06:39:45,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:39:45,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-08-27 06:39:45,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:45,831 INFO L225 Difference]: With dead ends: 198 [2021-08-27 06:39:45,831 INFO L226 Difference]: Without dead ends: 198 [2021-08-27 06:39:45,831 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 40.7ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:39:45,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-08-27 06:39:45,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-08-27 06:39:45,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 133 states have (on average 1.6390977443609023) internal successors, (218), 194 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 221 transitions. [2021-08-27 06:39:45,835 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 221 transitions. Word has length 15 [2021-08-27 06:39:45,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:45,835 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 221 transitions. [2021-08-27 06:39:45,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:45,836 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 221 transitions. [2021-08-27 06:39:45,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-27 06:39:45,836 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:45,836 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:45,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 06:39:45,837 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr19ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:45,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:45,837 INFO L82 PathProgramCache]: Analyzing trace with hash 331044621, now seen corresponding path program 1 times [2021-08-27 06:39:45,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:45,837 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995769072] [2021-08-27 06:39:45,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:45,838 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:45,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:45,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:45,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:45,871 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995769072] [2021-08-27 06:39:45,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995769072] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:45,871 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:45,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:39:45,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829440844] [2021-08-27 06:39:45,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:39:45,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:45,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:39:45,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:39:45,872 INFO L87 Difference]: Start difference. First operand 198 states and 221 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:46,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:46,037 INFO L93 Difference]: Finished difference Result 199 states and 222 transitions. [2021-08-27 06:39:46,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:39:46,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-08-27 06:39:46,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:46,039 INFO L225 Difference]: With dead ends: 199 [2021-08-27 06:39:46,039 INFO L226 Difference]: Without dead ends: 199 [2021-08-27 06:39:46,039 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:39:46,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-08-27 06:39:46,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-08-27 06:39:46,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 134 states have (on average 1.6343283582089552) internal successors, (219), 195 states have internal predecessors, (219), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:46,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 222 transitions. [2021-08-27 06:39:46,043 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 222 transitions. Word has length 17 [2021-08-27 06:39:46,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:46,043 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 222 transitions. [2021-08-27 06:39:46,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:46,043 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 222 transitions. [2021-08-27 06:39:46,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-27 06:39:46,044 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:46,044 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:46,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 06:39:46,044 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr13REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:46,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:46,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1404699164, now seen corresponding path program 1 times [2021-08-27 06:39:46,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:46,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733459446] [2021-08-27 06:39:46,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:46,046 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:46,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:46,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:46,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:46,136 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733459446] [2021-08-27 06:39:46,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733459446] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:46,136 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:46,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 06:39:46,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787173453] [2021-08-27 06:39:46,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:39:46,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:46,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:39:46,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:39:46,138 INFO L87 Difference]: Start difference. First operand 199 states and 222 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:46,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:46,498 INFO L93 Difference]: Finished difference Result 199 states and 221 transitions. [2021-08-27 06:39:46,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 06:39:46,499 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-08-27 06:39:46,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:46,499 INFO L225 Difference]: With dead ends: 199 [2021-08-27 06:39:46,499 INFO L226 Difference]: Without dead ends: 199 [2021-08-27 06:39:46,500 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 87.6ms TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-08-27 06:39:46,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-08-27 06:39:46,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2021-08-27 06:39:46,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 134 states have (on average 1.626865671641791) internal successors, (218), 194 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:46,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 221 transitions. [2021-08-27 06:39:46,503 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 221 transitions. Word has length 18 [2021-08-27 06:39:46,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:46,503 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 221 transitions. [2021-08-27 06:39:46,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:46,503 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 221 transitions. [2021-08-27 06:39:46,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-27 06:39:46,504 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:46,504 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:46,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 06:39:46,504 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr14REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:46,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:46,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1404699165, now seen corresponding path program 1 times [2021-08-27 06:39:46,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:46,505 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167124897] [2021-08-27 06:39:46,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:46,505 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:46,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:46,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:46,610 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167124897] [2021-08-27 06:39:46,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167124897] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:46,611 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:46,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 06:39:46,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212910621] [2021-08-27 06:39:46,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:39:46,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:46,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:39:46,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:39:46,612 INFO L87 Difference]: Start difference. First operand 198 states and 221 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:47,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:47,065 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2021-08-27 06:39:47,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 06:39:47,066 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-08-27 06:39:47,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:47,067 INFO L225 Difference]: With dead ends: 198 [2021-08-27 06:39:47,067 INFO L226 Difference]: Without dead ends: 198 [2021-08-27 06:39:47,067 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 104.4ms TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-08-27 06:39:47,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-08-27 06:39:47,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2021-08-27 06:39:47,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 134 states have (on average 1.6194029850746268) internal successors, (217), 193 states have internal predecessors, (217), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:47,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 220 transitions. [2021-08-27 06:39:47,070 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 220 transitions. Word has length 18 [2021-08-27 06:39:47,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:47,070 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 220 transitions. [2021-08-27 06:39:47,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:47,071 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 220 transitions. [2021-08-27 06:39:47,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 06:39:47,071 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:47,071 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:47,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 06:39:47,072 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr19ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:47,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:47,072 INFO L82 PathProgramCache]: Analyzing trace with hash 307937042, now seen corresponding path program 1 times [2021-08-27 06:39:47,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:47,072 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703144782] [2021-08-27 06:39:47,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:47,073 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:47,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:47,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:47,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:47,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703144782] [2021-08-27 06:39:47,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703144782] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:47,167 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:47,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 06:39:47,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791563654] [2021-08-27 06:39:47,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:39:47,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:47,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:39:47,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:39:47,169 INFO L87 Difference]: Start difference. First operand 197 states and 220 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:47,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:47,487 INFO L93 Difference]: Finished difference Result 289 states and 319 transitions. [2021-08-27 06:39:47,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 06:39:47,487 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-08-27 06:39:47,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:47,488 INFO L225 Difference]: With dead ends: 289 [2021-08-27 06:39:47,488 INFO L226 Difference]: Without dead ends: 289 [2021-08-27 06:39:47,489 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 91.0ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-08-27 06:39:47,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-08-27 06:39:47,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 194. [2021-08-27 06:39:47,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 132 states have (on average 1.621212121212121) internal successors, (214), 190 states have internal predecessors, (214), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:47,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2021-08-27 06:39:47,492 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 19 [2021-08-27 06:39:47,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:47,492 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2021-08-27 06:39:47,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:47,493 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2021-08-27 06:39:47,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 06:39:47,493 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:47,493 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:47,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 06:39:47,494 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr20REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:47,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:47,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1873843689, now seen corresponding path program 1 times [2021-08-27 06:39:47,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:47,494 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574644308] [2021-08-27 06:39:47,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:47,495 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:47,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:47,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:47,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:47,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574644308] [2021-08-27 06:39:47,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574644308] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:47,548 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:47,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 06:39:47,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033019459] [2021-08-27 06:39:47,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:39:47,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:47,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:39:47,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:39:47,549 INFO L87 Difference]: Start difference. First operand 194 states and 217 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:47,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:47,778 INFO L93 Difference]: Finished difference Result 290 states and 319 transitions. [2021-08-27 06:39:47,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:39:47,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-08-27 06:39:47,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:47,779 INFO L225 Difference]: With dead ends: 290 [2021-08-27 06:39:47,779 INFO L226 Difference]: Without dead ends: 290 [2021-08-27 06:39:47,780 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.7ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:39:47,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-08-27 06:39:47,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 197. [2021-08-27 06:39:47,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 135 states have (on average 1.6074074074074074) internal successors, (217), 193 states have internal predecessors, (217), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:47,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 220 transitions. [2021-08-27 06:39:47,783 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 220 transitions. Word has length 21 [2021-08-27 06:39:47,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:47,783 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 220 transitions. [2021-08-27 06:39:47,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:47,783 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 220 transitions. [2021-08-27 06:39:47,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 06:39:47,784 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:47,784 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:47,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 06:39:47,784 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr20REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:47,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:47,784 INFO L82 PathProgramCache]: Analyzing trace with hash -515815524, now seen corresponding path program 1 times [2021-08-27 06:39:47,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:47,785 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992381681] [2021-08-27 06:39:47,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:47,785 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:47,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:47,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:47,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:47,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992381681] [2021-08-27 06:39:47,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992381681] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:47,824 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:47,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:39:47,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921883518] [2021-08-27 06:39:47,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:39:47,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:47,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:39:47,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:39:47,825 INFO L87 Difference]: Start difference. First operand 197 states and 220 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:48,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:48,046 INFO L93 Difference]: Finished difference Result 193 states and 214 transitions. [2021-08-27 06:39:48,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:39:48,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-08-27 06:39:48,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:48,048 INFO L225 Difference]: With dead ends: 193 [2021-08-27 06:39:48,048 INFO L226 Difference]: Without dead ends: 193 [2021-08-27 06:39:48,048 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:39:48,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-08-27 06:39:48,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 188. [2021-08-27 06:39:48,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 184 states have internal predecessors, (208), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:48,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 211 transitions. [2021-08-27 06:39:48,051 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 211 transitions. Word has length 23 [2021-08-27 06:39:48,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:48,051 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 211 transitions. [2021-08-27 06:39:48,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:48,051 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 211 transitions. [2021-08-27 06:39:48,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 06:39:48,052 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:48,052 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:48,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 06:39:48,052 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr21REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:48,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:48,053 INFO L82 PathProgramCache]: Analyzing trace with hash -515815523, now seen corresponding path program 1 times [2021-08-27 06:39:48,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:48,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187915259] [2021-08-27 06:39:48,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:48,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:48,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:48,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:48,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:48,132 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187915259] [2021-08-27 06:39:48,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187915259] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:48,132 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:48,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 06:39:48,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034598768] [2021-08-27 06:39:48,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:39:48,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:48,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:39:48,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:39:48,133 INFO L87 Difference]: Start difference. First operand 188 states and 211 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:48,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:48,453 INFO L93 Difference]: Finished difference Result 249 states and 266 transitions. [2021-08-27 06:39:48,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:39:48,454 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-08-27 06:39:48,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:48,455 INFO L225 Difference]: With dead ends: 249 [2021-08-27 06:39:48,455 INFO L226 Difference]: Without dead ends: 249 [2021-08-27 06:39:48,455 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 42.4ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:39:48,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-08-27 06:39:48,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 212. [2021-08-27 06:39:48,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 161 states have (on average 1.5341614906832297) internal successors, (247), 208 states have internal predecessors, (247), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:48,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 250 transitions. [2021-08-27 06:39:48,458 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 250 transitions. Word has length 23 [2021-08-27 06:39:48,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:48,459 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 250 transitions. [2021-08-27 06:39:48,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:48,459 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 250 transitions. [2021-08-27 06:39:48,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 06:39:48,459 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:48,459 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:48,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 06:39:48,460 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr45ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:48,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:48,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1777429398, now seen corresponding path program 1 times [2021-08-27 06:39:48,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:48,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498571390] [2021-08-27 06:39:48,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:48,461 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:48,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:48,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:48,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:48,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498571390] [2021-08-27 06:39:48,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498571390] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:48,495 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:48,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:39:48,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114209897] [2021-08-27 06:39:48,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:39:48,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:48,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:39:48,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:39:48,496 INFO L87 Difference]: Start difference. First operand 212 states and 250 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:48,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:48,675 INFO L93 Difference]: Finished difference Result 244 states and 260 transitions. [2021-08-27 06:39:48,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:39:48,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 06:39:48,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:48,677 INFO L225 Difference]: With dead ends: 244 [2021-08-27 06:39:48,677 INFO L226 Difference]: Without dead ends: 244 [2021-08-27 06:39:48,677 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.2ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:39:48,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-08-27 06:39:48,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 210. [2021-08-27 06:39:48,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 160 states have (on average 1.525) internal successors, (244), 206 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:48,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 247 transitions. [2021-08-27 06:39:48,680 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 247 transitions. Word has length 25 [2021-08-27 06:39:48,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:48,680 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 247 transitions. [2021-08-27 06:39:48,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:48,680 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 247 transitions. [2021-08-27 06:39:48,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 06:39:48,681 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:48,681 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:48,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 06:39:48,681 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr24REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:48,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:48,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1241440350, now seen corresponding path program 1 times [2021-08-27 06:39:48,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:48,682 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559646988] [2021-08-27 06:39:48,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:48,682 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:48,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:48,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:48,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:48,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559646988] [2021-08-27 06:39:48,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559646988] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:48,728 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:48,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 06:39:48,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686710694] [2021-08-27 06:39:48,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:39:48,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:48,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:39:48,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:39:48,729 INFO L87 Difference]: Start difference. First operand 210 states and 247 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:49,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:49,009 INFO L93 Difference]: Finished difference Result 210 states and 247 transitions. [2021-08-27 06:39:49,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 06:39:49,009 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-08-27 06:39:49,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:49,010 INFO L225 Difference]: With dead ends: 210 [2021-08-27 06:39:49,010 INFO L226 Difference]: Without dead ends: 210 [2021-08-27 06:39:49,010 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 44.2ms TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:39:49,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-08-27 06:39:49,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2021-08-27 06:39:49,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 160 states have (on average 1.51875) internal successors, (243), 205 states have internal predecessors, (243), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:49,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 246 transitions. [2021-08-27 06:39:49,013 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 246 transitions. Word has length 27 [2021-08-27 06:39:49,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:49,013 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 246 transitions. [2021-08-27 06:39:49,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:49,014 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 246 transitions. [2021-08-27 06:39:49,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 06:39:49,014 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:49,014 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:49,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 06:39:49,015 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr25REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:49,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:49,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1241440351, now seen corresponding path program 1 times [2021-08-27 06:39:49,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:49,015 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735078319] [2021-08-27 06:39:49,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:49,015 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:49,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:49,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:49,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:49,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735078319] [2021-08-27 06:39:49,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735078319] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:49,076 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:49,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 06:39:49,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326219552] [2021-08-27 06:39:49,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:39:49,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:49,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:39:49,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:39:49,077 INFO L87 Difference]: Start difference. First operand 209 states and 246 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:49,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:49,398 INFO L93 Difference]: Finished difference Result 202 states and 239 transitions. [2021-08-27 06:39:49,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 06:39:49,398 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-08-27 06:39:49,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:49,399 INFO L225 Difference]: With dead ends: 202 [2021-08-27 06:39:49,399 INFO L226 Difference]: Without dead ends: 202 [2021-08-27 06:39:49,400 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 92.3ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-08-27 06:39:49,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-08-27 06:39:49,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 195. [2021-08-27 06:39:49,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 155 states have (on average 1.4709677419354839) internal successors, (228), 191 states have internal predecessors, (228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:49,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 231 transitions. [2021-08-27 06:39:49,403 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 231 transitions. Word has length 27 [2021-08-27 06:39:49,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:49,403 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 231 transitions. [2021-08-27 06:39:49,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:49,403 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 231 transitions. [2021-08-27 06:39:49,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 06:39:49,404 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:49,404 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:49,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 06:39:49,404 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr26ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:49,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:49,405 INFO L82 PathProgramCache]: Analyzing trace with hash -976729154, now seen corresponding path program 1 times [2021-08-27 06:39:49,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:49,405 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201130435] [2021-08-27 06:39:49,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:49,405 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:49,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:49,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:49,457 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:49,457 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201130435] [2021-08-27 06:39:49,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201130435] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:49,458 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:49,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 06:39:49,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244007481] [2021-08-27 06:39:49,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:39:49,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:49,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:39:49,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:39:49,459 INFO L87 Difference]: Start difference. First operand 195 states and 231 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:49,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:49,677 INFO L93 Difference]: Finished difference Result 198 states and 235 transitions. [2021-08-27 06:39:49,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 06:39:49,677 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-08-27 06:39:49,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:49,678 INFO L225 Difference]: With dead ends: 198 [2021-08-27 06:39:49,678 INFO L226 Difference]: Without dead ends: 198 [2021-08-27 06:39:49,678 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 55.9ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-08-27 06:39:49,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-08-27 06:39:49,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191. [2021-08-27 06:39:49,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 187 states have internal predecessors, (224), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:49,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 227 transitions. [2021-08-27 06:39:49,681 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 227 transitions. Word has length 29 [2021-08-27 06:39:49,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:49,681 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 227 transitions. [2021-08-27 06:39:49,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:49,682 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 227 transitions. [2021-08-27 06:39:49,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 06:39:49,682 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:49,682 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:49,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 06:39:49,682 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr59ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:49,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:49,683 INFO L82 PathProgramCache]: Analyzing trace with hash 90529238, now seen corresponding path program 1 times [2021-08-27 06:39:49,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:49,683 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682581952] [2021-08-27 06:39:49,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:49,683 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:49,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:49,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:49,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:49,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682581952] [2021-08-27 06:39:49,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682581952] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:49,713 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:49,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:39:49,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956007772] [2021-08-27 06:39:49,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:39:49,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:49,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:39:49,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:39:49,714 INFO L87 Difference]: Start difference. First operand 191 states and 227 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:49,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:49,842 INFO L93 Difference]: Finished difference Result 264 states and 315 transitions. [2021-08-27 06:39:49,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:39:49,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-08-27 06:39:49,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:49,843 INFO L225 Difference]: With dead ends: 264 [2021-08-27 06:39:49,843 INFO L226 Difference]: Without dead ends: 264 [2021-08-27 06:39:49,843 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:39:49,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-08-27 06:39:49,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 197. [2021-08-27 06:39:49,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 159 states have (on average 1.4591194968553458) internal successors, (232), 193 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:49,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 235 transitions. [2021-08-27 06:39:49,846 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 235 transitions. Word has length 31 [2021-08-27 06:39:49,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:49,846 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 235 transitions. [2021-08-27 06:39:49,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:49,847 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 235 transitions. [2021-08-27 06:39:49,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-27 06:39:49,847 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:49,847 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:49,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 06:39:49,847 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr48ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:49,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:49,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1488582203, now seen corresponding path program 1 times [2021-08-27 06:39:49,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:49,848 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007733126] [2021-08-27 06:39:49,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:49,848 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:49,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:49,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:49,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:49,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007733126] [2021-08-27 06:39:49,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007733126] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:49,881 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:49,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:39:49,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278985298] [2021-08-27 06:39:49,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:39:49,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:49,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:39:49,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:39:49,882 INFO L87 Difference]: Start difference. First operand 197 states and 235 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:50,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:50,012 INFO L93 Difference]: Finished difference Result 195 states and 232 transitions. [2021-08-27 06:39:50,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:39:50,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-08-27 06:39:50,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:50,013 INFO L225 Difference]: With dead ends: 195 [2021-08-27 06:39:50,013 INFO L226 Difference]: Without dead ends: 195 [2021-08-27 06:39:50,014 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:39:50,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-08-27 06:39:50,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-08-27 06:39:50,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 158 states have (on average 1.4493670886075949) internal successors, (229), 191 states have internal predecessors, (229), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:50,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 232 transitions. [2021-08-27 06:39:50,016 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 232 transitions. Word has length 32 [2021-08-27 06:39:50,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:50,017 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 232 transitions. [2021-08-27 06:39:50,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:50,017 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 232 transitions. [2021-08-27 06:39:50,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-27 06:39:50,017 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:50,017 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:50,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 06:39:50,018 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr49REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:50,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:50,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1098596299, now seen corresponding path program 1 times [2021-08-27 06:39:50,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:50,018 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030733571] [2021-08-27 06:39:50,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:50,018 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:50,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:50,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:50,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:50,128 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030733571] [2021-08-27 06:39:50,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030733571] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:50,128 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:50,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 06:39:50,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530720036] [2021-08-27 06:39:50,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 06:39:50,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:50,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 06:39:50,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:39:50,129 INFO L87 Difference]: Start difference. First operand 195 states and 232 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:50,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:50,613 INFO L93 Difference]: Finished difference Result 325 states and 363 transitions. [2021-08-27 06:39:50,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 06:39:50,613 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2021-08-27 06:39:50,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:50,614 INFO L225 Difference]: With dead ends: 325 [2021-08-27 06:39:50,614 INFO L226 Difference]: Without dead ends: 325 [2021-08-27 06:39:50,614 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 158.5ms TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2021-08-27 06:39:50,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-08-27 06:39:50,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 228. [2021-08-27 06:39:50,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 191 states have (on average 1.3979057591623036) internal successors, (267), 224 states have internal predecessors, (267), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:50,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 270 transitions. [2021-08-27 06:39:50,618 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 270 transitions. Word has length 33 [2021-08-27 06:39:50,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:50,618 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 270 transitions. [2021-08-27 06:39:50,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:50,618 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 270 transitions. [2021-08-27 06:39:50,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-27 06:39:50,619 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:50,619 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:50,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-27 06:39:50,619 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr46REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:50,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:50,619 INFO L82 PathProgramCache]: Analyzing trace with hash -49345090, now seen corresponding path program 1 times [2021-08-27 06:39:50,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:50,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484951677] [2021-08-27 06:39:50,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:50,620 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:50,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:50,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:50,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:50,686 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484951677] [2021-08-27 06:39:50,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484951677] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:39:50,686 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184318511] [2021-08-27 06:39:50,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:50,687 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:39:50,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:39:50,688 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:39:50,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-27 06:39:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:50,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-27 06:39:50,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:39:50,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:39:50,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:39:50,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:39:50,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:39:50,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:39:50,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:39:51,307 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-08-27 06:39:51,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 40 [2021-08-27 06:39:51,319 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-08-27 06:39:51,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 22 [2021-08-27 06:39:51,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:51,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184318511] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:39:51,333 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:39:51,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2021-08-27 06:39:51,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725225384] [2021-08-27 06:39:51,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 06:39:51,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:51,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 06:39:51,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:39:51,335 INFO L87 Difference]: Start difference. First operand 228 states and 270 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:51,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:51,794 INFO L93 Difference]: Finished difference Result 381 states and 422 transitions. [2021-08-27 06:39:51,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 06:39:51,794 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-08-27 06:39:51,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:51,795 INFO L225 Difference]: With dead ends: 381 [2021-08-27 06:39:51,795 INFO L226 Difference]: Without dead ends: 381 [2021-08-27 06:39:51,795 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 187.2ms TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2021-08-27 06:39:51,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-08-27 06:39:51,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 266. [2021-08-27 06:39:51,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 229 states have (on average 1.4017467248908297) internal successors, (321), 262 states have internal predecessors, (321), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:51,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 324 transitions. [2021-08-27 06:39:51,799 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 324 transitions. Word has length 35 [2021-08-27 06:39:51,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:51,799 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 324 transitions. [2021-08-27 06:39:51,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:51,799 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 324 transitions. [2021-08-27 06:39:51,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-27 06:39:51,800 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:51,800 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:51,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-08-27 06:39:52,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:39:52,013 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr34REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:52,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:52,014 INFO L82 PathProgramCache]: Analyzing trace with hash -824345932, now seen corresponding path program 1 times [2021-08-27 06:39:52,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:52,014 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686045861] [2021-08-27 06:39:52,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:52,014 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:52,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:52,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:52,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:52,065 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686045861] [2021-08-27 06:39:52,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686045861] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:52,066 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:52,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:39:52,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130304116] [2021-08-27 06:39:52,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:39:52,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:52,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:39:52,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:39:52,066 INFO L87 Difference]: Start difference. First operand 266 states and 324 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:52,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:52,263 INFO L93 Difference]: Finished difference Result 265 states and 323 transitions. [2021-08-27 06:39:52,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:39:52,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2021-08-27 06:39:52,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:52,264 INFO L225 Difference]: With dead ends: 265 [2021-08-27 06:39:52,264 INFO L226 Difference]: Without dead ends: 265 [2021-08-27 06:39:52,265 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 30.4ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:39:52,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-08-27 06:39:52,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2021-08-27 06:39:52,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 229 states have (on average 1.3973799126637554) internal successors, (320), 261 states have internal predecessors, (320), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:52,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 323 transitions. [2021-08-27 06:39:52,268 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 323 transitions. Word has length 37 [2021-08-27 06:39:52,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:52,268 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 323 transitions. [2021-08-27 06:39:52,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:52,268 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 323 transitions. [2021-08-27 06:39:52,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-27 06:39:52,268 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:52,268 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:52,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-27 06:39:52,268 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr35REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:52,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:52,269 INFO L82 PathProgramCache]: Analyzing trace with hash -824345931, now seen corresponding path program 1 times [2021-08-27 06:39:52,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:52,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178400365] [2021-08-27 06:39:52,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:52,269 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:52,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:52,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:52,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:52,323 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178400365] [2021-08-27 06:39:52,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178400365] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:52,323 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:52,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:39:52,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377538933] [2021-08-27 06:39:52,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:39:52,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:52,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:39:52,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:39:52,324 INFO L87 Difference]: Start difference. First operand 265 states and 323 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:52,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:52,530 INFO L93 Difference]: Finished difference Result 264 states and 322 transitions. [2021-08-27 06:39:52,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:39:52,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2021-08-27 06:39:52,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:52,533 INFO L225 Difference]: With dead ends: 264 [2021-08-27 06:39:52,533 INFO L226 Difference]: Without dead ends: 264 [2021-08-27 06:39:52,533 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 40.2ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:39:52,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-08-27 06:39:52,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2021-08-27 06:39:52,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 229 states have (on average 1.3930131004366813) internal successors, (319), 260 states have internal predecessors, (319), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:52,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 322 transitions. [2021-08-27 06:39:52,536 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 322 transitions. Word has length 37 [2021-08-27 06:39:52,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:52,536 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 322 transitions. [2021-08-27 06:39:52,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:52,536 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 322 transitions. [2021-08-27 06:39:52,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-27 06:39:52,537 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:52,537 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:52,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-27 06:39:52,537 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr49REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:52,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:52,537 INFO L82 PathProgramCache]: Analyzing trace with hash 385741532, now seen corresponding path program 1 times [2021-08-27 06:39:52,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:52,537 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643592035] [2021-08-27 06:39:52,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:52,537 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:52,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:52,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:52,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:52,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643592035] [2021-08-27 06:39:52,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643592035] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:52,669 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:52,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-27 06:39:52,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980557413] [2021-08-27 06:39:52,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 06:39:52,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:52,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 06:39:52,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-08-27 06:39:52,670 INFO L87 Difference]: Start difference. First operand 264 states and 322 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:53,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:53,304 INFO L93 Difference]: Finished difference Result 374 states and 421 transitions. [2021-08-27 06:39:53,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 06:39:53,304 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-08-27 06:39:53,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:53,305 INFO L225 Difference]: With dead ends: 374 [2021-08-27 06:39:53,305 INFO L226 Difference]: Without dead ends: 374 [2021-08-27 06:39:53,306 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 181.0ms TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2021-08-27 06:39:53,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-08-27 06:39:53,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 265. [2021-08-27 06:39:53,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 232 states have (on average 1.3663793103448276) internal successors, (317), 261 states have internal predecessors, (317), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:53,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 320 transitions. [2021-08-27 06:39:53,309 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 320 transitions. Word has length 38 [2021-08-27 06:39:53,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:53,309 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 320 transitions. [2021-08-27 06:39:53,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:53,309 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 320 transitions. [2021-08-27 06:39:53,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-27 06:39:53,310 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:53,310 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:53,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-27 06:39:53,310 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr50REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:53,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:53,310 INFO L82 PathProgramCache]: Analyzing trace with hash 385741533, now seen corresponding path program 1 times [2021-08-27 06:39:53,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:53,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276499023] [2021-08-27 06:39:53,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:53,310 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:53,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:53,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:53,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:53,491 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276499023] [2021-08-27 06:39:53,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276499023] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:53,491 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:53,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 06:39:53,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879434021] [2021-08-27 06:39:53,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 06:39:53,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:53,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 06:39:53,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-08-27 06:39:53,492 INFO L87 Difference]: Start difference. First operand 265 states and 320 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:54,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:54,247 INFO L93 Difference]: Finished difference Result 430 states and 478 transitions. [2021-08-27 06:39:54,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 06:39:54,247 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-08-27 06:39:54,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:54,248 INFO L225 Difference]: With dead ends: 430 [2021-08-27 06:39:54,248 INFO L226 Difference]: Without dead ends: 430 [2021-08-27 06:39:54,249 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 273.0ms TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2021-08-27 06:39:54,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2021-08-27 06:39:54,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 271. [2021-08-27 06:39:54,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 238 states have (on average 1.361344537815126) internal successors, (324), 267 states have internal predecessors, (324), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:54,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 327 transitions. [2021-08-27 06:39:54,252 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 327 transitions. Word has length 38 [2021-08-27 06:39:54,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:54,252 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 327 transitions. [2021-08-27 06:39:54,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:54,252 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 327 transitions. [2021-08-27 06:39:54,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-27 06:39:54,253 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:54,253 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:54,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-27 06:39:54,253 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr44ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:54,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:54,253 INFO L82 PathProgramCache]: Analyzing trace with hash 2104055878, now seen corresponding path program 1 times [2021-08-27 06:39:54,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:54,253 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499252988] [2021-08-27 06:39:54,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:54,253 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:54,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:54,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:54,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:54,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499252988] [2021-08-27 06:39:54,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499252988] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:54,284 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:54,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:39:54,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538790745] [2021-08-27 06:39:54,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:39:54,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:54,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:39:54,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:39:54,285 INFO L87 Difference]: Start difference. First operand 271 states and 327 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:54,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:54,422 INFO L93 Difference]: Finished difference Result 273 states and 329 transitions. [2021-08-27 06:39:54,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:39:54,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2021-08-27 06:39:54,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:54,426 INFO L225 Difference]: With dead ends: 273 [2021-08-27 06:39:54,426 INFO L226 Difference]: Without dead ends: 273 [2021-08-27 06:39:54,426 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:39:54,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-08-27 06:39:54,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2021-08-27 06:39:54,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 240 states have (on average 1.3583333333333334) internal successors, (326), 269 states have internal predecessors, (326), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:54,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 329 transitions. [2021-08-27 06:39:54,435 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 329 transitions. Word has length 39 [2021-08-27 06:39:54,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:54,435 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 329 transitions. [2021-08-27 06:39:54,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:54,436 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 329 transitions. [2021-08-27 06:39:54,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-27 06:39:54,436 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:54,436 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:54,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-27 06:39:54,436 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr64ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:54,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:54,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1003773134, now seen corresponding path program 1 times [2021-08-27 06:39:54,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:54,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102247415] [2021-08-27 06:39:54,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:54,438 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:54,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:54,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 06:39:54,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:54,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102247415] [2021-08-27 06:39:54,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102247415] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:54,528 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:54,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 06:39:54,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727202924] [2021-08-27 06:39:54,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:39:54,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:54,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:39:54,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:39:54,529 INFO L87 Difference]: Start difference. First operand 273 states and 329 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:54,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:54,825 INFO L93 Difference]: Finished difference Result 288 states and 344 transitions. [2021-08-27 06:39:54,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 06:39:54,826 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-08-27 06:39:54,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:54,827 INFO L225 Difference]: With dead ends: 288 [2021-08-27 06:39:54,827 INFO L226 Difference]: Without dead ends: 288 [2021-08-27 06:39:54,827 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 81.2ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-08-27 06:39:54,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-08-27 06:39:54,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 282. [2021-08-27 06:39:54,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 249 states have (on average 1.3453815261044177) internal successors, (335), 278 states have internal predecessors, (335), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:54,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 338 transitions. [2021-08-27 06:39:54,831 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 338 transitions. Word has length 40 [2021-08-27 06:39:54,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:54,831 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 338 transitions. [2021-08-27 06:39:54,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:54,832 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 338 transitions. [2021-08-27 06:39:54,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-27 06:39:54,832 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:54,832 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:54,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-27 06:39:54,832 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr38REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:54,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:54,833 INFO L82 PathProgramCache]: Analyzing trace with hash 533473399, now seen corresponding path program 1 times [2021-08-27 06:39:54,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:54,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502155821] [2021-08-27 06:39:54,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:54,834 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:54,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:54,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:54,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:54,926 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502155821] [2021-08-27 06:39:54,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502155821] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:54,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:54,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 06:39:54,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925750014] [2021-08-27 06:39:54,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:39:54,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:54,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:39:54,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:39:54,928 INFO L87 Difference]: Start difference. First operand 282 states and 338 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:55,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:55,242 INFO L93 Difference]: Finished difference Result 282 states and 338 transitions. [2021-08-27 06:39:55,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 06:39:55,242 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-08-27 06:39:55,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:55,243 INFO L225 Difference]: With dead ends: 282 [2021-08-27 06:39:55,243 INFO L226 Difference]: Without dead ends: 282 [2021-08-27 06:39:55,243 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 110.7ms TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-08-27 06:39:55,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-08-27 06:39:55,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2021-08-27 06:39:55,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 249 states have (on average 1.3413654618473896) internal successors, (334), 277 states have internal predecessors, (334), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:55,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 337 transitions. [2021-08-27 06:39:55,247 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 337 transitions. Word has length 40 [2021-08-27 06:39:55,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:55,247 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 337 transitions. [2021-08-27 06:39:55,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:55,248 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 337 transitions. [2021-08-27 06:39:55,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-27 06:39:55,248 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:55,248 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:55,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-27 06:39:55,248 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr39REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:55,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:55,249 INFO L82 PathProgramCache]: Analyzing trace with hash 533473400, now seen corresponding path program 1 times [2021-08-27 06:39:55,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:55,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278443476] [2021-08-27 06:39:55,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:55,249 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:55,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:55,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:55,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:55,348 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278443476] [2021-08-27 06:39:55,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278443476] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:55,349 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:55,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 06:39:55,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892912442] [2021-08-27 06:39:55,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:39:55,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:55,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:39:55,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:39:55,350 INFO L87 Difference]: Start difference. First operand 281 states and 337 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:55,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:55,750 INFO L93 Difference]: Finished difference Result 281 states and 337 transitions. [2021-08-27 06:39:55,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 06:39:55,750 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-08-27 06:39:55,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:55,751 INFO L225 Difference]: With dead ends: 281 [2021-08-27 06:39:55,751 INFO L226 Difference]: Without dead ends: 281 [2021-08-27 06:39:55,752 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 131.9ms TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-08-27 06:39:55,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-08-27 06:39:55,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2021-08-27 06:39:55,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 249 states have (on average 1.3373493975903614) internal successors, (333), 276 states have internal predecessors, (333), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:55,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 336 transitions. [2021-08-27 06:39:55,755 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 336 transitions. Word has length 40 [2021-08-27 06:39:55,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:55,755 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 336 transitions. [2021-08-27 06:39:55,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:55,756 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 336 transitions. [2021-08-27 06:39:55,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-27 06:39:55,756 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:55,756 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:55,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-27 06:39:55,756 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr51ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:55,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:55,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1330432764, now seen corresponding path program 1 times [2021-08-27 06:39:55,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:55,757 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492075474] [2021-08-27 06:39:55,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:55,757 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:55,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:55,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:55,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:55,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492075474] [2021-08-27 06:39:55,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492075474] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:55,988 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:55,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 06:39:55,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797078877] [2021-08-27 06:39:55,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 06:39:55,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:55,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 06:39:55,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-08-27 06:39:55,989 INFO L87 Difference]: Start difference. First operand 280 states and 336 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:56,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:56,893 INFO L93 Difference]: Finished difference Result 448 states and 489 transitions. [2021-08-27 06:39:56,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-27 06:39:56,894 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-08-27 06:39:56,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:56,895 INFO L225 Difference]: With dead ends: 448 [2021-08-27 06:39:56,895 INFO L226 Difference]: Without dead ends: 448 [2021-08-27 06:39:56,896 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 448.1ms TimeCoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2021-08-27 06:39:56,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-08-27 06:39:56,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 280. [2021-08-27 06:39:56,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 249 states have (on average 1.3333333333333333) internal successors, (332), 276 states have internal predecessors, (332), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:56,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 335 transitions. [2021-08-27 06:39:56,899 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 335 transitions. Word has length 40 [2021-08-27 06:39:56,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:56,900 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 335 transitions. [2021-08-27 06:39:56,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:56,900 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 335 transitions. [2021-08-27 06:39:56,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-08-27 06:39:56,900 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:56,900 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:56,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-27 06:39:56,901 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr44ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:56,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:56,901 INFO L82 PathProgramCache]: Analyzing trace with hash -930257781, now seen corresponding path program 1 times [2021-08-27 06:39:56,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:56,901 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500308790] [2021-08-27 06:39:56,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:56,902 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:56,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:56,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:56,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:56,974 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500308790] [2021-08-27 06:39:56,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500308790] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:56,974 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:56,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 06:39:56,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541171517] [2021-08-27 06:39:56,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 06:39:56,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:56,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 06:39:56,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:39:56,975 INFO L87 Difference]: Start difference. First operand 280 states and 335 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:57,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:57,258 INFO L93 Difference]: Finished difference Result 290 states and 346 transitions. [2021-08-27 06:39:57,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 06:39:57,259 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2021-08-27 06:39:57,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:57,260 INFO L225 Difference]: With dead ends: 290 [2021-08-27 06:39:57,260 INFO L226 Difference]: Without dead ends: 290 [2021-08-27 06:39:57,260 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 105.3ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-08-27 06:39:57,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-08-27 06:39:57,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 276. [2021-08-27 06:39:57,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 246 states have (on average 1.329268292682927) internal successors, (327), 272 states have internal predecessors, (327), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:57,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 330 transitions. [2021-08-27 06:39:57,264 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 330 transitions. Word has length 41 [2021-08-27 06:39:57,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:57,264 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 330 transitions. [2021-08-27 06:39:57,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:57,264 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 330 transitions. [2021-08-27 06:39:57,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-08-27 06:39:57,264 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:57,265 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:57,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-27 06:39:57,265 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr77ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:57,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:57,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1804534839, now seen corresponding path program 1 times [2021-08-27 06:39:57,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:57,266 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904350889] [2021-08-27 06:39:57,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:57,266 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:57,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:57,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 06:39:57,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:57,296 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904350889] [2021-08-27 06:39:57,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904350889] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:57,297 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:57,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 06:39:57,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911317788] [2021-08-27 06:39:57,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:39:57,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:57,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:39:57,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:39:57,298 INFO L87 Difference]: Start difference. First operand 276 states and 330 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:57,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:57,454 INFO L93 Difference]: Finished difference Result 289 states and 334 transitions. [2021-08-27 06:39:57,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:39:57,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2021-08-27 06:39:57,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:57,456 INFO L225 Difference]: With dead ends: 289 [2021-08-27 06:39:57,456 INFO L226 Difference]: Without dead ends: 289 [2021-08-27 06:39:57,456 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:39:57,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-08-27 06:39:57,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 277. [2021-08-27 06:39:57,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 247 states have (on average 1.3279352226720649) internal successors, (328), 273 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:57,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 331 transitions. [2021-08-27 06:39:57,459 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 331 transitions. Word has length 42 [2021-08-27 06:39:57,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:57,459 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 331 transitions. [2021-08-27 06:39:57,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:57,460 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 331 transitions. [2021-08-27 06:39:57,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-08-27 06:39:57,460 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:57,460 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:57,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-27 06:39:57,461 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr54ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:57,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:57,461 INFO L82 PathProgramCache]: Analyzing trace with hash 968459560, now seen corresponding path program 1 times [2021-08-27 06:39:57,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:57,461 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123097020] [2021-08-27 06:39:57,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:57,461 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:57,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:57,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:57,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:57,683 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123097020] [2021-08-27 06:39:57,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123097020] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:39:57,684 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:39:57,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 06:39:57,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172343164] [2021-08-27 06:39:57,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 06:39:57,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:57,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 06:39:57,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-08-27 06:39:57,685 INFO L87 Difference]: Start difference. First operand 277 states and 331 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:58,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:58,536 INFO L93 Difference]: Finished difference Result 428 states and 475 transitions. [2021-08-27 06:39:58,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-27 06:39:58,536 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2021-08-27 06:39:58,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:58,537 INFO L225 Difference]: With dead ends: 428 [2021-08-27 06:39:58,537 INFO L226 Difference]: Without dead ends: 428 [2021-08-27 06:39:58,538 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 407.1ms TimeCoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2021-08-27 06:39:58,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-08-27 06:39:58,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 277. [2021-08-27 06:39:58,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 247 states have (on average 1.3238866396761133) internal successors, (327), 273 states have internal predecessors, (327), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:58,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 330 transitions. [2021-08-27 06:39:58,541 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 330 transitions. Word has length 43 [2021-08-27 06:39:58,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:58,541 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 330 transitions. [2021-08-27 06:39:58,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:58,542 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 330 transitions. [2021-08-27 06:39:58,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-27 06:39:58,542 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:58,542 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:58,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-27 06:39:58,542 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr62REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:39:58,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:39:58,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1207787386, now seen corresponding path program 1 times [2021-08-27 06:39:58,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:39:58,543 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665166506] [2021-08-27 06:39:58,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:58,543 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:39:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:58,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:39:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:58,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:39:58,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:39:58,659 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665166506] [2021-08-27 06:39:58,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665166506] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:39:58,659 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073265705] [2021-08-27 06:39:58,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:39:58,659 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:39:58,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:39:58,660 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:39:58,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-27 06:39:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:39:58,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-27 06:39:58,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:39:58,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:39:58,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-27 06:39:58,888 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-08-27 06:39:58,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:39:58,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:39:58,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-27 06:39:59,238 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-08-27 06:39:59,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2021-08-27 06:39:59,244 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-08-27 06:39:59,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 13 [2021-08-27 06:39:59,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 06:39:59,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073265705] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:39:59,273 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:39:59,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 11 [2021-08-27 06:39:59,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286939202] [2021-08-27 06:39:59,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 06:39:59,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:39:59,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 06:39:59,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:39:59,274 INFO L87 Difference]: Start difference. First operand 277 states and 330 transitions. Second operand has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:59,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:39:59,946 INFO L93 Difference]: Finished difference Result 409 states and 450 transitions. [2021-08-27 06:39:59,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 06:39:59,947 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2021-08-27 06:39:59,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:39:59,948 INFO L225 Difference]: With dead ends: 409 [2021-08-27 06:39:59,948 INFO L226 Difference]: Without dead ends: 409 [2021-08-27 06:39:59,948 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 283.4ms TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2021-08-27 06:39:59,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2021-08-27 06:39:59,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 301. [2021-08-27 06:39:59,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 271 states have (on average 1.3357933579335792) internal successors, (362), 297 states have internal predecessors, (362), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:59,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 365 transitions. [2021-08-27 06:39:59,965 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 365 transitions. Word has length 45 [2021-08-27 06:39:59,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:39:59,965 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 365 transitions. [2021-08-27 06:39:59,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:39:59,965 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 365 transitions. [2021-08-27 06:39:59,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-27 06:39:59,965 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:39:59,966 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:39:59,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-27 06:40:00,183 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,SelfDestructingSolverStorable32 [2021-08-27 06:40:00,183 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr64ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:40:00,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:40:00,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1891470081, now seen corresponding path program 1 times [2021-08-27 06:40:00,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:40:00,183 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914676976] [2021-08-27 06:40:00,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:40:00,183 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:40:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:00,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:40:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:00,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 06:40:00,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:40:00,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914676976] [2021-08-27 06:40:00,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914676976] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:40:00,239 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:40:00,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:40:00,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469246052] [2021-08-27 06:40:00,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:40:00,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:40:00,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:40:00,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:40:00,240 INFO L87 Difference]: Start difference. First operand 301 states and 365 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:40:00,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:40:00,404 INFO L93 Difference]: Finished difference Result 303 states and 365 transitions. [2021-08-27 06:40:00,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:40:00,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2021-08-27 06:40:00,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:40:00,406 INFO L225 Difference]: With dead ends: 303 [2021-08-27 06:40:00,406 INFO L226 Difference]: Without dead ends: 303 [2021-08-27 06:40:00,406 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:40:00,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-08-27 06:40:00,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2021-08-27 06:40:00,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 270 states have (on average 1.325925925925926) internal successors, (358), 295 states have internal predecessors, (358), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:40:00,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 361 transitions. [2021-08-27 06:40:00,409 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 361 transitions. Word has length 45 [2021-08-27 06:40:00,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:40:00,409 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 361 transitions. [2021-08-27 06:40:00,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:40:00,409 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 361 transitions. [2021-08-27 06:40:00,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-27 06:40:00,409 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:40:00,409 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:40:00,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-08-27 06:40:00,410 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr79ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:40:00,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:40:00,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1213297892, now seen corresponding path program 1 times [2021-08-27 06:40:00,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:40:00,410 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915838330] [2021-08-27 06:40:00,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:40:00,410 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:40:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:00,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:40:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:00,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 06:40:00,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:40:00,473 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915838330] [2021-08-27 06:40:00,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915838330] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:40:00,473 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636050250] [2021-08-27 06:40:00,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:40:00,473 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:40:00,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:40:00,474 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 06:40:00,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-27 06:40:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:00,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 06:40:00,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:40:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 06:40:00,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636050250] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:40:00,966 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:40:00,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-08-27 06:40:00,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214066852] [2021-08-27 06:40:00,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:40:00,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:40:00,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:40:00,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:40:00,968 INFO L87 Difference]: Start difference. First operand 299 states and 361 transitions. Second operand has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:40:01,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:40:01,215 INFO L93 Difference]: Finished difference Result 330 states and 392 transitions. [2021-08-27 06:40:01,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:40:01,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2021-08-27 06:40:01,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:40:01,217 INFO L225 Difference]: With dead ends: 330 [2021-08-27 06:40:01,217 INFO L226 Difference]: Without dead ends: 306 [2021-08-27 06:40:01,217 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 32.8ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:40:01,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-08-27 06:40:01,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2021-08-27 06:40:01,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 277 states have (on average 1.3176895306859207) internal successors, (365), 302 states have internal predecessors, (365), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:40:01,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 368 transitions. [2021-08-27 06:40:01,226 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 368 transitions. Word has length 46 [2021-08-27 06:40:01,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:40:01,226 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 368 transitions. [2021-08-27 06:40:01,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:40:01,227 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 368 transitions. [2021-08-27 06:40:01,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-27 06:40:01,227 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:40:01,227 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:40:01,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-27 06:40:01,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:40:01,444 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting mainErr65REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:40:01,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:40:01,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1493965183, now seen corresponding path program 1 times [2021-08-27 06:40:01,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:40:01,445 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473902244] [2021-08-27 06:40:01,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:40:01,445 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:40:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:01,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:40:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:01,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 06:40:01,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:40:01,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473902244] [2021-08-27 06:40:01,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473902244] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:40:01,571 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:40:01,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 06:40:01,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225937590] [2021-08-27 06:40:01,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 06:40:01,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:40:01,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 06:40:01,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:40:01,572 INFO L87 Difference]: Start difference. First operand 306 states and 368 transitions. Second operand has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:40:01,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:40:01,961 INFO L93 Difference]: Finished difference Result 349 states and 402 transitions. [2021-08-27 06:40:01,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 06:40:01,962 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2021-08-27 06:40:01,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:40:01,973 INFO L225 Difference]: With dead ends: 349 [2021-08-27 06:40:01,973 INFO L226 Difference]: Without dead ends: 349 [2021-08-27 06:40:01,974 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 123.0ms TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-08-27 06:40:01,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-08-27 06:40:01,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 313. [2021-08-27 06:40:01,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 284 states have (on average 1.3169014084507042) internal successors, (374), 309 states have internal predecessors, (374), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:40:01,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 377 transitions. [2021-08-27 06:40:01,978 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 377 transitions. Word has length 46 [2021-08-27 06:40:01,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:40:01,978 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 377 transitions. [2021-08-27 06:40:01,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:40:01,978 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 377 transitions. [2021-08-27 06:40:01,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-27 06:40:01,979 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:40:01,979 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:40:01,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-08-27 06:40:01,979 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting mainErr66REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:40:01,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:40:01,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1493965182, now seen corresponding path program 1 times [2021-08-27 06:40:01,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:40:01,980 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332958987] [2021-08-27 06:40:01,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:40:01,980 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:40:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:02,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:40:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:02,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 06:40:02,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:40:02,150 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332958987] [2021-08-27 06:40:02,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332958987] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:40:02,150 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:40:02,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-27 06:40:02,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971544951] [2021-08-27 06:40:02,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 06:40:02,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:40:02,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 06:40:02,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-08-27 06:40:02,152 INFO L87 Difference]: Start difference. First operand 313 states and 377 transitions. Second operand has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:40:02,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:40:02,740 INFO L93 Difference]: Finished difference Result 349 states and 402 transitions. [2021-08-27 06:40:02,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 06:40:02,741 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2021-08-27 06:40:02,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:40:02,742 INFO L225 Difference]: With dead ends: 349 [2021-08-27 06:40:02,742 INFO L226 Difference]: Without dead ends: 349 [2021-08-27 06:40:02,742 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 201.1ms TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2021-08-27 06:40:02,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-08-27 06:40:02,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 319. [2021-08-27 06:40:02,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 290 states have (on average 1.313793103448276) internal successors, (381), 315 states have internal predecessors, (381), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:40:02,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 384 transitions. [2021-08-27 06:40:02,746 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 384 transitions. Word has length 46 [2021-08-27 06:40:02,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:40:02,746 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 384 transitions. [2021-08-27 06:40:02,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 06:40:02,746 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 384 transitions. [2021-08-27 06:40:02,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-08-27 06:40:02,747 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:40:02,747 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:40:02,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-08-27 06:40:02,747 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting mainErr57REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2ASSERT_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 75 more)] === [2021-08-27 06:40:02,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:40:02,747 INFO L82 PathProgramCache]: Analyzing trace with hash 292246064, now seen corresponding path program 1 times [2021-08-27 06:40:02,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:40:02,748 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681709818] [2021-08-27 06:40:02,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:40:02,748 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:40:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 06:40:02,761 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 06:40:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 06:40:02,795 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 06:40:02,796 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 06:40:02,797 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr57REQUIRES_VIOLATION [2021-08-27 06:40:02,798 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-08-27 06:40:02,798 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-08-27 06:40:02,798 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:40:02,798 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-08-27 06:40:02,798 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-08-27 06:40:02,798 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-08-27 06:40:02,798 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-08-27 06:40:02,799 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-08-27 06:40:02,799 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-08-27 06:40:02,799 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-08-27 06:40:02,799 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-08-27 06:40:02,799 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-08-27 06:40:02,799 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-08-27 06:40:02,799 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-08-27 06:40:02,799 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-08-27 06:40:02,799 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-08-27 06:40:02,800 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16REQUIRES_VIOLATION [2021-08-27 06:40:02,800 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-08-27 06:40:02,800 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-08-27 06:40:02,800 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:40:02,800 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-08-27 06:40:02,800 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION [2021-08-27 06:40:02,800 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-08-27 06:40:02,800 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-08-27 06:40:02,801 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-08-27 06:40:02,801 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-08-27 06:40:02,801 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:40:02,801 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:40:02,802 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-08-27 06:40:02,802 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-08-27 06:40:02,802 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION [2021-08-27 06:40:02,802 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION [2021-08-27 06:40:02,802 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32REQUIRES_VIOLATION [2021-08-27 06:40:02,802 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION [2021-08-27 06:40:02,802 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION [2021-08-27 06:40:02,802 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35REQUIRES_VIOLATION [2021-08-27 06:40:02,802 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION [2021-08-27 06:40:02,802 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-08-27 06:40:02,803 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-08-27 06:40:02,803 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION [2021-08-27 06:40:02,803 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40REQUIRES_VIOLATION [2021-08-27 06:40:02,803 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41REQUIRES_VIOLATION [2021-08-27 06:40:02,803 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42REQUIRES_VIOLATION [2021-08-27 06:40:02,803 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43REQUIRES_VIOLATION [2021-08-27 06:40:02,803 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:40:02,803 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:40:02,803 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr46REQUIRES_VIOLATION [2021-08-27 06:40:02,804 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr47REQUIRES_VIOLATION [2021-08-27 06:40:02,804 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr48ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:40:02,804 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr49REQUIRES_VIOLATION [2021-08-27 06:40:02,804 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr50REQUIRES_VIOLATION [2021-08-27 06:40:02,804 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr51ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:40:02,804 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr52REQUIRES_VIOLATION [2021-08-27 06:40:02,804 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr53REQUIRES_VIOLATION [2021-08-27 06:40:02,804 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr54ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:40:02,805 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr55REQUIRES_VIOLATION [2021-08-27 06:40:02,805 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr56REQUIRES_VIOLATION [2021-08-27 06:40:02,805 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr58REQUIRES_VIOLATION [2021-08-27 06:40:02,805 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr59ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:40:02,805 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr60REQUIRES_VIOLATION [2021-08-27 06:40:02,805 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr61REQUIRES_VIOLATION [2021-08-27 06:40:02,805 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr62REQUIRES_VIOLATION [2021-08-27 06:40:02,805 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr63REQUIRES_VIOLATION [2021-08-27 06:40:02,805 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr64ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:40:02,805 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr65REQUIRES_VIOLATION [2021-08-27 06:40:02,806 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr66REQUIRES_VIOLATION [2021-08-27 06:40:02,806 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr67ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:40:02,806 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr68REQUIRES_VIOLATION [2021-08-27 06:40:02,806 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr69REQUIRES_VIOLATION [2021-08-27 06:40:02,806 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr70ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:40:02,806 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr71ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:40:02,806 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr72ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:40:02,806 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr73ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:40:02,806 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr74REQUIRES_VIOLATION [2021-08-27 06:40:02,807 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr75REQUIRES_VIOLATION [2021-08-27 06:40:02,807 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr76ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:40:02,807 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr77ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:40:02,807 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr78ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:40:02,807 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr79ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 06:40:02,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-08-27 06:40:02,814 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 06:40:02,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 06:40:02 BoogieIcfgContainer [2021-08-27 06:40:02,852 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 06:40:02,853 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 06:40:02,853 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 06:40:02,853 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 06:40:02,853 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:39:44" (3/4) ... [2021-08-27 06:40:02,854 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-27 06:40:02,905 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 06:40:02,905 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 06:40:02,906 INFO L168 Benchmark]: Toolchain (without parser) took 19843.78 ms. Allocated memory was 54.5 MB in the beginning and 375.4 MB in the end (delta: 320.9 MB). Free memory was 30.4 MB in the beginning and 248.4 MB in the end (delta: -218.0 MB). Peak memory consumption was 102.3 MB. Max. memory is 16.1 GB. [2021-08-27 06:40:02,906 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 54.5 MB. Free memory was 36.7 MB in the beginning and 36.7 MB in the end (delta: 33.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:40:02,906 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.07 ms. Allocated memory was 54.5 MB in the beginning and 75.5 MB in the end (delta: 21.0 MB). Free memory was 30.2 MB in the beginning and 50.0 MB in the end (delta: -19.8 MB). Peak memory consumption was 8.3 MB. Max. memory is 16.1 GB. [2021-08-27 06:40:02,907 INFO L168 Benchmark]: Boogie Preprocessor took 39.13 ms. Allocated memory is still 75.5 MB. Free memory was 50.0 MB in the beginning and 46.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 06:40:02,907 INFO L168 Benchmark]: RCFGBuilder took 555.70 ms. Allocated memory is still 75.5 MB. Free memory was 46.7 MB in the beginning and 35.8 MB in the end (delta: 10.9 MB). Peak memory consumption was 21.4 MB. Max. memory is 16.1 GB. [2021-08-27 06:40:02,907 INFO L168 Benchmark]: TraceAbstraction took 18804.75 ms. Allocated memory was 75.5 MB in the beginning and 375.4 MB in the end (delta: 299.9 MB). Free memory was 35.4 MB in the beginning and 251.5 MB in the end (delta: -216.2 MB). Peak memory consumption was 83.1 MB. Max. memory is 16.1 GB. [2021-08-27 06:40:02,907 INFO L168 Benchmark]: Witness Printer took 52.22 ms. Allocated memory is still 375.4 MB. Free memory was 251.5 MB in the beginning and 248.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 06:40:02,909 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.16 ms. Allocated memory is still 54.5 MB. Free memory was 36.7 MB in the beginning and 36.7 MB in the end (delta: 33.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 388.07 ms. Allocated memory was 54.5 MB in the beginning and 75.5 MB in the end (delta: 21.0 MB). Free memory was 30.2 MB in the beginning and 50.0 MB in the end (delta: -19.8 MB). Peak memory consumption was 8.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 39.13 ms. Allocated memory is still 75.5 MB. Free memory was 50.0 MB in the beginning and 46.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 555.70 ms. Allocated memory is still 75.5 MB. Free memory was 46.7 MB in the beginning and 35.8 MB in the end (delta: 10.9 MB). Peak memory consumption was 21.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 18804.75 ms. Allocated memory was 75.5 MB in the beginning and 375.4 MB in the end (delta: 299.9 MB). Free memory was 35.4 MB in the beginning and 251.5 MB in the end (delta: -216.2 MB). Peak memory consumption was 83.1 MB. Max. memory is 16.1 GB. * Witness Printer took 52.22 ms. Allocated memory is still 375.4 MB. Free memory was 251.5 MB in the beginning and 248.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1040]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1002] SLL* list = malloc(sizeof(SLL)); [L1003] list->next = ((void*)0) VAL [list={-1:0}] [L1004] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}] [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1004] list->inner = malloc(sizeof(SLL)) VAL [list={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1004] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1004] list->inner->next = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}] [L1004] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1004] list->inner->inner = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}] [L1004] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1004] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}, list->inner={-2:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1] [L1004] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1006] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1019] end = ((void*)0) [L1020] end = list VAL [end={-1:0}, list={-1:0}] [L1023] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1025] COND TRUE ((void*)0) != end [L1027] int len = 0; VAL [end={-1:0}, len=0, list={-1:0}] [L1028] EXPR end->inner VAL [end={-1:0}, end->inner={-2:0}, len=0, list={-1:0}] [L1028] SLL* inner = end->inner; [L1029] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}] [L1031] COND TRUE len == 0 [L1032] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1035] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1036] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}] [L1036] COND FALSE !(!(((void*)0) == inner->inner)) [L1037] EXPR inner->next VAL [end={-1:0}, inner={-2:0}, inner->next={0:0}, len=1, list={-1:0}] [L1037] COND FALSE !(!(((void*)0) == inner->next)) [L1038] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}] [L1038] inner = inner->inner [L1039] COND TRUE len == 1 VAL [end={-1:0}, inner={0:0}, len=1, list={-1:0}] [L1040] inner->inner - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1012]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1050]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1050]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1054]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 203 locations, 80 error locations. Started 1 CEGAR loops. OverallTime: 18732.0ms, OverallIterations: 38, TraceHistogramMax: 2, EmptinessCheckTime: 22.3ms, AutomataDifference: 12781.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 5010 SDtfs, 6834 SDslu, 14758 SDs, 0 SdLazy, 16128 SolverSat, 483 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7839.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 593 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 373 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 3591.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=319occurred in iteration=37, InterpolantAutomatonStates: 351, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 162.1ms AutomataMinimizationTime, 37 MinimizatonAttempts, 1401 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 64.0ms SsaConstructionTime, 282.6ms SatisfiabilityAnalysisTime, 3985.1ms InterpolantComputationTime, 1307 NumberOfCodeBlocks, 1307 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1220 ConstructedInterpolants, 3 QuantifiedInterpolants, 11356 SizeOfPredicates, 13 NumberOfNonLiveVariables, 583 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 40 InterpolantComputations, 34 PerfectInterpolantSequences, 12/19 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-27 06:40:02,992 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...