./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-queue-1.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-queue-1.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 e7731899c5e817fc6eaadbde2ec1f0ed993fe63c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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-queue-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e7731899c5e817fc6eaadbde2ec1f0ed993fe63c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 06:40:44,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 06:40:44,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 06:40:44,465 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 06:40:44,466 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 06:40:44,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 06:40:44,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 06:40:44,480 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 06:40:44,482 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 06:40:44,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 06:40:44,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 06:40:44,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 06:40:44,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 06:40:44,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 06:40:44,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 06:40:44,495 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 06:40:44,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 06:40:44,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 06:40:44,498 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 06:40:44,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 06:40:44,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 06:40:44,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 06:40:44,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 06:40:44,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 06:40:44,512 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 06:40:44,512 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 06:40:44,513 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 06:40:44,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 06:40:44,514 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 06:40:44,515 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 06:40:44,515 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 06:40:44,516 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 06:40:44,517 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 06:40:44,517 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 06:40:44,518 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 06:40:44,518 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 06:40:44,519 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 06:40:44,519 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 06:40:44,519 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 06:40:44,520 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 06:40:44,521 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 06:40:44,523 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:40:44,536 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 06:40:44,537 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 06:40:44,538 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 06:40:44,538 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 06:40:44,539 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 06:40:44,539 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 06:40:44,540 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 06:40:44,540 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 06:40:44,540 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 06:40:44,540 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 06:40:44,541 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 06:40:44,541 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 06:40:44,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 06:40:44,541 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 06:40:44,541 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 06:40:44,541 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 06:40:44,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 06:40:44,542 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 06:40:44,542 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 06:40:44,542 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 06:40:44,542 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 06:40:44,542 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 06:40:44,542 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 06:40:44,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:40:44,543 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 06:40:44,543 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 06:40:44,543 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 06:40:44,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 06:40:44,543 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 06:40:44,544 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 -> e7731899c5e817fc6eaadbde2ec1f0ed993fe63c [2021-08-27 06:40:44,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 06:40:44,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 06:40:44,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 06:40:44,823 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 06:40:44,824 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 06:40:44,824 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-queue-1.i [2021-08-27 06:40:44,879 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37a27f409/bf1fe041c21f4153b025ebdf8bb3eef5/FLAG611a4bde5 [2021-08-27 06:40:45,272 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 06:40:45,275 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i [2021-08-27 06:40:45,286 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37a27f409/bf1fe041c21f4153b025ebdf8bb3eef5/FLAG611a4bde5 [2021-08-27 06:40:45,641 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37a27f409/bf1fe041c21f4153b025ebdf8bb3eef5 [2021-08-27 06:40:45,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 06:40:45,646 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 06:40:45,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 06:40:45,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 06:40:45,652 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 06:40:45,653 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:40:45" (1/1) ... [2021-08-27 06:40:45,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d605d57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:40:45, skipping insertion in model container [2021-08-27 06:40:45,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:40:45" (1/1) ... [2021-08-27 06:40:45,661 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 06:40:45,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 06:40:45,920 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-queue-1.i[22387,22400] [2021-08-27 06:40:45,923 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-queue-1.i[22458,22471] [2021-08-27 06:40:45,923 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-queue-1.i[22532,22545] [2021-08-27 06:40:45,924 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-queue-1.i[22624,22637] [2021-08-27 06:40:45,924 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-queue-1.i[22701,22714] [2021-08-27 06:40:45,925 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-queue-1.i[22796,22809] [2021-08-27 06:40:45,925 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-queue-1.i[22873,22886] [2021-08-27 06:40:45,926 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-queue-1.i[22956,22969] [2021-08-27 06:40:45,926 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-queue-1.i[23051,23064] [2021-08-27 06:40:45,927 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-queue-1.i[23128,23141] [2021-08-27 06:40:45,927 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-queue-1.i[23211,23224] [2021-08-27 06:40:45,928 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-queue-1.i[23300,23313] [2021-08-27 06:40:45,932 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-queue-1.i[23386,23399] [2021-08-27 06:40:45,936 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-queue-1.i[23532,23545] [2021-08-27 06:40:45,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:40:45,947 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 06:40:45,983 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-queue-1.i[22387,22400] [2021-08-27 06:40:45,990 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-queue-1.i[22458,22471] [2021-08-27 06:40:45,991 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-queue-1.i[22532,22545] [2021-08-27 06:40:45,991 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-queue-1.i[22624,22637] [2021-08-27 06:40:45,992 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-queue-1.i[22701,22714] [2021-08-27 06:40:45,992 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-queue-1.i[22796,22809] [2021-08-27 06:40:45,993 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-queue-1.i[22873,22886] [2021-08-27 06:40:45,993 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-queue-1.i[22956,22969] [2021-08-27 06:40:45,993 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-queue-1.i[23051,23064] [2021-08-27 06:40:45,994 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-queue-1.i[23128,23141] [2021-08-27 06:40:45,994 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-queue-1.i[23211,23224] [2021-08-27 06:40:45,995 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-queue-1.i[23300,23313] [2021-08-27 06:40:45,995 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-queue-1.i[23386,23399] [2021-08-27 06:40:45,996 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-queue-1.i[23532,23545] [2021-08-27 06:40:45,997 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:40:46,018 INFO L208 MainTranslator]: Completed translation [2021-08-27 06:40:46,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:40:46 WrapperNode [2021-08-27 06:40:46,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 06:40:46,020 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 06:40:46,020 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 06:40:46,020 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 06:40:46,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:40:46" (1/1) ... [2021-08-27 06:40:46,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:40:46" (1/1) ... [2021-08-27 06:40:46,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:40:46" (1/1) ... [2021-08-27 06:40:46,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:40:46" (1/1) ... [2021-08-27 06:40:46,056 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:40:46" (1/1) ... [2021-08-27 06:40:46,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:40:46" (1/1) ... [2021-08-27 06:40:46,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:40:46" (1/1) ... [2021-08-27 06:40:46,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 06:40:46,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 06:40:46,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 06:40:46,074 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 06:40:46,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:40:46" (1/1) ... [2021-08-27 06:40:46,090 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:40:46,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:40:46,115 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:40:46,119 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:40:46,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 06:40:46,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 06:40:46,146 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 06:40:46,146 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 06:40:46,146 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 06:40:46,147 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 06:40:46,147 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 06:40:46,147 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 06:40:46,147 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 06:40:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 06:40:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 06:40:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 06:40:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 06:40:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 06:40:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 06:40:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 06:40:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 06:40:46,149 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 06:40:46,149 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 06:40:46,149 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 06:40:46,149 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 06:40:46,149 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 06:40:46,149 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 06:40:46,149 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 06:40:46,149 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 06:40:46,149 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 06:40:46,149 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 06:40:46,149 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 06:40:46,149 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 06:40:46,149 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 06:40:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 06:40:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 06:40:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 06:40:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 06:40:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 06:40:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 06:40:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 06:40:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 06:40:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 06:40:46,151 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 06:40:46,151 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 06:40:46,151 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 06:40:46,151 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 06:40:46,151 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 06:40:46,151 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 06:40:46,151 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 06:40:46,151 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 06:40:46,151 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 06:40:46,152 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 06:40:46,152 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 06:40:46,152 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 06:40:46,152 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 06:40:46,152 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 06:40:46,152 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 06:40:46,152 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 06:40:46,152 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 06:40:46,152 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 06:40:46,152 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 06:40:46,152 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 06:40:46,152 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 06:40:46,153 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 06:40:46,153 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 06:40:46,153 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 06:40:46,153 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 06:40:46,153 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 06:40:46,153 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 06:40:46,165 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 06:40:46,165 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 06:40:46,165 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 06:40:46,165 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 06:40:46,165 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 06:40:46,165 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 06:40:46,165 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 06:40:46,166 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 06:40:46,166 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 06:40:46,166 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 06:40:46,166 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 06:40:46,166 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 06:40:46,166 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 06:40:46,167 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 06:40:46,167 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 06:40:46,167 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 06:40:46,167 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 06:40:46,167 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 06:40:46,167 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 06:40:46,167 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 06:40:46,168 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 06:40:46,168 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 06:40:46,168 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 06:40:46,168 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 06:40:46,168 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 06:40:46,168 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 06:40:46,168 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 06:40:46,169 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 06:40:46,169 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 06:40:46,169 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 06:40:46,169 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 06:40:46,169 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 06:40:46,169 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 06:40:46,170 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 06:40:46,170 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 06:40:46,170 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 06:40:46,172 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 06:40:46,172 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 06:40:46,173 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 06:40:46,173 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 06:40:46,173 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 06:40:46,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 06:40:46,173 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 06:40:46,173 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 06:40:46,174 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 06:40:46,178 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 06:40:46,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 06:40:46,178 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 06:40:46,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 06:40:46,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 06:40:46,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 06:40:46,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 06:40:46,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 06:40:46,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 06:40:46,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 06:40:46,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 06:40:46,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 06:40:46,706 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 06:40:46,706 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2021-08-27 06:40:46,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:40:46 BoogieIcfgContainer [2021-08-27 06:40:46,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 06:40:46,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 06:40:46,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 06:40:46,712 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 06:40:46,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 06:40:45" (1/3) ... [2021-08-27 06:40:46,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4386c15b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:40:46, skipping insertion in model container [2021-08-27 06:40:46,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:40:46" (2/3) ... [2021-08-27 06:40:46,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4386c15b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:40:46, skipping insertion in model container [2021-08-27 06:40:46,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:40:46" (3/3) ... [2021-08-27 06:40:46,715 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-queue-1.i [2021-08-27 06:40:46,719 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 06:40:46,719 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2021-08-27 06:40:46,754 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 06:40:46,760 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:40:46,760 INFO L340 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2021-08-27 06:40:46,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 176 states, 101 states have (on average 2.2475247524752477) internal successors, (227), 171 states have internal predecessors, (227), 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:40:46,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 06:40:46,786 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:40:46,786 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:40:46,786 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:40:46,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:40:46,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1926376585, now seen corresponding path program 1 times [2021-08-27 06:40:46,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:40:46,797 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990321115] [2021-08-27 06:40:46,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:40:46,798 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:40:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:46,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:40:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:46,997 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:40:46,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:40:46,997 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990321115] [2021-08-27 06:40:46,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990321115] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:40:46,998 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:40:46,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 06:40:46,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587206295] [2021-08-27 06:40:47,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:40:47,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:40:47,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:40:47,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:40:47,024 INFO L87 Difference]: Start difference. First operand has 176 states, 101 states have (on average 2.2475247524752477) internal successors, (227), 171 states have internal predecessors, (227), 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:40:47,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:40:47,314 INFO L93 Difference]: Finished difference Result 173 states and 184 transitions. [2021-08-27 06:40:47,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:40:47,315 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:40:47,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:40:47,324 INFO L225 Difference]: With dead ends: 173 [2021-08-27 06:40:47,325 INFO L226 Difference]: Without dead ends: 169 [2021-08-27 06:40:47,325 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.3ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:40:47,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-08-27 06:40:47,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2021-08-27 06:40:47,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 102 states have (on average 1.7058823529411764) internal successors, (174), 161 states have internal predecessors, (174), 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:47,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 177 transitions. [2021-08-27 06:40:47,353 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 177 transitions. Word has length 7 [2021-08-27 06:40:47,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:40:47,354 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 177 transitions. [2021-08-27 06:40:47,354 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:40:47,354 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 177 transitions. [2021-08-27 06:40:47,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 06:40:47,354 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:40:47,355 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:40:47,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 06:40:47,355 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:40:47,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:40:47,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1926376584, now seen corresponding path program 1 times [2021-08-27 06:40:47,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:40:47,356 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167437147] [2021-08-27 06:40:47,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:40:47,356 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:40:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:47,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:40:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:47,409 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:40:47,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:40:47,410 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167437147] [2021-08-27 06:40:47,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167437147] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:40:47,410 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:40:47,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 06:40:47,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937868475] [2021-08-27 06:40:47,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:40:47,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:40:47,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:40:47,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:40:47,412 INFO L87 Difference]: Start difference. First operand 165 states and 177 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:40:47,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:40:47,632 INFO L93 Difference]: Finished difference Result 159 states and 169 transitions. [2021-08-27 06:40:47,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:40:47,632 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:40:47,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:40:47,635 INFO L225 Difference]: With dead ends: 159 [2021-08-27 06:40:47,636 INFO L226 Difference]: Without dead ends: 159 [2021-08-27 06:40:47,636 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.5ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:40:47,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-08-27 06:40:47,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2021-08-27 06:40:47,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 102 states have (on average 1.5980392156862746) internal successors, (163), 151 states have internal predecessors, (163), 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:47,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 166 transitions. [2021-08-27 06:40:47,656 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 166 transitions. Word has length 7 [2021-08-27 06:40:47,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:40:47,662 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 166 transitions. [2021-08-27 06:40:47,662 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:40:47,662 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 166 transitions. [2021-08-27 06:40:47,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 06:40:47,663 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:40:47,668 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:40:47,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 06:40:47,669 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr4REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:40:47,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:40:47,669 INFO L82 PathProgramCache]: Analyzing trace with hash 2140712926, now seen corresponding path program 1 times [2021-08-27 06:40:47,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:40:47,670 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669245911] [2021-08-27 06:40:47,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:40:47,670 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:40:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:47,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:40:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:47,749 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:40:47,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:40:47,751 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669245911] [2021-08-27 06:40:47,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669245911] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:40:47,751 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:40:47,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:40:47,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489369213] [2021-08-27 06:40:47,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:40:47,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:40:47,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:40:47,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:40:47,753 INFO L87 Difference]: Start difference. First operand 155 states and 166 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:47,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:40:47,953 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2021-08-27 06:40:47,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:40:47,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 12 [2021-08-27 06:40:47,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:40:47,955 INFO L225 Difference]: With dead ends: 165 [2021-08-27 06:40:47,955 INFO L226 Difference]: Without dead ends: 165 [2021-08-27 06:40:47,956 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.7ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:40:47,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-08-27 06:40:47,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2021-08-27 06:40:47,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 109 states have (on average 1.5504587155963303) internal successors, (169), 153 states have internal predecessors, (169), 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:47,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 172 transitions. [2021-08-27 06:40:47,965 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 172 transitions. Word has length 12 [2021-08-27 06:40:47,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:40:47,965 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 172 transitions. [2021-08-27 06:40:47,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:47,965 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 172 transitions. [2021-08-27 06:40:47,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 06:40:47,966 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:40:47,966 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:40:47,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 06:40:47,966 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr5REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:40:47,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:40:47,967 INFO L82 PathProgramCache]: Analyzing trace with hash 2140712927, now seen corresponding path program 1 times [2021-08-27 06:40:47,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:40:47,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631181414] [2021-08-27 06:40:47,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:40:47,967 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:40:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:48,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:40:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:48,103 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:40:48,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:40:48,103 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631181414] [2021-08-27 06:40:48,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631181414] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:40:48,104 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:40:48,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 06:40:48,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087912005] [2021-08-27 06:40:48,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:40:48,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:40:48,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:40:48,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:40:48,105 INFO L87 Difference]: Start difference. First operand 157 states and 172 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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:48,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:40:48,454 INFO L93 Difference]: Finished difference Result 248 states and 264 transitions. [2021-08-27 06:40:48,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:40:48,454 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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 12 [2021-08-27 06:40:48,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:40:48,455 INFO L225 Difference]: With dead ends: 248 [2021-08-27 06:40:48,455 INFO L226 Difference]: Without dead ends: 248 [2021-08-27 06:40:48,456 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 51.4ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-27 06:40:48,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-08-27 06:40:48,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 162. [2021-08-27 06:40:48,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 114 states have (on average 1.5263157894736843) internal successors, (174), 158 states have internal predecessors, (174), 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:48,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 177 transitions. [2021-08-27 06:40:48,459 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 177 transitions. Word has length 12 [2021-08-27 06:40:48,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:40:48,459 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 177 transitions. [2021-08-27 06:40:48,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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:48,459 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 177 transitions. [2021-08-27 06:40:48,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 06:40:48,460 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:40:48,460 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:40:48,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 06:40:48,460 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr18ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:40:48,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:40:48,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1937591901, now seen corresponding path program 1 times [2021-08-27 06:40:48,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:40:48,461 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795264320] [2021-08-27 06:40:48,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:40:48,461 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:40:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:48,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:40:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:48,515 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:40:48,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:40:48,516 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795264320] [2021-08-27 06:40:48,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795264320] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:40:48,516 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:40:48,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:40:48,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282420739] [2021-08-27 06:40:48,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:40:48,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:40:48,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:40:48,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:40:48,517 INFO L87 Difference]: Start difference. First operand 162 states and 177 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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:48,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:40:48,677 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2021-08-27 06:40:48,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:40:48,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 13 [2021-08-27 06:40:48,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:40:48,678 INFO L225 Difference]: With dead ends: 152 [2021-08-27 06:40:48,678 INFO L226 Difference]: Without dead ends: 152 [2021-08-27 06:40:48,678 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:40:48,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-08-27 06:40:48,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2021-08-27 06:40:48,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 109 states have (on average 1.4954128440366972) internal successors, (163), 148 states have internal predecessors, (163), 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:48,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2021-08-27 06:40:48,680 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 13 [2021-08-27 06:40:48,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:40:48,680 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2021-08-27 06:40:48,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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:48,681 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2021-08-27 06:40:48,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 06:40:48,681 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:40:48,681 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:40:48,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 06:40:48,681 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr8REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:40:48,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:40:48,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1579051744, now seen corresponding path program 1 times [2021-08-27 06:40:48,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:40:48,681 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904020692] [2021-08-27 06:40:48,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:40:48,682 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:40:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:48,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:40:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:48,763 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:40:48,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:40:48,763 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904020692] [2021-08-27 06:40:48,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904020692] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:40:48,764 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:40:48,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 06:40:48,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062176823] [2021-08-27 06:40:48,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:40:48,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:40:48,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:40:48,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:40:48,765 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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:49,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:40:49,141 INFO L93 Difference]: Finished difference Result 223 states and 238 transitions. [2021-08-27 06:40:49,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 06:40:49,141 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 16 [2021-08-27 06:40:49,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:40:49,142 INFO L225 Difference]: With dead ends: 223 [2021-08-27 06:40:49,142 INFO L226 Difference]: Without dead ends: 223 [2021-08-27 06:40:49,143 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 56.7ms TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:40:49,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-08-27 06:40:49,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 151. [2021-08-27 06:40:49,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 109 states have (on average 1.4862385321100917) internal successors, (162), 147 states have internal predecessors, (162), 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:49,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 165 transitions. [2021-08-27 06:40:49,146 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 165 transitions. Word has length 16 [2021-08-27 06:40:49,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:40:49,146 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 165 transitions. [2021-08-27 06:40:49,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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:49,146 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2021-08-27 06:40:49,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 06:40:49,147 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:40:49,147 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:40:49,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 06:40:49,147 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr9REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:40:49,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:40:49,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1579051743, now seen corresponding path program 1 times [2021-08-27 06:40:49,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:40:49,148 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858842850] [2021-08-27 06:40:49,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:40:49,148 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:40:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:49,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:40:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:49,229 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:40:49,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:40:49,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858842850] [2021-08-27 06:40:49,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858842850] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:40:49,230 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:40:49,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 06:40:49,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566170492] [2021-08-27 06:40:49,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:40:49,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:40:49,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:40:49,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:40:49,231 INFO L87 Difference]: Start difference. First operand 151 states and 165 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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:49,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:40:49,668 INFO L93 Difference]: Finished difference Result 215 states and 232 transitions. [2021-08-27 06:40:49,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 06:40:49,669 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 16 [2021-08-27 06:40:49,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:40:49,669 INFO L225 Difference]: With dead ends: 215 [2021-08-27 06:40:49,670 INFO L226 Difference]: Without dead ends: 215 [2021-08-27 06:40:49,670 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 103.1ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-08-27 06:40:49,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-08-27 06:40:49,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 140. [2021-08-27 06:40:49,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 104 states have (on average 1.4423076923076923) internal successors, (150), 136 states have internal predecessors, (150), 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:49,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 153 transitions. [2021-08-27 06:40:49,672 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 153 transitions. Word has length 16 [2021-08-27 06:40:49,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:40:49,673 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 153 transitions. [2021-08-27 06:40:49,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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:49,673 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 153 transitions. [2021-08-27 06:40:49,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 06:40:49,674 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:40:49,674 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:40:49,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 06:40:49,674 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr22ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:40:49,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:40:49,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1760689906, now seen corresponding path program 1 times [2021-08-27 06:40:49,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:40:49,675 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679308831] [2021-08-27 06:40:49,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:40:49,675 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:40:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:49,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:40:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:49,741 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:40:49,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:40:49,741 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679308831] [2021-08-27 06:40:49,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679308831] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:40:49,742 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:40:49,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 06:40:49,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385995403] [2021-08-27 06:40:49,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:40:49,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:40:49,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:40:49,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:40:49,747 INFO L87 Difference]: Start difference. First operand 140 states and 153 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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:40:49,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:40:49,882 INFO L93 Difference]: Finished difference Result 195 states and 215 transitions. [2021-08-27 06:40:49,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:40:49,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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:40:49,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:40:49,883 INFO L225 Difference]: With dead ends: 195 [2021-08-27 06:40:49,883 INFO L226 Difference]: Without dead ends: 195 [2021-08-27 06:40:49,883 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:40:49,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-08-27 06:40:49,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 153. [2021-08-27 06:40:49,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 149 states have internal predecessors, (164), 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:49,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 167 transitions. [2021-08-27 06:40:49,885 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 167 transitions. Word has length 19 [2021-08-27 06:40:49,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:40:49,885 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 167 transitions. [2021-08-27 06:40:49,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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:40:49,886 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 167 transitions. [2021-08-27 06:40:49,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 06:40:49,886 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:40:49,886 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:40:49,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 06:40:49,887 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr17ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:40:49,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:40:49,887 INFO L82 PathProgramCache]: Analyzing trace with hash -555742479, now seen corresponding path program 1 times [2021-08-27 06:40:49,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:40:49,887 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822629830] [2021-08-27 06:40:49,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:40:49,887 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:40:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:49,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:40:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:49,954 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:40:49,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:40:49,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822629830] [2021-08-27 06:40:49,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822629830] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:40:49,954 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:40:49,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 06:40:49,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580034083] [2021-08-27 06:40:49,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:40:49,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:40:49,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:40:49,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:40:49,956 INFO L87 Difference]: Start difference. First operand 153 states and 167 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) 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:40:50,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:40:50,167 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2021-08-27 06:40:50,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 06:40:50,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) 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:40:50,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:40:50,169 INFO L225 Difference]: With dead ends: 153 [2021-08-27 06:40:50,169 INFO L226 Difference]: Without dead ends: 153 [2021-08-27 06:40:50,169 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 59.1ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-08-27 06:40:50,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-08-27 06:40:50,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2021-08-27 06:40:50,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 116 states have (on average 1.396551724137931) internal successors, (162), 147 states have internal predecessors, (162), 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:50,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 165 transitions. [2021-08-27 06:40:50,171 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 165 transitions. Word has length 23 [2021-08-27 06:40:50,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:40:50,172 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 165 transitions. [2021-08-27 06:40:50,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) 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:40:50,172 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2021-08-27 06:40:50,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 06:40:50,177 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:40:50,178 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] [2021-08-27 06:40:50,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 06:40:50,178 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr60REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:40:50,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:40:50,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1696785143, now seen corresponding path program 1 times [2021-08-27 06:40:50,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:40:50,178 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520748102] [2021-08-27 06:40:50,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:40:50,178 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:40:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:50,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:40:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:50,235 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:40:50,235 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:40:50,235 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520748102] [2021-08-27 06:40:50,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520748102] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:40:50,235 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:40:50,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:40:50,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415828881] [2021-08-27 06:40:50,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:40:50,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:40:50,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:40:50,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:40:50,236 INFO L87 Difference]: Start difference. First operand 151 states and 165 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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:50,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:40:50,371 INFO L93 Difference]: Finished difference Result 184 states and 200 transitions. [2021-08-27 06:40:50,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:40:50,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 24 [2021-08-27 06:40:50,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:40:50,373 INFO L225 Difference]: With dead ends: 184 [2021-08-27 06:40:50,373 INFO L226 Difference]: Without dead ends: 184 [2021-08-27 06:40:50,374 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.6ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:40:50,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-08-27 06:40:50,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 162. [2021-08-27 06:40:50,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 127 states have (on average 1.3858267716535433) internal successors, (176), 158 states have internal predecessors, (176), 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:50,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 179 transitions. [2021-08-27 06:40:50,376 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 179 transitions. Word has length 24 [2021-08-27 06:40:50,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:40:50,376 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 179 transitions. [2021-08-27 06:40:50,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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:50,376 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 179 transitions. [2021-08-27 06:40:50,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 06:40:50,379 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:40:50,379 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] [2021-08-27 06:40:50,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 06:40:50,379 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr67ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:40:50,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:40:50,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1457853172, now seen corresponding path program 1 times [2021-08-27 06:40:50,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:40:50,380 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671373349] [2021-08-27 06:40:50,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:40:50,380 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:40:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:50,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:40:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:50,459 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:40:50,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:40:50,459 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671373349] [2021-08-27 06:40:50,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671373349] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:40:50,459 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:40:50,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 06:40:50,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310251438] [2021-08-27 06:40:50,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:40:50,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:40:50,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:40:50,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:40:50,460 INFO L87 Difference]: Start difference. First operand 162 states and 179 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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:50,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:40:50,642 INFO L93 Difference]: Finished difference Result 160 states and 173 transitions. [2021-08-27 06:40:50,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:40:50,643 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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 26 [2021-08-27 06:40:50,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:40:50,643 INFO L225 Difference]: With dead ends: 160 [2021-08-27 06:40:50,643 INFO L226 Difference]: Without dead ends: 160 [2021-08-27 06:40:50,644 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 46.9ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:40:50,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-08-27 06:40:50,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2021-08-27 06:40:50,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 121 states have (on average 1.371900826446281) internal successors, (166), 152 states have internal predecessors, (166), 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:50,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 169 transitions. [2021-08-27 06:40:50,646 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 169 transitions. Word has length 26 [2021-08-27 06:40:50,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:40:50,646 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 169 transitions. [2021-08-27 06:40:50,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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:50,647 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 169 transitions. [2021-08-27 06:40:50,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 06:40:50,648 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:40:50,648 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] [2021-08-27 06:40:50,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 06:40:50,648 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr67ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:40:50,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:40:50,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1062106762, now seen corresponding path program 1 times [2021-08-27 06:40:50,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:40:50,649 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634901384] [2021-08-27 06:40:50,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:40:50,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:40:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:50,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:40:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:50,704 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:40:50,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:40:50,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634901384] [2021-08-27 06:40:50,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634901384] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 06:40:50,705 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:40:50,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 06:40:50,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778323907] [2021-08-27 06:40:50,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:40:50,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:40:50,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:40:50,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:40:50,706 INFO L87 Difference]: Start difference. First operand 156 states and 169 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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:50,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:40:50,877 INFO L93 Difference]: Finished difference Result 156 states and 168 transitions. [2021-08-27 06:40:50,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:40:50,878 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 26 [2021-08-27 06:40:50,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:40:50,880 INFO L225 Difference]: With dead ends: 156 [2021-08-27 06:40:50,880 INFO L226 Difference]: Without dead ends: 156 [2021-08-27 06:40:50,880 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 21.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:40:50,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-08-27 06:40:50,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2021-08-27 06:40:50,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 121 states have (on average 1.3636363636363635) internal successors, (165), 152 states have internal predecessors, (165), 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:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 168 transitions. [2021-08-27 06:40:50,887 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 168 transitions. Word has length 26 [2021-08-27 06:40:50,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:40:50,888 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 168 transitions. [2021-08-27 06:40:50,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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:50,888 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 168 transitions. [2021-08-27 06:40:50,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 06:40:50,891 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:40:50,891 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] [2021-08-27 06:40:50,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 06:40:50,891 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr64REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:40:50,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:40:50,892 INFO L82 PathProgramCache]: Analyzing trace with hash -198024619, now seen corresponding path program 1 times [2021-08-27 06:40:50,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:40:50,892 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081120492] [2021-08-27 06:40:50,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:40:50,892 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:40:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:51,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:40:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:51,030 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:40:51,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:40:51,031 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081120492] [2021-08-27 06:40:51,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081120492] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:40:51,031 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664416608] [2021-08-27 06:40:51,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:40:51,031 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:40:51,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:40:51,041 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:40:51,044 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:40:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:51,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-27 06:40:51,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:40:51,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-08-27 06:40:51,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2021-08-27 06:40:51,489 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:40:51,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664416608] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:40:51,490 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:40:51,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2021-08-27 06:40:51,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140533966] [2021-08-27 06:40:51,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 06:40:51,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:40:51,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 06:40:51,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:40:51,491 INFO L87 Difference]: Start difference. First operand 156 states and 168 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 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:40:51,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:40:51,838 INFO L93 Difference]: Finished difference Result 185 states and 201 transitions. [2021-08-27 06:40:51,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 06:40:51,839 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 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 29 [2021-08-27 06:40:51,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:40:51,842 INFO L225 Difference]: With dead ends: 185 [2021-08-27 06:40:51,842 INFO L226 Difference]: Without dead ends: 185 [2021-08-27 06:40:51,842 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 175.1ms TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2021-08-27 06:40:51,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-08-27 06:40:51,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 166. [2021-08-27 06:40:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 131 states have (on average 1.3435114503816794) internal successors, (176), 162 states have internal predecessors, (176), 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:51,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 179 transitions. [2021-08-27 06:40:51,846 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 179 transitions. Word has length 29 [2021-08-27 06:40:51,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:40:51,846 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 179 transitions. [2021-08-27 06:40:51,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 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:40:51,846 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2021-08-27 06:40:51,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 06:40:51,848 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:40:51,848 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] [2021-08-27 06:40:51,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-27 06:40:52,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-08-27 06:40:52,061 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr69ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:40:52,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:40:52,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1843797011, now seen corresponding path program 1 times [2021-08-27 06:40:52,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:40:52,061 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527502465] [2021-08-27 06:40:52,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:40:52,061 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:40:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:52,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 06:40:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:52,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:40:52,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 06:40:52,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527502465] [2021-08-27 06:40:52,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527502465] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:40:52,135 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409612763] [2021-08-27 06:40:52,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:40:52,135 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:40:52,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:40:52,145 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:40:52,146 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:40:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:52,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 06:40:52,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:40:52,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:40:52,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409612763] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 06:40:52,524 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:40:52,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-08-27 06:40:52,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622843161] [2021-08-27 06:40:52,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 06:40:52,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 06:40:52,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 06:40:52,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-27 06:40:52,528 INFO L87 Difference]: Start difference. First operand 166 states and 179 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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:52,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:40:52,777 INFO L93 Difference]: Finished difference Result 176 states and 188 transitions. [2021-08-27 06:40:52,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:40:52,778 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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 30 [2021-08-27 06:40:52,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:40:52,778 INFO L225 Difference]: With dead ends: 176 [2021-08-27 06:40:52,778 INFO L226 Difference]: Without dead ends: 157 [2021-08-27 06:40:52,779 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 63.8ms TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-08-27 06:40:52,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-08-27 06:40:52,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2021-08-27 06:40:52,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 122 states have (on average 1.360655737704918) internal successors, (166), 153 states have internal predecessors, (166), 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:52,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 169 transitions. [2021-08-27 06:40:52,781 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 169 transitions. Word has length 30 [2021-08-27 06:40:52,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:40:52,781 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 169 transitions. [2021-08-27 06:40:52,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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:52,782 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 169 transitions. [2021-08-27 06:40:52,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-27 06:40:52,782 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:40:52,782 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] [2021-08-27 06:40:52,807 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:52,996 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,SelfDestructingSolverStorable13 [2021-08-27 06:40:52,997 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr22ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:40:52,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:40:52,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1469946611, now seen corresponding path program 1 times [2021-08-27 06:40:52,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 06:40:52,997 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076188915] [2021-08-27 06:40:52,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:40:52,997 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 06:40:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:53,029 ERROR L253 erpolLogProxyWrapper]: Interpolant 10 not inductive [2021-08-27 06:40:53,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 06:40:53,033 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:232) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:876) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-27 06:40:53,041 INFO L168 Benchmark]: Toolchain (without parser) took 7394.38 ms. Allocated memory was 60.8 MB in the beginning and 161.5 MB in the end (delta: 100.7 MB). Free memory was 39.8 MB in the beginning and 71.5 MB in the end (delta: -31.7 MB). Peak memory consumption was 68.8 MB. Max. memory is 16.1 GB. [2021-08-27 06:40:53,042 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 60.8 MB. Free memory is still 42.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:40:53,042 INFO L168 Benchmark]: CACSL2BoogieTranslator took 369.91 ms. Allocated memory is still 60.8 MB. Free memory was 39.5 MB in the beginning and 34.7 MB in the end (delta: 4.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 06:40:53,042 INFO L168 Benchmark]: Boogie Preprocessor took 53.55 ms. Allocated memory is still 60.8 MB. Free memory was 34.7 MB in the beginning and 31.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 06:40:53,042 INFO L168 Benchmark]: RCFGBuilder took 634.03 ms. Allocated memory was 60.8 MB in the beginning and 75.5 MB in the end (delta: 14.7 MB). Free memory was 31.4 MB in the beginning and 41.2 MB in the end (delta: -9.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 16.1 GB. [2021-08-27 06:40:53,043 INFO L168 Benchmark]: TraceAbstraction took 6330.23 ms. Allocated memory was 75.5 MB in the beginning and 161.5 MB in the end (delta: 86.0 MB). Free memory was 40.8 MB in the beginning and 71.5 MB in the end (delta: -30.6 MB). Peak memory consumption was 55.4 MB. Max. memory is 16.1 GB. [2021-08-27 06:40:53,044 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.15 ms. Allocated memory is still 60.8 MB. Free memory is still 42.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 369.91 ms. Allocated memory is still 60.8 MB. Free memory was 39.5 MB in the beginning and 34.7 MB in the end (delta: 4.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 53.55 ms. Allocated memory is still 60.8 MB. Free memory was 34.7 MB in the beginning and 31.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 634.03 ms. Allocated memory was 60.8 MB in the beginning and 75.5 MB in the end (delta: 14.7 MB). Free memory was 31.4 MB in the beginning and 41.2 MB in the end (delta: -9.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 6330.23 ms. Allocated memory was 75.5 MB in the beginning and 161.5 MB in the end (delta: 86.0 MB). Free memory was 40.8 MB in the beginning and 71.5 MB in the end (delta: -30.6 MB). Peak memory consumption was 55.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:232) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-27 06:40:53,069 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... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 06:40:54,697 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 06:40:54,699 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 06:40:54,737 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 06:40:54,737 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 06:40:54,738 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 06:40:54,739 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 06:40:54,746 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 06:40:54,747 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 06:40:54,752 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 06:40:54,753 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 06:40:54,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 06:40:54,758 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 06:40:54,760 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 06:40:54,761 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 06:40:54,763 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 06:40:54,765 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 06:40:54,765 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 06:40:54,767 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 06:40:54,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 06:40:54,772 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 06:40:54,773 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 06:40:54,774 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 06:40:54,775 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 06:40:54,779 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 06:40:54,780 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 06:40:54,780 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 06:40:54,781 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 06:40:54,782 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 06:40:54,783 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 06:40:54,783 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 06:40:54,784 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 06:40:54,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 06:40:54,787 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 06:40:54,788 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 06:40:54,788 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 06:40:54,788 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 06:40:54,789 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 06:40:54,789 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 06:40:54,789 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 06:40:54,791 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 06:40:54,792 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-08-27 06:40:54,818 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 06:40:54,818 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 06:40:54,819 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 06:40:54,819 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 06:40:54,820 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 06:40:54,820 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 06:40:54,820 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 06:40:54,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 06:40:54,821 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 06:40:54,821 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 06:40:54,821 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 06:40:54,822 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 06:40:54,822 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 06:40:54,822 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 06:40:54,822 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 06:40:54,822 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 06:40:54,822 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 06:40:54,822 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 06:40:54,823 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-27 06:40:54,823 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-27 06:40:54,823 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 06:40:54,823 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 06:40:54,823 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 06:40:54,823 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 06:40:54,823 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 06:40:54,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:40:54,824 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 06:40:54,824 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 06:40:54,824 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-27 06:40:54,824 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-27 06:40:54,824 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 06:40:54,824 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-27 06:40:54,825 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e7731899c5e817fc6eaadbde2ec1f0ed993fe63c [2021-08-27 06:40:55,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 06:40:55,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 06:40:55,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 06:40:55,092 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 06:40:55,092 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 06:40:55,093 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-queue-1.i [2021-08-27 06:40:55,139 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2b5c0535/32fef1eb9c354ca39120c4468f6dcd21/FLAGe127ab293 [2021-08-27 06:40:55,585 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 06:40:55,598 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i [2021-08-27 06:40:55,611 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2b5c0535/32fef1eb9c354ca39120c4468f6dcd21/FLAGe127ab293 [2021-08-27 06:40:55,622 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2b5c0535/32fef1eb9c354ca39120c4468f6dcd21 [2021-08-27 06:40:55,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 06:40:55,625 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 06:40:55,626 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 06:40:55,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 06:40:55,629 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 06:40:55,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:40:55" (1/1) ... [2021-08-27 06:40:55,631 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b281f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:40:55, skipping insertion in model container [2021-08-27 06:40:55,631 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:40:55" (1/1) ... [2021-08-27 06:40:55,635 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 06:40:55,656 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 06:40:55,890 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-queue-1.i[22387,22400] [2021-08-27 06:40:55,896 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-queue-1.i[22458,22471] [2021-08-27 06:40:55,897 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-queue-1.i[22532,22545] [2021-08-27 06:40:55,899 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-queue-1.i[22624,22637] [2021-08-27 06:40:55,901 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-queue-1.i[22701,22714] [2021-08-27 06:40:55,902 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-queue-1.i[22796,22809] [2021-08-27 06:40:55,903 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-queue-1.i[22873,22886] [2021-08-27 06:40:55,905 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-queue-1.i[22956,22969] [2021-08-27 06:40:55,906 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-queue-1.i[23051,23064] [2021-08-27 06:40:55,907 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-queue-1.i[23128,23141] [2021-08-27 06:40:55,909 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-queue-1.i[23211,23224] [2021-08-27 06:40:55,913 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-queue-1.i[23300,23313] [2021-08-27 06:40:55,914 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-queue-1.i[23386,23399] [2021-08-27 06:40:55,916 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-queue-1.i[23532,23545] [2021-08-27 06:40:55,925 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:40:55,937 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 06:40:55,967 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-queue-1.i[22387,22400] [2021-08-27 06:40:55,970 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-queue-1.i[22458,22471] [2021-08-27 06:40:55,972 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-queue-1.i[22532,22545] [2021-08-27 06:40:55,973 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-queue-1.i[22624,22637] [2021-08-27 06:40:55,976 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-queue-1.i[22701,22714] [2021-08-27 06:40:55,977 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-queue-1.i[22796,22809] [2021-08-27 06:40:55,978 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-queue-1.i[22873,22886] [2021-08-27 06:40:55,979 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-queue-1.i[22956,22969] [2021-08-27 06:40:55,980 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-queue-1.i[23051,23064] [2021-08-27 06:40:55,981 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-queue-1.i[23128,23141] [2021-08-27 06:40:55,982 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-queue-1.i[23211,23224] [2021-08-27 06:40:55,983 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-queue-1.i[23300,23313] [2021-08-27 06:40:55,984 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-queue-1.i[23386,23399] [2021-08-27 06:40:55,986 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-queue-1.i[23532,23545] [2021-08-27 06:40:55,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 06:40:56,019 INFO L208 MainTranslator]: Completed translation [2021-08-27 06:40:56,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:40:56 WrapperNode [2021-08-27 06:40:56,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 06:40:56,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 06:40:56,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 06:40:56,022 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 06:40:56,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:40:56" (1/1) ... [2021-08-27 06:40:56,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:40:56" (1/1) ... [2021-08-27 06:40:56,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:40:56" (1/1) ... [2021-08-27 06:40:56,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:40:56" (1/1) ... [2021-08-27 06:40:56,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:40:56" (1/1) ... [2021-08-27 06:40:56,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:40:56" (1/1) ... [2021-08-27 06:40:56,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:40:56" (1/1) ... [2021-08-27 06:40:56,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 06:40:56,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 06:40:56,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 06:40:56,091 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 06:40:56,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:40:56" (1/1) ... [2021-08-27 06:40:56,111 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 06:40:56,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:40:56,131 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:40:56,133 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:40:56,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 06:40:56,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 06:40:56,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 06:40:56,160 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 06:40:56,161 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 06:40:56,161 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 06:40:56,161 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 06:40:56,161 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 06:40:56,162 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 06:40:56,162 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 06:40:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 06:40:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 06:40:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 06:40:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 06:40:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 06:40:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 06:40:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 06:40:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 06:40:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 06:40:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 06:40:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 06:40:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 06:40:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 06:40:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 06:40:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 06:40:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 06:40:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 06:40:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 06:40:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 06:40:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 06:40:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 06:40:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 06:40:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 06:40:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 06:40:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 06:40:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 06:40:56,176 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 06:40:56,176 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 06:40:56,176 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 06:40:56,177 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 06:40:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 06:40:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 06:40:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 06:40:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 06:40:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 06:40:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 06:40:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 06:40:56,178 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 06:40:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 06:40:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 06:40:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 06:40:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 06:40:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 06:40:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 06:40:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 06:40:56,179 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 06:40:56,180 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 06:40:56,180 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 06:40:56,180 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 06:40:56,180 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 06:40:56,180 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 06:40:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 06:40:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 06:40:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 06:40:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 06:40:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 06:40:56,181 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 06:40:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 06:40:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 06:40:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 06:40:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 06:40:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 06:40:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 06:40:56,182 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 06:40:56,183 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 06:40:56,183 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 06:40:56,183 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 06:40:56,183 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 06:40:56,183 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 06:40:56,184 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 06:40:56,184 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 06:40:56,184 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 06:40:56,184 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 06:40:56,185 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 06:40:56,185 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 06:40:56,185 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 06:40:56,185 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 06:40:56,185 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 06:40:56,185 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 06:40:56,186 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 06:40:56,186 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 06:40:56,186 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 06:40:56,186 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 06:40:56,186 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 06:40:56,187 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 06:40:56,187 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 06:40:56,187 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 06:40:56,188 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 06:40:56,189 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 06:40:56,190 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 06:40:56,191 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 06:40:56,191 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 06:40:56,191 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 06:40:56,192 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 06:40:56,192 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 06:40:56,192 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 06:40:56,192 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 06:40:56,192 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 06:40:56,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 06:40:56,199 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 06:40:56,199 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 06:40:56,199 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 06:40:56,199 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 06:40:56,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 06:40:56,199 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 06:40:56,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 06:40:56,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 06:40:56,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-27 06:40:56,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 06:40:56,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-27 06:40:56,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 06:40:56,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 06:40:56,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-27 06:40:56,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 06:40:56,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 06:40:56,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-08-27 06:40:56,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-08-27 06:40:56,832 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 06:40:56,833 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2021-08-27 06:40:56,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:40:56 BoogieIcfgContainer [2021-08-27 06:40:56,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 06:40:56,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 06:40:56,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 06:40:56,839 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 06:40:56,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 06:40:55" (1/3) ... [2021-08-27 06:40:56,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24df8629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:40:56, skipping insertion in model container [2021-08-27 06:40:56,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:40:56" (2/3) ... [2021-08-27 06:40:56,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24df8629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:40:56, skipping insertion in model container [2021-08-27 06:40:56,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:40:56" (3/3) ... [2021-08-27 06:40:56,841 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-queue-1.i [2021-08-27 06:40:56,844 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 06:40:56,844 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2021-08-27 06:40:56,875 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 06:40:56,879 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:40:56,880 INFO L340 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2021-08-27 06:40:56,896 INFO L276 IsEmpty]: Start isEmpty. Operand has 173 states, 98 states have (on average 2.2755102040816326) internal successors, (223), 168 states have internal predecessors, (223), 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:40:56,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 06:40:56,909 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:40:56,909 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:40:56,909 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:40:56,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:40:56,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1735636923, now seen corresponding path program 1 times [2021-08-27 06:40:56,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:40:56,923 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93752062] [2021-08-27 06:40:56,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:40:56,924 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:40:56,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:40:56,926 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:40:56,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-27 06:40:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:57,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 06:40:57,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:40:57,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:40:57,152 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:40:57,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:40:57,201 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:40:57,202 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:40:57,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [93752062] [2021-08-27 06:40:57,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [93752062] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:40:57,203 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:40:57,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 06:40:57,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855557667] [2021-08-27 06:40:57,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 06:40:57,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:40:57,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 06:40:57,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:40:57,217 INFO L87 Difference]: Start difference. First operand has 173 states, 98 states have (on average 2.2755102040816326) internal successors, (223), 168 states have internal predecessors, (223), 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 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 1 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:57,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:40:57,422 INFO L93 Difference]: Finished difference Result 170 states and 180 transitions. [2021-08-27 06:40:57,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 06:40:57,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 1 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:40:57,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:40:57,429 INFO L225 Difference]: With dead ends: 170 [2021-08-27 06:40:57,429 INFO L226 Difference]: Without dead ends: 166 [2021-08-27 06:40:57,430 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:40:57,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-08-27 06:40:57,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2021-08-27 06:40:57,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 99 states have (on average 1.7171717171717171) internal successors, (170), 158 states have internal predecessors, (170), 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:57,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2021-08-27 06:40:57,475 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 7 [2021-08-27 06:40:57,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:40:57,475 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2021-08-27 06:40:57,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 1 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:57,475 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2021-08-27 06:40:57,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 06:40:57,476 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:40:57,476 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:40:57,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-08-27 06:40:57,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:40:57,683 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:40:57,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:40:57,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1735636922, now seen corresponding path program 1 times [2021-08-27 06:40:57,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:40:57,688 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660253350] [2021-08-27 06:40:57,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:40:57,688 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:40:57,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:40:57,689 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:40:57,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-27 06:40:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:57,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 06:40:57,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:40:57,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:40:57,834 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:40:57,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:40:57,897 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:40:57,898 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:40:57,898 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660253350] [2021-08-27 06:40:57,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [660253350] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:40:57,898 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:40:57,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-08-27 06:40:57,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786393007] [2021-08-27 06:40:57,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:40:57,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:40:57,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:40:57,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:40:57,906 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (2), 1 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:58,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:40:58,096 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2021-08-27 06:40:58,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:40:58,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (2), 1 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:40:58,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:40:58,098 INFO L225 Difference]: With dead ends: 156 [2021-08-27 06:40:58,098 INFO L226 Difference]: Without dead ends: 156 [2021-08-27 06:40:58,098 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:40:58,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-08-27 06:40:58,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2021-08-27 06:40:58,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 99 states have (on average 1.606060606060606) internal successors, (159), 148 states have internal predecessors, (159), 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:58,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2021-08-27 06:40:58,103 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 7 [2021-08-27 06:40:58,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:40:58,103 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2021-08-27 06:40:58,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (2), 1 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:58,103 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2021-08-27 06:40:58,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-27 06:40:58,104 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:40:58,104 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:40:58,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-27 06:40:58,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:40:58,310 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr4REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:40:58,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:40:58,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1828127689, now seen corresponding path program 1 times [2021-08-27 06:40:58,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:40:58,311 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475709554] [2021-08-27 06:40:58,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:40:58,311 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:40:58,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:40:58,312 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:40:58,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-27 06:40:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:58,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 06:40:58,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:40:58,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:40:58,533 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-08-27 06:40:58,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 23 [2021-08-27 06:40:58,568 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:40:58,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:40:58,634 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:40:58,634 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:40:58,635 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475709554] [2021-08-27 06:40:58,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475709554] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:40:58,635 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:40:58,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-27 06:40:58,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403642930] [2021-08-27 06:40:58,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:40:58,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:40:58,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:40:58,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:40:58,636 INFO L87 Difference]: Start difference. First operand 152 states and 162 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 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:58,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:40:58,876 INFO L93 Difference]: Finished difference Result 162 states and 171 transitions. [2021-08-27 06:40:58,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:40:58,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 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 11 [2021-08-27 06:40:58,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:40:58,877 INFO L225 Difference]: With dead ends: 162 [2021-08-27 06:40:58,877 INFO L226 Difference]: Without dead ends: 162 [2021-08-27 06:40:58,877 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 8 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 47.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:40:58,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-08-27 06:40:58,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 154. [2021-08-27 06:40:58,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 106 states have (on average 1.5566037735849056) internal successors, (165), 150 states have internal predecessors, (165), 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:58,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2021-08-27 06:40:58,884 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 11 [2021-08-27 06:40:58,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:40:58,885 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 168 transitions. [2021-08-27 06:40:58,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 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:58,885 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2021-08-27 06:40:58,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-27 06:40:58,885 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:40:58,885 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:40:58,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-08-27 06:40:59,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:40:59,089 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr5REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:40:59,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:40:59,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1828127690, now seen corresponding path program 1 times [2021-08-27 06:40:59,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:40:59,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943119679] [2021-08-27 06:40:59,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:40:59,090 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:40:59,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:40:59,090 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:40:59,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-27 06:40:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:40:59,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 06:40:59,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:40:59,253 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:40:59,313 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 06:40:59,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-08-27 06:40:59,328 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:40:59,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:40:59,542 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:40:59,542 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:40:59,542 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [943119679] [2021-08-27 06:40:59,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [943119679] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:40:59,543 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:40:59,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 6 [2021-08-27 06:40:59,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908007607] [2021-08-27 06:40:59,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:40:59,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:40:59,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:40:59,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:40:59,544 INFO L87 Difference]: Start difference. First operand 154 states and 168 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (2), 1 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:41:00,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:41:00,266 INFO L93 Difference]: Finished difference Result 243 states and 258 transitions. [2021-08-27 06:41:00,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 06:41:00,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (2), 1 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 11 [2021-08-27 06:41:00,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:41:00,270 INFO L225 Difference]: With dead ends: 243 [2021-08-27 06:41:00,270 INFO L226 Difference]: Without dead ends: 243 [2021-08-27 06:41:00,270 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 200.1ms TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:41:00,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-08-27 06:41:00,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 155. [2021-08-27 06:41:00,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 108 states have (on average 1.537037037037037) internal successors, (166), 151 states have internal predecessors, (166), 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:41:00,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 169 transitions. [2021-08-27 06:41:00,277 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 169 transitions. Word has length 11 [2021-08-27 06:41:00,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:41:00,277 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 169 transitions. [2021-08-27 06:41:00,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (2), 1 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:41:00,277 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 169 transitions. [2021-08-27 06:41:00,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 06:41:00,278 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:41:00,278 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:41:00,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-27 06:41:00,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:41:00,484 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr18ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:41:00,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:41:00,485 INFO L82 PathProgramCache]: Analyzing trace with hash 837384167, now seen corresponding path program 1 times [2021-08-27 06:41:00,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:41:00,485 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802578302] [2021-08-27 06:41:00,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:41:00,485 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:41:00,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:41:00,486 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:41:00,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-27 06:41:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:41:00,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 06:41:00,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:41:00,649 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:41:00,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:41:00,677 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:41:00,678 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:41:00,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802578302] [2021-08-27 06:41:00,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [802578302] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:41:00,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:41:00,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-27 06:41:00,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840770923] [2021-08-27 06:41:00,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 06:41:00,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:41:00,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 06:41:00,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:41:00,680 INFO L87 Difference]: Start difference. First operand 155 states and 169 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 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:41:00,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:41:00,729 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2021-08-27 06:41:00,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 06:41:00,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 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 12 [2021-08-27 06:41:00,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:41:00,731 INFO L225 Difference]: With dead ends: 145 [2021-08-27 06:41:00,731 INFO L226 Difference]: Without dead ends: 145 [2021-08-27 06:41:00,731 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:41:00,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-08-27 06:41:00,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2021-08-27 06:41:00,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 103 states have (on average 1.5048543689320388) internal successors, (155), 141 states have internal predecessors, (155), 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:41:00,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2021-08-27 06:41:00,734 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 12 [2021-08-27 06:41:00,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:41:00,735 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2021-08-27 06:41:00,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 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:41:00,735 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2021-08-27 06:41:00,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 06:41:00,735 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:41:00,735 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:41:00,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-27 06:41:00,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:41:00,942 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr8REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:41:00,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:41:00,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1322768587, now seen corresponding path program 1 times [2021-08-27 06:41:00,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:41:00,943 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208696133] [2021-08-27 06:41:00,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:41:00,943 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:41:00,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:41:00,944 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:41:00,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-27 06:41:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:41:01,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 06:41:01,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:41:01,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:41:01,110 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 20 treesize of output 16 [2021-08-27 06:41:01,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-08-27 06:41:01,152 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:41:01,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:41:01,201 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:41:01,202 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:41:01,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208696133] [2021-08-27 06:41:01,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [208696133] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:41:01,202 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:41:01,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-08-27 06:41:01,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844118692] [2021-08-27 06:41:01,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:41:01,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:41:01,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:41:01,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:41:01,204 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 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:41:01,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:41:01,629 INFO L93 Difference]: Finished difference Result 216 states and 230 transitions. [2021-08-27 06:41:01,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 06:41:01,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 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:41:01,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:41:01,630 INFO L225 Difference]: With dead ends: 216 [2021-08-27 06:41:01,630 INFO L226 Difference]: Without dead ends: 216 [2021-08-27 06:41:01,631 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 58.8ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:41:01,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-08-27 06:41:01,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 144. [2021-08-27 06:41:01,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 103 states have (on average 1.4951456310679612) internal successors, (154), 140 states have internal predecessors, (154), 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:41:01,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 157 transitions. [2021-08-27 06:41:01,634 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 157 transitions. Word has length 15 [2021-08-27 06:41:01,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:41:01,635 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 157 transitions. [2021-08-27 06:41:01,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 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:41:01,635 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 157 transitions. [2021-08-27 06:41:01,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 06:41:01,636 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:41:01,636 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:41:01,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-08-27 06:41:01,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:41:01,843 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr9REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:41:01,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:41:01,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1322768588, now seen corresponding path program 1 times [2021-08-27 06:41:01,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:41:01,844 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [50445814] [2021-08-27 06:41:01,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:41:01,844 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:41:01,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:41:01,845 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:41:01,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-08-27 06:41:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:41:01,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 06:41:01,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:41:02,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:41:02,057 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:41:02,063 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 17 treesize of output 13 [2021-08-27 06:41:02,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-08-27 06:41:02,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-08-27 06:41:02,148 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:41:02,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:41:02,356 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:41:02,357 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:41:02,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [50445814] [2021-08-27 06:41:02,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [50445814] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:41:02,357 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:41:02,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2021-08-27 06:41:02,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761587075] [2021-08-27 06:41:02,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 06:41:02,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:41:02,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 06:41:02,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:41:02,360 INFO L87 Difference]: Start difference. First operand 144 states and 157 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 1 states have call successors, (2), 1 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:41:03,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:41:03,353 INFO L93 Difference]: Finished difference Result 211 states and 227 transitions. [2021-08-27 06:41:03,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 06:41:03,354 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 1 states have call successors, (2), 1 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:41:03,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:41:03,354 INFO L225 Difference]: With dead ends: 211 [2021-08-27 06:41:03,354 INFO L226 Difference]: Without dead ends: 211 [2021-08-27 06:41:03,355 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 285.2ms TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2021-08-27 06:41:03,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-08-27 06:41:03,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 137. [2021-08-27 06:41:03,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 101 states have (on average 1.4455445544554455) internal successors, (146), 133 states have internal predecessors, (146), 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:41:03,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2021-08-27 06:41:03,358 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 15 [2021-08-27 06:41:03,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:41:03,358 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2021-08-27 06:41:03,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 1 states have call successors, (2), 1 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:41:03,358 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2021-08-27 06:41:03,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-27 06:41:03,358 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:41:03,358 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:41:03,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-08-27 06:41:03,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:41:03,567 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr22ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:41:03,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:41:03,567 INFO L82 PathProgramCache]: Analyzing trace with hash 788457692, now seen corresponding path program 1 times [2021-08-27 06:41:03,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:41:03,568 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234727664] [2021-08-27 06:41:03,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:41:03,568 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:41:03,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:41:03,569 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:41:03,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-08-27 06:41:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:41:03,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 06:41:03,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:41:03,759 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:41:03,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:41:03,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:41:03,809 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:41:03,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234727664] [2021-08-27 06:41:03,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234727664] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:41:03,809 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:41:03,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-27 06:41:03,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588293689] [2021-08-27 06:41:03,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:41:03,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:41:03,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:41:03,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:41:03,811 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 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:41:03,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:41:03,856 INFO L93 Difference]: Finished difference Result 248 states and 275 transitions. [2021-08-27 06:41:03,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 06:41:03,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 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:41:03,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:41:03,857 INFO L225 Difference]: With dead ends: 248 [2021-08-27 06:41:03,857 INFO L226 Difference]: Without dead ends: 248 [2021-08-27 06:41:03,857 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:41:03,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-08-27 06:41:03,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 164. [2021-08-27 06:41:03,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 128 states have (on average 1.3828125) internal successors, (177), 160 states have internal predecessors, (177), 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:41:03,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 180 transitions. [2021-08-27 06:41:03,861 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 180 transitions. Word has length 18 [2021-08-27 06:41:03,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:41:03,861 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 180 transitions. [2021-08-27 06:41:03,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 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:41:03,861 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 180 transitions. [2021-08-27 06:41:03,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 06:41:03,862 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:41:03,862 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:41:03,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-08-27 06:41:04,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:41:04,069 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr59REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:41:04,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:41:04,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1487936176, now seen corresponding path program 1 times [2021-08-27 06:41:04,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:41:04,069 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1730409692] [2021-08-27 06:41:04,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:41:04,069 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:41:04,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:41:04,070 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:41:04,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-08-27 06:41:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:41:04,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 06:41:04,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:41:04,290 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:41:04,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:41:04,347 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:41:04,347 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:41:04,347 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1730409692] [2021-08-27 06:41:04,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1730409692] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:41:04,348 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:41:04,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-27 06:41:04,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216152886] [2021-08-27 06:41:04,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 06:41:04,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:41:04,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 06:41:04,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 06:41:04,349 INFO L87 Difference]: Start difference. First operand 164 states and 180 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 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:41:04,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:41:04,380 INFO L93 Difference]: Finished difference Result 195 states and 212 transitions. [2021-08-27 06:41:04,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:41:04,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 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:41:04,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:41:04,382 INFO L225 Difference]: With dead ends: 195 [2021-08-27 06:41:04,382 INFO L226 Difference]: Without dead ends: 195 [2021-08-27 06:41:04,383 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:41:04,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-08-27 06:41:04,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 173. [2021-08-27 06:41:04,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 137 states have (on average 1.3722627737226278) internal successors, (188), 169 states have internal predecessors, (188), 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:41:04,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 191 transitions. [2021-08-27 06:41:04,388 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 191 transitions. Word has length 21 [2021-08-27 06:41:04,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:41:04,388 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 191 transitions. [2021-08-27 06:41:04,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 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:41:04,389 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 191 transitions. [2021-08-27 06:41:04,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 06:41:04,391 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:41:04,392 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] [2021-08-27 06:41:04,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-08-27 06:41:04,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:41:04,599 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr17ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:41:04,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:41:04,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1623470821, now seen corresponding path program 1 times [2021-08-27 06:41:04,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:41:04,600 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979653724] [2021-08-27 06:41:04,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:41:04,600 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:41:04,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:41:04,601 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:41:04,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-08-27 06:41:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:41:04,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 06:41:04,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:41:04,826 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 16 treesize of output 12 [2021-08-27 06:41:04,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-08-27 06:41:04,887 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:41:04,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:41:04,943 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:41:04,943 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:41:04,943 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [979653724] [2021-08-27 06:41:04,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [979653724] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:41:04,944 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:41:04,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2021-08-27 06:41:04,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694442532] [2021-08-27 06:41:04,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 06:41:04,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:41:04,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 06:41:04,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:41:04,945 INFO L87 Difference]: Start difference. First operand 173 states and 191 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 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:41:05,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:41:05,134 INFO L93 Difference]: Finished difference Result 171 states and 188 transitions. [2021-08-27 06:41:05,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 06:41:05,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 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 22 [2021-08-27 06:41:05,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:41:05,135 INFO L225 Difference]: With dead ends: 171 [2021-08-27 06:41:05,135 INFO L226 Difference]: Without dead ends: 171 [2021-08-27 06:41:05,135 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 54.2ms TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-08-27 06:41:05,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-08-27 06:41:05,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2021-08-27 06:41:05,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 136 states have (on average 1.3602941176470589) internal successors, (185), 167 states have internal predecessors, (185), 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:41:05,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 188 transitions. [2021-08-27 06:41:05,138 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 188 transitions. Word has length 22 [2021-08-27 06:41:05,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:41:05,138 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 188 transitions. [2021-08-27 06:41:05,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 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:41:05,138 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 188 transitions. [2021-08-27 06:41:05,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 06:41:05,139 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:41:05,139 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:41:05,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-08-27 06:41:05,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:41:05,346 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr67ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:41:05,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:41:05,346 INFO L82 PathProgramCache]: Analyzing trace with hash -336639908, now seen corresponding path program 1 times [2021-08-27 06:41:05,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:41:05,347 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1496526241] [2021-08-27 06:41:05,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:41:05,347 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:41:05,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:41:05,347 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:41:05,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-08-27 06:41:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:41:05,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 06:41:05,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:41:05,688 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:41:05,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:41:05,779 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:41:05,779 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:41:05,779 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1496526241] [2021-08-27 06:41:05,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1496526241] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:41:05,779 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:41:05,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [] total 6 [2021-08-27 06:41:05,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662609963] [2021-08-27 06:41:05,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:41:05,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:41:05,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:41:05,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:41:05,782 INFO L87 Difference]: Start difference. First operand 171 states and 188 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:41:05,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:41:05,963 INFO L93 Difference]: Finished difference Result 175 states and 191 transitions. [2021-08-27 06:41:05,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 06:41:05,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2021-08-27 06:41:05,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:41:05,965 INFO L225 Difference]: With dead ends: 175 [2021-08-27 06:41:05,965 INFO L226 Difference]: Without dead ends: 175 [2021-08-27 06:41:05,965 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 59.5ms TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:41:05,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-08-27 06:41:05,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2021-08-27 06:41:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 136 states have (on average 1.3529411764705883) internal successors, (184), 167 states have internal predecessors, (184), 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:41:05,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 187 transitions. [2021-08-27 06:41:05,969 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 187 transitions. Word has length 23 [2021-08-27 06:41:05,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:41:05,969 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 187 transitions. [2021-08-27 06:41:05,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:41:05,969 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2021-08-27 06:41:05,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 06:41:05,970 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:41:05,970 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:41:05,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-08-27 06:41:06,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:41:06,189 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr62REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:41:06,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:41:06,190 INFO L82 PathProgramCache]: Analyzing trace with hash -317481246, now seen corresponding path program 1 times [2021-08-27 06:41:06,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:41:06,190 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [691519609] [2021-08-27 06:41:06,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:41:06,190 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:41:06,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:41:06,191 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:41:06,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-08-27 06:41:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:41:06,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 06:41:06,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:41:06,416 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:41:06,420 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:41:06,447 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-08-27 06:41:06,447 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 27 treesize of output 11 [2021-08-27 06:41:06,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:41:06,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-08-27 06:41:06,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-08-27 06:41:06,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2021-08-27 06:41:06,578 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:41:06,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:41:06,711 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:41:06,711 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:41:06,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [691519609] [2021-08-27 06:41:06,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [691519609] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:41:06,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:41:06,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-08-27 06:41:06,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761656524] [2021-08-27 06:41:06,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:41:06,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:41:06,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:41:06,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:41:06,713 INFO L87 Difference]: Start difference. First operand 171 states and 187 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 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:41:06,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:41:06,885 INFO L93 Difference]: Finished difference Result 168 states and 181 transitions. [2021-08-27 06:41:06,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:41:06,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 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:41:06,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:41:06,887 INFO L225 Difference]: With dead ends: 168 [2021-08-27 06:41:06,887 INFO L226 Difference]: Without dead ends: 168 [2021-08-27 06:41:06,887 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 42.2ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:41:06,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-08-27 06:41:06,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2021-08-27 06:41:06,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 130 states have (on average 1.3461538461538463) internal successors, (175), 161 states have internal predecessors, (175), 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:41:06,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 178 transitions. [2021-08-27 06:41:06,890 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 178 transitions. Word has length 23 [2021-08-27 06:41:06,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:41:06,890 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 178 transitions. [2021-08-27 06:41:06,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 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:41:06,891 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 178 transitions. [2021-08-27 06:41:06,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 06:41:06,891 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:41:06,891 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] [2021-08-27 06:41:06,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-08-27 06:41:07,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:41:07,098 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr64REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:41:07,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:41:07,098 INFO L82 PathProgramCache]: Analyzing trace with hash -90396675, now seen corresponding path program 1 times [2021-08-27 06:41:07,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:41:07,098 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478208576] [2021-08-27 06:41:07,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:41:07,099 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:41:07,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:41:07,099 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:41:07,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-08-27 06:41:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:41:07,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 06:41:07,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:41:07,354 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:41:07,358 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:41:07,397 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-08-27 06:41:07,397 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 27 treesize of output 11 [2021-08-27 06:41:07,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:41:07,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-08-27 06:41:07,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-08-27 06:41:07,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2021-08-27 06:41:07,536 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:41:07,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:41:07,691 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:41:07,692 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:41:07,692 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478208576] [2021-08-27 06:41:07,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478208576] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 06:41:07,692 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:41:07,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2021-08-27 06:41:07,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423676510] [2021-08-27 06:41:07,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:41:07,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:41:07,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:41:07,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:41:07,693 INFO L87 Difference]: Start difference. First operand 165 states and 178 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 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:41:07,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:41:07,821 INFO L93 Difference]: Finished difference Result 172 states and 185 transitions. [2021-08-27 06:41:07,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 06:41:07,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 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 26 [2021-08-27 06:41:07,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:41:07,823 INFO L225 Difference]: With dead ends: 172 [2021-08-27 06:41:07,823 INFO L226 Difference]: Without dead ends: 172 [2021-08-27 06:41:07,823 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 06:41:07,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-08-27 06:41:07,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2021-08-27 06:41:07,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 137 states have (on average 1.3284671532846715) internal successors, (182), 168 states have internal predecessors, (182), 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:41:07,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 185 transitions. [2021-08-27 06:41:07,825 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 185 transitions. Word has length 26 [2021-08-27 06:41:07,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:41:07,826 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 185 transitions. [2021-08-27 06:41:07,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 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:41:07,826 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 185 transitions. [2021-08-27 06:41:07,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 06:41:07,826 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:41:07,826 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:41:07,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-08-27 06:41:08,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:41:08,033 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr69ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:41:08,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:41:08,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1492669267, now seen corresponding path program 1 times [2021-08-27 06:41:08,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:41:08,034 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566385734] [2021-08-27 06:41:08,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:41:08,034 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:41:08,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:41:08,035 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:41:08,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-08-27 06:41:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:41:08,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 06:41:08,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:41:08,317 INFO L354 Elim1Store]: treesize reduction 34, result has 38.2 percent of original size [2021-08-27 06:41:08,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 26 [2021-08-27 06:41:12,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:41:12,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:41:14,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:41:14,569 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:41:14,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566385734] [2021-08-27 06:41:14,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [566385734] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 06:41:14,569 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:41:14,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2021-08-27 06:41:14,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739925078] [2021-08-27 06:41:14,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 06:41:14,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:41:14,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 06:41:14,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=77, Unknown=2, NotChecked=0, Total=110 [2021-08-27 06:41:14,571 INFO L87 Difference]: Start difference. First operand 172 states and 185 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:41:16,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:41:16,982 INFO L93 Difference]: Finished difference Result 174 states and 186 transitions. [2021-08-27 06:41:16,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 06:41:16,983 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2021-08-27 06:41:16,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:41:16,984 INFO L225 Difference]: With dead ends: 174 [2021-08-27 06:41:16,984 INFO L226 Difference]: Without dead ends: 157 [2021-08-27 06:41:16,984 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 4189.8ms TimeCoverageRelationStatistics Valid=46, Invalid=108, Unknown=2, NotChecked=0, Total=156 [2021-08-27 06:41:16,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-08-27 06:41:16,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2021-08-27 06:41:16,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 122 states have (on average 1.360655737704918) internal successors, (166), 153 states have internal predecessors, (166), 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:41:16,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 169 transitions. [2021-08-27 06:41:16,987 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 169 transitions. Word has length 27 [2021-08-27 06:41:16,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:41:16,987 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 169 transitions. [2021-08-27 06:41:16,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 06:41:16,987 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 169 transitions. [2021-08-27 06:41:16,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 06:41:16,987 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:41:16,988 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:41:17,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-08-27 06:41:17,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:41:17,188 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr22ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:41:17,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:41:17,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1623479099, now seen corresponding path program 1 times [2021-08-27 06:41:17,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:41:17,189 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721881969] [2021-08-27 06:41:17,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:41:17,189 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:41:17,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:41:17,190 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:41:17,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-08-27 06:41:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:41:17,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 06:41:17,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:41:17,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:41:17,581 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:41:17,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-08-27 06:41:17,620 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 20 treesize of output 16 [2021-08-27 06:41:17,730 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:41:17,731 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 35 treesize of output 26 [2021-08-27 06:41:17,815 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-08-27 06:41:17,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 44 [2021-08-27 06:41:17,970 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:41:17,970 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 18 [2021-08-27 06:41:17,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:41:17,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:41:27,259 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_5 (_ BitVec 32)) (main_~item~0.offset (_ BitVec 32))) (not (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |c_main_#t~mem6.base| (store (store (select |c_#memory_$Pointer$.base| |c_main_#t~mem6.base|) main_~item~0.offset (_ bv0 32)) (bvadd (_ bv4 32) main_~item~0.offset) v_DerPreprocessor_5)) c_main_~head~0.base) c_main_~head~0.offset)))) is different from false [2021-08-27 06:41:34,064 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1366 treesize of output 1334 [2021-08-27 06:41:34,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:41:34,275 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:41:34,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721881969] [2021-08-27 06:41:34,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [721881969] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 06:41:34,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:41:34,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-08-27 06:41:34,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291350151] [2021-08-27 06:41:34,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-27 06:41:34,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:41:34,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 06:41:34,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=215, Unknown=7, NotChecked=30, Total=306 [2021-08-27 06:41:34,276 INFO L87 Difference]: Start difference. First operand 157 states and 169 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 1 states have call successors, (2), 1 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:41:49,837 WARN L207 SmtUtils]: Spent 8.44 s on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2021-08-27 06:41:50,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:41:50,421 INFO L93 Difference]: Finished difference Result 257 states and 276 transitions. [2021-08-27 06:41:50,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 06:41:50,422 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 1 states have call successors, (2), 1 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:41:50,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:41:50,423 INFO L225 Difference]: With dead ends: 257 [2021-08-27 06:41:50,423 INFO L226 Difference]: Without dead ends: 257 [2021-08-27 06:41:50,423 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 24903.2ms TimeCoverageRelationStatistics Valid=174, Invalid=579, Unknown=7, NotChecked=52, Total=812 [2021-08-27 06:41:50,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-08-27 06:41:50,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 171. [2021-08-27 06:41:50,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 136 states have (on average 1.338235294117647) internal successors, (182), 167 states have internal predecessors, (182), 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:41:50,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 185 transitions. [2021-08-27 06:41:50,426 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 185 transitions. Word has length 31 [2021-08-27 06:41:50,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:41:50,427 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 185 transitions. [2021-08-27 06:41:50,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 1 states have call successors, (2), 1 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:41:50,427 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 185 transitions. [2021-08-27 06:41:50,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-27 06:41:50,427 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:41:50,427 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:41:50,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-08-27 06:41:50,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:41:50,633 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr26ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:41:50,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:41:50,633 INFO L82 PathProgramCache]: Analyzing trace with hash -931329674, now seen corresponding path program 1 times [2021-08-27 06:41:50,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:41:50,634 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47491514] [2021-08-27 06:41:50,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:41:50,634 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:41:50,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:41:50,635 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:41:50,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-08-27 06:41:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:41:50,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 06:41:50,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:41:51,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:41:51,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:41:51,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:41:51,149 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:41:51,149 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [47491514] [2021-08-27 06:41:51,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [47491514] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:41:51,149 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:41:51,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-27 06:41:51,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161248610] [2021-08-27 06:41:51,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 06:41:51,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:41:51,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 06:41:51,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:41:51,151 INFO L87 Difference]: Start difference. First operand 171 states and 185 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 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:41:51,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:41:51,183 INFO L93 Difference]: Finished difference Result 213 states and 226 transitions. [2021-08-27 06:41:51,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 06:41:51,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 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:41:51,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:41:51,193 INFO L225 Difference]: With dead ends: 213 [2021-08-27 06:41:51,193 INFO L226 Difference]: Without dead ends: 213 [2021-08-27 06:41:51,194 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 06:41:51,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-08-27 06:41:51,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 173. [2021-08-27 06:41:51,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 169 states have internal predecessors, (180), 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:41:51,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 183 transitions. [2021-08-27 06:41:51,197 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 183 transitions. Word has length 32 [2021-08-27 06:41:51,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:41:51,198 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 183 transitions. [2021-08-27 06:41:51,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 1 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:41:51,198 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 183 transitions. [2021-08-27 06:41:51,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-27 06:41:51,199 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:41:51,199 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:41:51,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-08-27 06:41:51,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:41:51,407 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr59REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:41:51,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:41:51,407 INFO L82 PathProgramCache]: Analyzing trace with hash 178014059, now seen corresponding path program 1 times [2021-08-27 06:41:51,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:41:51,407 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020340301] [2021-08-27 06:41:51,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:41:51,408 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:41:51,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:41:51,408 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:41:51,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-08-27 06:41:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:41:51,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-27 06:41:51,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:41:51,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:41:51,908 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-08-27 06:41:51,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 34 [2021-08-27 06:41:51,973 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 24 treesize of output 20 [2021-08-27 06:41:52,161 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:41:52,162 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 42 treesize of output 33 [2021-08-27 06:41:52,265 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-08-27 06:41:52,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 51 [2021-08-27 06:41:52,694 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:41:52,695 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 43 [2021-08-27 06:41:52,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:41:52,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:42:13,119 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (v_main_~item~0.offset_55 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_main_~item~0.base) c_main_~item~0.offset))) (store |c_#memory_$Pointer$.base| .cse0 (store (store (select |c_#memory_$Pointer$.base| .cse0) v_main_~item~0.offset_55 (_ bv0 32)) (bvadd (_ bv4 32) v_main_~item~0.offset_55) v_DerPreprocessor_6))) c_main_~head~0.base) c_main_~head~0.offset)))))))) (_ bv1 1)))) is different from false [2021-08-27 06:42:13,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 266 treesize of output 262 [2021-08-27 06:42:30,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:42:30,322 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:42:30,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020340301] [2021-08-27 06:42:30,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2020340301] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 06:42:30,322 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:42:30,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2021-08-27 06:42:30,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212470387] [2021-08-27 06:42:30,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-27 06:42:30,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:42:30,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-27 06:42:30,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=324, Unknown=11, NotChecked=38, Total=462 [2021-08-27 06:42:30,324 INFO L87 Difference]: Start difference. First operand 173 states and 183 transitions. Second operand has 22 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 22 states have internal predecessors, (70), 1 states have call successors, (2), 1 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:42:45,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:42:45,411 INFO L93 Difference]: Finished difference Result 218 states and 232 transitions. [2021-08-27 06:42:45,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 06:42:45,411 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 22 states have internal predecessors, (70), 1 states have call successors, (2), 1 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:42:45,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:42:45,412 INFO L225 Difference]: With dead ends: 218 [2021-08-27 06:42:45,412 INFO L226 Difference]: Without dead ends: 218 [2021-08-27 06:42:45,413 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 43439.4ms TimeCoverageRelationStatistics Valid=227, Invalid=694, Unknown=13, NotChecked=58, Total=992 [2021-08-27 06:42:45,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-08-27 06:42:45,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 183. [2021-08-27 06:42:45,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 148 states have (on average 1.304054054054054) internal successors, (193), 179 states have internal predecessors, (193), 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:42:45,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 196 transitions. [2021-08-27 06:42:45,416 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 196 transitions. Word has length 39 [2021-08-27 06:42:45,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:42:45,416 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 196 transitions. [2021-08-27 06:42:45,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 22 states have internal predecessors, (70), 1 states have call successors, (2), 1 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:42:45,417 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 196 transitions. [2021-08-27 06:42:45,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-27 06:42:45,417 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:42:45,417 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:42:45,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-08-27 06:42:45,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:42:45,624 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr60REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:42:45,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:42:45,624 INFO L82 PathProgramCache]: Analyzing trace with hash 178014060, now seen corresponding path program 1 times [2021-08-27 06:42:45,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:42:45,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993240689] [2021-08-27 06:42:45,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:42:45,625 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:42:45,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:42:45,626 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:42:45,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-08-27 06:42:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:42:46,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-27 06:42:46,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:42:46,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:42:46,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:42:46,177 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:42:46,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2021-08-27 06:42:46,219 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:42:46,229 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 21 treesize of output 17 [2021-08-27 06:42:46,406 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:42:46,406 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 36 treesize of output 27 [2021-08-27 06:42:46,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:42:46,424 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 19 treesize of output 18 [2021-08-27 06:42:46,553 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-08-27 06:42:46,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 78 [2021-08-27 06:42:46,585 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-08-27 06:42:46,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 53 [2021-08-27 06:42:47,046 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:42:47,046 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 40 [2021-08-27 06:42:47,052 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:42:47,052 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 31 treesize of output 19 [2021-08-27 06:42:47,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:42:47,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:42:58,082 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((main_~item~0.offset (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_main_#t~mem6.base| (store (store (select |c_#memory_$Pointer$.offset| |c_main_#t~mem6.base|) main_~item~0.offset (_ bv0 32)) (bvadd (_ bv4 32) main_~item~0.offset) v_DerPreprocessor_8)) c_main_~head~0.base) c_main_~head~0.offset))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (main_~item~0.offset (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv4 32) main_~item~0.offset))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_main_#t~mem6.base| (store (store (select |c_#memory_$Pointer$.offset| |c_main_#t~mem6.base|) main_~item~0.offset (_ bv0 32)) .cse1 v_DerPreprocessor_8)) c_main_~head~0.base) c_main_~head~0.offset)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_main_#t~mem6.base| (store (store (select |c_#memory_$Pointer$.base| |c_main_#t~mem6.base|) main_~item~0.offset (_ bv0 32)) .cse1 v_DerPreprocessor_7)) c_main_~head~0.base) c_main_~head~0.offset)))))) is different from false [2021-08-27 06:43:00,118 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (v_subst_1 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_main_~item~0.base) c_main_~item~0.offset)) (.cse1 (bvadd (_ bv4 32) v_subst_1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 (store (store (select |c_#memory_$Pointer$.offset| .cse0) v_subst_1 (_ bv0 32)) .cse1 v_DerPreprocessor_8)) c_main_~head~0.base) c_main_~head~0.offset) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 (store (store (select |c_#memory_$Pointer$.base| .cse0) v_subst_1 (_ bv0 32)) .cse1 v_DerPreprocessor_7)) c_main_~head~0.base) c_main_~head~0.offset))))) (forall ((v_subst_2 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse2 (select (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_main_~item~0.base) c_main_~item~0.offset))) (store |c_#memory_$Pointer$.offset| .cse3 (store (store (select |c_#memory_$Pointer$.offset| .cse3) v_subst_2 (_ bv0 32)) (bvadd (_ bv4 32) v_subst_2) v_DerPreprocessor_8))) c_main_~head~0.base) c_main_~head~0.offset))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))) is different from false [2021-08-27 06:43:00,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 394 treesize of output 378 [2021-08-27 06:43:00,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:43:00,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:43:00,674 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:43:00,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:43:00,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:43:00,681 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:43:00,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:43:00,933 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:43:00,933 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1993240689] [2021-08-27 06:43:00,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1993240689] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 06:43:00,933 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:43:00,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-08-27 06:43:00,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745750793] [2021-08-27 06:43:00,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-27 06:43:00,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:43:00,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-27 06:43:00,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=288, Unknown=3, NotChecked=70, Total=420 [2021-08-27 06:43:00,934 INFO L87 Difference]: Start difference. First operand 183 states and 196 transitions. Second operand has 21 states, 20 states have (on average 3.35) internal successors, (67), 21 states have internal predecessors, (67), 1 states have call successors, (2), 1 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:43:36,860 WARN L207 SmtUtils]: Spent 17.05 s on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2021-08-27 06:43:37,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:43:37,935 INFO L93 Difference]: Finished difference Result 288 states and 304 transitions. [2021-08-27 06:43:37,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 06:43:37,936 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.35) internal successors, (67), 21 states have internal predecessors, (67), 1 states have call successors, (2), 1 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:43:37,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:43:37,937 INFO L225 Difference]: With dead ends: 288 [2021-08-27 06:43:37,937 INFO L226 Difference]: Without dead ends: 288 [2021-08-27 06:43:37,937 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 45510.1ms TimeCoverageRelationStatistics Valid=224, Invalid=969, Unknown=5, NotChecked=134, Total=1332 [2021-08-27 06:43:37,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-08-27 06:43:37,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 187. [2021-08-27 06:43:37,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 152 states have (on average 1.2960526315789473) internal successors, (197), 183 states have internal predecessors, (197), 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:43:37,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 200 transitions. [2021-08-27 06:43:37,940 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 200 transitions. Word has length 39 [2021-08-27 06:43:37,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:43:37,941 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 200 transitions. [2021-08-27 06:43:37,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.35) internal successors, (67), 21 states have internal predecessors, (67), 1 states have call successors, (2), 1 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:43:37,941 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 200 transitions. [2021-08-27 06:43:37,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-08-27 06:43:37,941 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:43:37,941 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:43:37,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2021-08-27 06:43:38,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:43:38,149 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr61ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:43:38,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:43:38,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1067412346, now seen corresponding path program 1 times [2021-08-27 06:43:38,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:43:38,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [409256746] [2021-08-27 06:43:38,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:43:38,150 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:43:38,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:43:38,151 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:43:38,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-08-27 06:43:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:43:38,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 24 conjunts are in the unsatisfiable core [2021-08-27 06:43:38,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:43:38,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:43:38,767 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:43:38,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2021-08-27 06:43:38,818 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:43:38,824 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 16 treesize of output 12 [2021-08-27 06:43:38,994 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:43:38,995 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 26 treesize of output 21 [2021-08-27 06:43:39,026 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-08-27 06:43:39,026 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 27 treesize of output 22 [2021-08-27 06:43:39,142 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-08-27 06:43:39,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 76 [2021-08-27 06:43:39,147 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 84 treesize of output 76 [2021-08-27 06:43:39,155 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:43:39,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 55 [2021-08-27 06:43:39,742 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-08-27 06:43:39,742 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 42 [2021-08-27 06:43:39,748 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-08-27 06:43:39,748 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 33 treesize of output 21 [2021-08-27 06:43:39,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-08-27 06:43:39,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:43:39,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:43:40,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 85 [2021-08-27 06:43:41,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 161 [2021-08-27 06:43:41,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 161 [2021-08-27 06:43:47,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:43:47,222 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:43:47,222 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [409256746] [2021-08-27 06:43:47,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [409256746] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 06:43:47,222 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:43:47,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2021-08-27 06:43:47,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084935088] [2021-08-27 06:43:47,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-27 06:43:47,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:43:47,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-27 06:43:47,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=534, Unknown=2, NotChecked=0, Total=600 [2021-08-27 06:43:47,223 INFO L87 Difference]: Start difference. First operand 187 states and 200 transitions. Second operand has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 1 states have call successors, (2), 1 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:43:52,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:43:52,092 INFO L93 Difference]: Finished difference Result 286 states and 304 transitions. [2021-08-27 06:43:52,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-08-27 06:43:52,093 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 1 states have call successors, (2), 1 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:43:52,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:43:52,093 INFO L225 Difference]: With dead ends: 286 [2021-08-27 06:43:52,093 INFO L226 Difference]: Without dead ends: 286 [2021-08-27 06:43:52,094 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 7974.1ms TimeCoverageRelationStatistics Valid=277, Invalid=1613, Unknown=2, NotChecked=0, Total=1892 [2021-08-27 06:43:52,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2021-08-27 06:43:52,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 186. [2021-08-27 06:43:52,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 151 states have (on average 1.2913907284768211) internal successors, (195), 182 states have internal predecessors, (195), 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:43:52,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 198 transitions. [2021-08-27 06:43:52,097 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 198 transitions. Word has length 42 [2021-08-27 06:43:52,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:43:52,097 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 198 transitions. [2021-08-27 06:43:52,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 1 states have call successors, (2), 1 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:43:52,097 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 198 transitions. [2021-08-27 06:43:52,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-27 06:43:52,097 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:43:52,097 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] [2021-08-27 06:43:52,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-08-27 06:43:52,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:43:52,298 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr64REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:43:52,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:43:52,298 INFO L82 PathProgramCache]: Analyzing trace with hash -259639262, now seen corresponding path program 1 times [2021-08-27 06:43:52,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:43:52,298 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [221500003] [2021-08-27 06:43:52,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:43:52,299 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:43:52,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:43:52,299 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:43:52,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-08-27 06:43:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:43:52,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 06:43:52,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:43:52,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:43:52,988 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-08-27 06:43:52,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 31 [2021-08-27 06:43:53,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2021-08-27 06:43:53,280 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:43:53,280 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 41 treesize of output 32 [2021-08-27 06:43:53,409 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-08-27 06:43:53,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 50 [2021-08-27 06:43:54,058 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:43:54,058 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 24 [2021-08-27 06:43:54,211 INFO L354 Elim1Store]: treesize reduction 20, result has 28.6 percent of original size [2021-08-27 06:43:54,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 56 [2021-08-27 06:43:54,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:43:54,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:44:27,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1498 treesize of output 1482 [2021-08-27 06:44:32,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:44:32,006 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:44:32,007 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [221500003] [2021-08-27 06:44:32,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [221500003] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 06:44:32,007 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:44:32,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2021-08-27 06:44:32,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892737988] [2021-08-27 06:44:32,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-08-27 06:44:32,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:44:32,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-08-27 06:44:32,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=452, Unknown=10, NotChecked=0, Total=552 [2021-08-27 06:44:32,008 INFO L87 Difference]: Start difference. First operand 186 states and 198 transitions. Second operand has 24 states, 23 states have (on average 3.347826086956522) internal successors, (77), 24 states have internal predecessors, (77), 1 states have call successors, (2), 1 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:45:22,492 WARN L207 SmtUtils]: Spent 6.08 s on a formula simplification. DAG size of input: 127 DAG size of output: 70 [2021-08-27 06:45:25,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:45:25,513 INFO L93 Difference]: Finished difference Result 222 states and 237 transitions. [2021-08-27 06:45:25,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 06:45:25,514 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.347826086956522) internal successors, (77), 24 states have internal predecessors, (77), 1 states have call successors, (2), 1 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 44 [2021-08-27 06:45:25,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:45:25,514 INFO L225 Difference]: With dead ends: 222 [2021-08-27 06:45:25,514 INFO L226 Difference]: Without dead ends: 222 [2021-08-27 06:45:25,515 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 58 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 49980.8ms TimeCoverageRelationStatistics Valid=178, Invalid=801, Unknown=13, NotChecked=0, Total=992 [2021-08-27 06:45:25,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-08-27 06:45:25,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 206. [2021-08-27 06:45:25,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 171 states have (on average 1.3157894736842106) internal successors, (225), 202 states have internal predecessors, (225), 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:45:25,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 228 transitions. [2021-08-27 06:45:25,518 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 228 transitions. Word has length 44 [2021-08-27 06:45:25,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:45:25,518 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 228 transitions. [2021-08-27 06:45:25,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.347826086956522) internal successors, (77), 24 states have internal predecessors, (77), 1 states have call successors, (2), 1 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:45:25,519 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 228 transitions. [2021-08-27 06:45:25,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-27 06:45:25,519 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:45:25,519 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] [2021-08-27 06:45:25,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-08-27 06:45:25,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:45:25,730 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr65REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:45:25,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:45:25,730 INFO L82 PathProgramCache]: Analyzing trace with hash -259639261, now seen corresponding path program 1 times [2021-08-27 06:45:25,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:45:25,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152701503] [2021-08-27 06:45:25,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:45:25,730 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:45:25,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:45:25,731 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:45:25,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-08-27 06:45:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:45:26,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-27 06:45:26,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:45:26,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:45:26,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:45:26,516 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:45:26,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2021-08-27 06:45:26,568 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:45:26,582 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 21 treesize of output 17 [2021-08-27 06:45:26,805 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:45:26,805 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 19 treesize of output 18 [2021-08-27 06:45:26,835 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:45:26,835 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 36 treesize of output 27 [2021-08-27 06:45:26,980 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-08-27 06:45:26,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 78 [2021-08-27 06:45:27,015 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-08-27 06:45:27,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 53 [2021-08-27 06:45:27,618 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:45:27,619 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 40 [2021-08-27 06:45:27,624 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:45:27,624 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 31 treesize of output 19 [2021-08-27 06:45:27,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:45:27,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:45:30,845 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((main_~item~0.offset (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| c_main_~item~0.base (store (store (select |c_#memory_$Pointer$.offset| c_main_~item~0.base) main_~item~0.offset (_ bv0 32)) (bvadd (_ bv4 32) main_~item~0.offset) v_DerPreprocessor_13)) c_main_~head~0.base) c_main_~head~0.offset))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((main_~item~0.offset (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv4 32) main_~item~0.offset))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| c_main_~item~0.base (store (store (select |c_#memory_$Pointer$.offset| c_main_~item~0.base) main_~item~0.offset (_ bv0 32)) .cse1 v_DerPreprocessor_13)) c_main_~head~0.base) c_main_~head~0.offset)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_main_~item~0.base (store (store (select |c_#memory_$Pointer$.base| c_main_~item~0.base) main_~item~0.offset (_ bv0 32)) .cse1 v_DerPreprocessor_12)) c_main_~head~0.base) c_main_~head~0.offset)))))) is different from false [2021-08-27 06:46:02,251 WARN L207 SmtUtils]: Spent 6.12 s on a formula simplification that was a NOOP. DAG size: 42 [2021-08-27 06:46:02,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 370 treesize of output 354 [2021-08-27 06:46:02,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:46:02,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:46:02,850 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:46:02,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:46:02,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 06:46:02,857 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 06:46:03,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:46:03,090 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:46:03,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152701503] [2021-08-27 06:46:03,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152701503] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 06:46:03,091 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:46:03,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-08-27 06:46:03,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766951771] [2021-08-27 06:46:03,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-27 06:46:03,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:46:03,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-27 06:46:03,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=316, Unknown=8, NotChecked=36, Total=420 [2021-08-27 06:46:03,092 INFO L87 Difference]: Start difference. First operand 206 states and 228 transitions. Second operand has 21 states, 20 states have (on average 3.85) internal successors, (77), 21 states have internal predecessors, (77), 1 states have call successors, (2), 1 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:46:50,632 WARN L207 SmtUtils]: Spent 41.99 s on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2021-08-27 06:46:57,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:46:57,601 INFO L93 Difference]: Finished difference Result 221 states and 236 transitions. [2021-08-27 06:46:57,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 06:46:57,603 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.85) internal successors, (77), 21 states have internal predecessors, (77), 1 states have call successors, (2), 1 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 44 [2021-08-27 06:46:57,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:46:57,603 INFO L225 Difference]: With dead ends: 221 [2021-08-27 06:46:57,603 INFO L226 Difference]: Without dead ends: 221 [2021-08-27 06:46:57,604 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 82007.9ms TimeCoverageRelationStatistics Valid=259, Invalid=927, Unknown=8, NotChecked=66, Total=1260 [2021-08-27 06:46:57,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-08-27 06:46:57,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 206. [2021-08-27 06:46:57,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 171 states have (on average 1.3099415204678362) internal successors, (224), 202 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:46:57,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 227 transitions. [2021-08-27 06:46:57,607 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 227 transitions. Word has length 44 [2021-08-27 06:46:57,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:46:57,607 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 227 transitions. [2021-08-27 06:46:57,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.85) internal successors, (77), 21 states have internal predecessors, (77), 1 states have call successors, (2), 1 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:46:57,607 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 227 transitions. [2021-08-27 06:46:57,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-27 06:46:57,608 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:46:57,608 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:46:57,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-08-27 06:46:57,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:46:57,816 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr69ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:46:57,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:46:57,817 INFO L82 PathProgramCache]: Analyzing trace with hash 541116366, now seen corresponding path program 1 times [2021-08-27 06:46:57,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:46:57,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036475481] [2021-08-27 06:46:57,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:46:57,817 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:46:57,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:46:57,818 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:46:57,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-08-27 06:46:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:46:58,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 06:46:58,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:46:58,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-08-27 06:46:58,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-08-27 06:46:58,790 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:46:58,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:46:59,000 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:46:59,000 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:46:59,000 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036475481] [2021-08-27 06:46:59,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036475481] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 06:46:59,000 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:46:59,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-08-27 06:46:59,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56746657] [2021-08-27 06:46:59,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 06:46:59,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:46:59,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 06:46:59,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:46:59,001 INFO L87 Difference]: Start difference. First operand 206 states and 227 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (2), 1 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:46:59,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:46:59,418 INFO L93 Difference]: Finished difference Result 233 states and 256 transitions. [2021-08-27 06:46:59,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:46:59,420 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (2), 1 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:46:59,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:46:59,421 INFO L225 Difference]: With dead ends: 233 [2021-08-27 06:46:59,421 INFO L226 Difference]: Without dead ends: 233 [2021-08-27 06:46:59,422 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 142.7ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-08-27 06:46:59,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-08-27 06:46:59,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 227. [2021-08-27 06:46:59,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 192 states have (on average 1.3125) internal successors, (252), 223 states have internal predecessors, (252), 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:46:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 255 transitions. [2021-08-27 06:46:59,425 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 255 transitions. Word has length 45 [2021-08-27 06:46:59,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:46:59,425 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 255 transitions. [2021-08-27 06:46:59,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (2), 1 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:46:59,425 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 255 transitions. [2021-08-27 06:46:59,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-27 06:46:59,426 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:46:59,426 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:46:59,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-08-27 06:46:59,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:46:59,639 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr66ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:46:59,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:46:59,639 INFO L82 PathProgramCache]: Analyzing trace with hash -405214686, now seen corresponding path program 1 times [2021-08-27 06:46:59,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:46:59,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321610133] [2021-08-27 06:46:59,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:46:59,640 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:46:59,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:46:59,641 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:46:59,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-08-27 06:47:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:47:00,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 06:47:00,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:47:00,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:47:00,498 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:47:00,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-08-27 06:47:00,542 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:47:00,551 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 16 treesize of output 12 [2021-08-27 06:47:00,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-08-27 06:47:00,680 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 19 treesize of output 18 [2021-08-27 06:47:00,770 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-08-27 06:47:00,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 25 [2021-08-27 06:47:01,244 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 06:47:01,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 26 treesize of output 14 [2021-08-27 06:47:01,363 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:47:01,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:47:34,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 338 treesize of output 330 [2021-08-27 06:47:35,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:47:35,520 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:47:35,520 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321610133] [2021-08-27 06:47:35,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321610133] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 06:47:35,520 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 06:47:35,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2021-08-27 06:47:35,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941132187] [2021-08-27 06:47:35,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 06:47:35,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:47:35,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 06:47:35,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=273, Unknown=13, NotChecked=0, Total=342 [2021-08-27 06:47:35,522 INFO L87 Difference]: Start difference. First operand 227 states and 255 transitions. Second operand has 19 states, 18 states have (on average 4.055555555555555) internal successors, (73), 19 states have internal predecessors, (73), 1 states have call successors, (2), 1 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:49:58,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:49:58,888 INFO L93 Difference]: Finished difference Result 340 states and 370 transitions. [2021-08-27 06:49:58,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-27 06:49:58,888 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.055555555555555) internal successors, (73), 19 states have internal predecessors, (73), 1 states have call successors, (2), 1 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:49:58,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:49:58,889 INFO L225 Difference]: With dead ends: 340 [2021-08-27 06:49:58,889 INFO L226 Difference]: Without dead ends: 340 [2021-08-27 06:49:58,890 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 42835.9ms TimeCoverageRelationStatistics Valid=307, Invalid=1083, Unknown=16, NotChecked=0, Total=1406 [2021-08-27 06:49:58,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-08-27 06:49:58,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 299. [2021-08-27 06:49:58,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 264 states have (on average 1.356060606060606) 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:49:58,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 361 transitions. [2021-08-27 06:49:58,894 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 361 transitions. Word has length 46 [2021-08-27 06:49:58,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:49:58,894 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 361 transitions. [2021-08-27 06:49:58,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.055555555555555) internal successors, (73), 19 states have internal predecessors, (73), 1 states have call successors, (2), 1 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:49:58,894 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 361 transitions. [2021-08-27 06:49:58,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-27 06:49:58,894 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:49:58,895 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:49:58,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-08-27 06:49:59,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:49:59,104 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr59REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:49:59,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:49:59,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1644332691, now seen corresponding path program 1 times [2021-08-27 06:49:59,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:49:59,104 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [870557981] [2021-08-27 06:49:59,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:49:59,105 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:49:59,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:49:59,106 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:49:59,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-08-27 06:49:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:49:59,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 06:49:59,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:50:00,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:50:00,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 06:50:00,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 06:50:00,164 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:50:00,164 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [870557981] [2021-08-27 06:50:00,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [870557981] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 06:50:00,164 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:50:00,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-08-27 06:50:00,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84670066] [2021-08-27 06:50:00,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 06:50:00,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 06:50:00,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 06:50:00,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-27 06:50:00,165 INFO L87 Difference]: Start difference. First operand 299 states and 361 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (2), 1 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:50:00,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 06:50:00,235 INFO L93 Difference]: Finished difference Result 261 states and 300 transitions. [2021-08-27 06:50:00,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 06:50:00,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (2), 1 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:50:00,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 06:50:00,237 INFO L225 Difference]: With dead ends: 261 [2021-08-27 06:50:00,237 INFO L226 Difference]: Without dead ends: 261 [2021-08-27 06:50:00,237 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 29.6ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-08-27 06:50:00,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-08-27 06:50:00,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 240. [2021-08-27 06:50:00,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 207 states have (on average 1.3526570048309179) internal successors, (280), 236 states have internal predecessors, (280), 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:50:00,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 283 transitions. [2021-08-27 06:50:00,240 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 283 transitions. Word has length 46 [2021-08-27 06:50:00,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 06:50:00,241 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 283 transitions. [2021-08-27 06:50:00,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (2), 1 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:50:00,241 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 283 transitions. [2021-08-27 06:50:00,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-27 06:50:00,241 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 06:50:00,241 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 06:50:00,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-08-27 06:50:00,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:50:00,448 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr26ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 06:50:00,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 06:50:00,448 INFO L82 PathProgramCache]: Analyzing trace with hash -2020163193, now seen corresponding path program 1 times [2021-08-27 06:50:00,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 06:50:00,448 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085538173] [2021-08-27 06:50:00,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:50:00,449 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 06:50:00,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 06:50:00,450 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-27 06:50:00,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-08-27 06:50:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:50:01,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-27 06:50:01,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:50:01,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:50:01,430 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:50:01,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2021-08-27 06:50:01,487 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 20 treesize of output 16 [2021-08-27 06:50:01,660 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:50:01,661 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 35 treesize of output 26 [2021-08-27 06:50:01,751 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-08-27 06:50:01,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2021-08-27 06:50:01,917 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:50:01,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2021-08-27 06:50:02,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2021-08-27 06:50:02,337 INFO L354 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2021-08-27 06:50:02,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 48 [2021-08-27 06:50:02,536 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 06:50:02,537 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085538173] [2021-08-27 06:50:02,537 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 06:50:02,537 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [7965124] [2021-08-27 06:50:02,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:50:02,537 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-08-27 06:50:02,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-08-27 06:50:02,539 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-08-27 06:50:02,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2021-08-27 06:50:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:50:03,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-27 06:50:03,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:50:03,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-08-27 06:50:03,699 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:50:03,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2021-08-27 06:50:03,761 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 20 treesize of output 16 [2021-08-27 06:50:04,034 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:50:04,035 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 35 treesize of output 26 [2021-08-27 06:50:04,212 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-08-27 06:50:04,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 29 [2021-08-27 06:50:04,454 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:50:04,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2021-08-27 06:50:04,576 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-08-27 06:50:04,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 33 [2021-08-27 06:50:04,950 INFO L354 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2021-08-27 06:50:04,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 48 [2021-08-27 06:50:05,180 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 06:50:05,181 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464469552] [2021-08-27 06:50:05,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 06:50:05,181 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 06:50:05,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 06:50:05,182 INFO L229 MonitoredProcess]: Starting monitored process 28 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:50:05,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-08-27 06:50:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 06:50:06,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-27 06:50:06,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 06:50:06,333 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:50:06,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2021-08-27 06:50:06,376 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 20 treesize of output 16 [2021-08-27 06:50:06,563 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 06:50:06,563 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 35 treesize of output 26 [2021-08-27 06:50:06,677 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-08-27 06:50:06,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2021-08-27 06:50:06,887 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 06:50:06,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2021-08-27 06:50:06,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2021-08-27 06:50:07,102 INFO L354 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2021-08-27 06:50:07,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 48 [2021-08-27 06:50:07,238 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 06:50:07,238 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-08-27 06:50:07,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-08-27 06:50:07,238 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-08-27 06:50:07,238 INFO L626 BasicCegarLoop]: Counterexample might be feasible [2021-08-27 06:50:07,247 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:50:07,249 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-08-27 06:50:07,249 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-08-27 06:50:07,249 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-08-27 06:50:07,249 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-08-27 06:50:07,249 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-08-27 06:50:07,249 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-08-27 06:50:07,249 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-08-27 06:50:07,250 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-08-27 06:50:07,250 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-08-27 06:50:07,250 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-08-27 06:50:07,250 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-08-27 06:50:07,250 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-08-27 06:50:07,250 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-08-27 06:50:07,250 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-08-27 06:50:07,250 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-08-27 06:50:07,251 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-08-27 06:50:07,251 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:50:07,251 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:50:07,251 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:50:07,251 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:50:07,251 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-08-27 06:50:07,251 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION [2021-08-27 06:50:07,251 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:50:07,252 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:50:07,252 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-08-27 06:50:07,252 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-08-27 06:50:07,252 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27REQUIRES_VIOLATION [2021-08-27 06:50:07,252 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-08-27 06:50:07,252 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-08-27 06:50:07,252 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION [2021-08-27 06:50:07,252 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:50:07,253 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:50:07,253 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION [2021-08-27 06:50:07,253 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION [2021-08-27 06:50:07,253 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:50:07,253 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION [2021-08-27 06:50:07,253 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-08-27 06:50:07,253 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-08-27 06:50:07,253 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION [2021-08-27 06:50:07,253 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:50:07,254 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41REQUIRES_VIOLATION [2021-08-27 06:50:07,254 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42REQUIRES_VIOLATION [2021-08-27 06:50:07,254 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43REQUIRES_VIOLATION [2021-08-27 06:50:07,254 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr44REQUIRES_VIOLATION [2021-08-27 06:50:07,254 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45REQUIRES_VIOLATION [2021-08-27 06:50:07,254 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr46REQUIRES_VIOLATION [2021-08-27 06:50:07,254 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr47ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:50:07,254 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr48REQUIRES_VIOLATION [2021-08-27 06:50:07,255 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr49REQUIRES_VIOLATION [2021-08-27 06:50:07,255 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr50REQUIRES_VIOLATION [2021-08-27 06:50:07,255 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr51REQUIRES_VIOLATION [2021-08-27 06:50:07,255 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr52REQUIRES_VIOLATION [2021-08-27 06:50:07,255 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr53REQUIRES_VIOLATION [2021-08-27 06:50:07,255 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr54REQUIRES_VIOLATION [2021-08-27 06:50:07,255 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr55REQUIRES_VIOLATION [2021-08-27 06:50:07,255 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr56ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:50:07,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr57REQUIRES_VIOLATION [2021-08-27 06:50:07,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr58REQUIRES_VIOLATION [2021-08-27 06:50:07,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr59REQUIRES_VIOLATION [2021-08-27 06:50:07,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr60REQUIRES_VIOLATION [2021-08-27 06:50:07,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr61ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 06:50:07,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr62REQUIRES_VIOLATION [2021-08-27 06:50:07,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr63REQUIRES_VIOLATION [2021-08-27 06:50:07,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr64REQUIRES_VIOLATION [2021-08-27 06:50:07,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr65REQUIRES_VIOLATION [2021-08-27 06:50:07,257 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr66ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:50:07,257 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr67ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:50:07,257 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr68ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 06:50:07,257 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr69ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 06:50:07,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2021-08-27 06:50:07,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2021-08-27 06:50:07,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2021-08-27 06:50:07,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-27 06:50:07,866 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 06:50:07,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 06:50:07 BoogieIcfgContainer [2021-08-27 06:50:07,873 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 06:50:07,874 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 06:50:07,874 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 06:50:07,874 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 06:50:07,874 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:40:56" (3/4) ... [2021-08-27 06:50:07,876 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 06:50:07,876 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 06:50:07,878 INFO L168 Benchmark]: Toolchain (without parser) took 552251.72 ms. Allocated memory was 60.8 MB in the beginning and 157.3 MB in the end (delta: 96.5 MB). Free memory was 39.4 MB in the beginning and 40.3 MB in the end (delta: -870.9 kB). Peak memory consumption was 96.5 MB. Max. memory is 16.1 GB. [2021-08-27 06:50:07,878 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 60.8 MB. Free memory was 42.4 MB in the beginning and 42.4 MB in the end (delta: 44.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:50:07,878 INFO L168 Benchmark]: CACSL2BoogieTranslator took 394.51 ms. Allocated memory is still 60.8 MB. Free memory was 39.1 MB in the beginning and 33.0 MB in the end (delta: 6.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 06:50:07,879 INFO L168 Benchmark]: Boogie Preprocessor took 69.31 ms. Allocated memory is still 60.8 MB. Free memory was 33.0 MB in the beginning and 29.4 MB in the end (delta: 3.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 06:50:07,879 INFO L168 Benchmark]: RCFGBuilder took 743.46 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 29.4 MB in the beginning and 33.0 MB in the end (delta: -3.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-08-27 06:50:07,880 INFO L168 Benchmark]: TraceAbstraction took 551036.98 ms. Allocated memory was 73.4 MB in the beginning and 157.3 MB in the end (delta: 83.9 MB). Free memory was 32.2 MB in the beginning and 40.3 MB in the end (delta: -8.1 MB). Peak memory consumption was 76.6 MB. Max. memory is 16.1 GB. [2021-08-27 06:50:07,880 INFO L168 Benchmark]: Witness Printer took 2.46 ms. Allocated memory is still 157.3 MB. Free memory is still 40.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 06:50:07,882 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.15 ms. Allocated memory is still 60.8 MB. Free memory was 42.4 MB in the beginning and 42.4 MB in the end (delta: 44.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 394.51 ms. Allocated memory is still 60.8 MB. Free memory was 39.1 MB in the beginning and 33.0 MB in the end (delta: 6.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 69.31 ms. Allocated memory is still 60.8 MB. Free memory was 33.0 MB in the beginning and 29.4 MB in the end (delta: 3.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 743.46 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 29.4 MB in the beginning and 33.0 MB in the end (delta: -3.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 551036.98 ms. Allocated memory was 73.4 MB in the beginning and 157.3 MB in the end (delta: 83.9 MB). Free memory was 32.2 MB in the beginning and 40.3 MB in the end (delta: -8.1 MB). Peak memory consumption was 76.6 MB. Max. memory is 16.1 GB. * Witness Printer took 2.46 ms. Allocated memory is still 157.3 MB. Free memory is still 40.3 MB. There was no memory consumed. 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 - UnprovableResult [Line: 1037]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: unable to decide satisfiability of path constraint, overapproximation of memtrack at line 1037. Possible FailurePath: [L996] SLL* head = malloc(sizeof(SLL)); [L997] head->next = ((void*)0) [L998] head->data = 0 [L999] SLL* item = head; [L1000] int status = 0; [L1002] COND TRUE __VERIFIER_nondet_int() [L1004] item->next = malloc(sizeof(SLL)) [L1005] EXPR item->next [L1005] item = item->next [L1006] item->next = ((void*)0) [L1008] COND TRUE !status [L1010] item->data = 1 [L1011] status = 1 [L1024] COND FALSE !(!(head != ((void*)0))) [L1025] COND FALSE !(!(item != ((void*)0))) [L1002] COND TRUE __VERIFIER_nondet_int() [L1004] item->next = malloc(sizeof(SLL)) [L1005] EXPR item->next [L1005] item = item->next [L1006] item->next = ((void*)0) [L1008] COND FALSE !(!status) [L1013] COND TRUE status == 1 [L1015] item->data = 2 [L1016] status = 2 [L1024] COND FALSE !(!(head != ((void*)0))) [L1025] COND FALSE !(!(item != ((void*)0))) [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1028] COND FALSE !(!(head != ((void*)0))) [L1029] COND FALSE !(status == 1) [L1034] COND TRUE status == 2 [L1036] COND FALSE !(!(head != ((void*)0))) [L1037] EXPR head->next [L1037] COND TRUE !(head->next != ((void*)0)) [L1037] reach_error() - UnprovableResult [Line: 997]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 997]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: 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: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1025]: 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 all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: 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 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: 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: 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: 1038]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: 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: 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: 1044]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1053]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1053]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1053]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1054]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 993]: 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 5 procedures, 182 locations, 70 error locations. Started 1 CEGAR loops. OverallTime: 550991.5ms, OverallIterations: 25, TraceHistogramMax: 2, EmptinessCheckTime: 29.7ms, AutomataDifference: 331078.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 11.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2714 SDtfs, 6555 SDslu, 10310 SDs, 0 SdLazy, 7819 SolverSat, 489 SolverUnsat, 90 SolverUnknown, 0 SolverNotchecked, 202356.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1402 GetRequests, 1030 SyntacticMatches, 43 SemanticMatches, 329 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 1564 ImplicationChecksByTransitivity, 301830.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=299occurred in iteration=23, InterpolantAutomatonStates: 245, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 114.2ms AutomataMinimizationTime, 24 MinimizatonAttempts, 824 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 181.7ms SsaConstructionTime, 883.8ms SatisfiabilityAnalysisTime, 199457.0ms InterpolantComputationTime, 646 NumberOfCodeBlocks, 646 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1244 ConstructedInterpolants, 217 QuantifiedInterpolants, 18023 SizeOfPredicates, 126 NumberOfNonLiveVariables, 2765 ConjunctsInSsa, 203 ConjunctsInUnsatCore, 48 InterpolantComputations, 28 PerfectInterpolantSequences, 14/50 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 could not prove your program: unable to determine feasibility of some traces [2021-08-27 06:50:07,968 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...