./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/sll-queue-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 14d581c6353338cffdb717aca448574ebb528294 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 14d581c6353338cffdb717aca448574ebb528294 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 04:26:21,684 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 04:26:21,687 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 04:26:21,712 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 04:26:21,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 04:26:21,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 04:26:21,719 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 04:26:21,723 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 04:26:21,727 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 04:26:21,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 04:26:21,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 04:26:21,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 04:26:21,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 04:26:21,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 04:26:21,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 04:26:21,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 04:26:21,739 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 04:26:21,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 04:26:21,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 04:26:21,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 04:26:21,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 04:26:21,750 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 04:26:21,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 04:26:21,752 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 04:26:21,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 04:26:21,758 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 04:26:21,759 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 04:26:21,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 04:26:21,760 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 04:26:21,761 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 04:26:21,761 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 04:26:21,762 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 04:26:21,763 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 04:26:21,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 04:26:21,764 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 04:26:21,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 04:26:21,765 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 04:26:21,765 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 04:26:21,765 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 04:26:21,766 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 04:26:21,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 04:26:21,773 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-08-27 04:26:21,798 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 04:26:21,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 04:26:21,799 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 04:26:21,799 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 04:26:21,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 04:26:21,801 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 04:26:21,801 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 04:26:21,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 04:26:21,802 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 04:26:21,802 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 04:26:21,802 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 04:26:21,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 04:26:21,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 04:26:21,803 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 04:26:21,803 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 04:26:21,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 04:26:21,803 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 04:26:21,804 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 04:26:21,804 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 04:26:21,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 04:26:21,804 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 04:26:21,804 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 04:26:21,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 04:26:21,804 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 04:26:21,805 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 04:26:21,805 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 04:26:21,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 04:26:21,805 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 04:26:21,805 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-memcleanup) ) 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 -> 14d581c6353338cffdb717aca448574ebb528294 [2021-08-27 04:26:22,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 04:26:22,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 04:26:22,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 04:26:22,071 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 04:26:22,071 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 04:26:22,072 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-queue-2.i [2021-08-27 04:26:22,130 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b31d8b22c/91e1d5b015a341bea567eddbf573d029/FLAGa6c59da23 [2021-08-27 04:26:22,541 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 04:26:22,542 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i [2021-08-27 04:26:22,550 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b31d8b22c/91e1d5b015a341bea567eddbf573d029/FLAGa6c59da23 [2021-08-27 04:26:22,558 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b31d8b22c/91e1d5b015a341bea567eddbf573d029 [2021-08-27 04:26:22,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 04:26:22,561 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 04:26:22,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 04:26:22,562 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 04:26:22,564 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 04:26:22,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:26:22" (1/1) ... [2021-08-27 04:26:22,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d714334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:22, skipping insertion in model container [2021-08-27 04:26:22,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:26:22" (1/1) ... [2021-08-27 04:26:22,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 04:26:22,588 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 04:26:22,781 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-2.i[22387,22400] [2021-08-27 04:26:22,783 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-2.i[22458,22471] [2021-08-27 04:26:22,784 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-2.i[22532,22545] [2021-08-27 04:26:22,785 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-2.i[22624,22637] [2021-08-27 04:26:22,786 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-2.i[22701,22714] [2021-08-27 04:26:22,787 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-2.i[22796,22809] [2021-08-27 04:26:22,788 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-2.i[22873,22886] [2021-08-27 04:26:22,789 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-2.i[22956,22969] [2021-08-27 04:26:22,790 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-2.i[23051,23064] [2021-08-27 04:26:22,791 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-2.i[23128,23141] [2021-08-27 04:26:22,792 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-2.i[23211,23224] [2021-08-27 04:26:22,794 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-2.i[23300,23313] [2021-08-27 04:26:22,794 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-2.i[23386,23399] [2021-08-27 04:26:22,796 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-2.i[23532,23545] [2021-08-27 04:26:22,803 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 04:26:22,811 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 04:26:22,843 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-2.i[22387,22400] [2021-08-27 04:26:22,844 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-2.i[22458,22471] [2021-08-27 04:26:22,845 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-2.i[22532,22545] [2021-08-27 04:26:22,845 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-2.i[22624,22637] [2021-08-27 04:26:22,846 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-2.i[22701,22714] [2021-08-27 04:26:22,846 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-2.i[22796,22809] [2021-08-27 04:26:22,846 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-2.i[22873,22886] [2021-08-27 04:26:22,847 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-2.i[22956,22969] [2021-08-27 04:26:22,848 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-2.i[23051,23064] [2021-08-27 04:26:22,848 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-2.i[23128,23141] [2021-08-27 04:26:22,848 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-2.i[23211,23224] [2021-08-27 04:26:22,849 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-2.i[23300,23313] [2021-08-27 04:26:22,850 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-2.i[23386,23399] [2021-08-27 04:26:22,850 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-2.i[23532,23545] [2021-08-27 04:26:22,852 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 04:26:22,868 INFO L208 MainTranslator]: Completed translation [2021-08-27 04:26:22,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:22 WrapperNode [2021-08-27 04:26:22,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 04:26:22,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 04:26:22,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 04:26:22,870 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 04:26:22,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:22" (1/1) ... [2021-08-27 04:26:22,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:22" (1/1) ... [2021-08-27 04:26:22,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:22" (1/1) ... [2021-08-27 04:26:22,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:22" (1/1) ... [2021-08-27 04:26:22,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:22" (1/1) ... [2021-08-27 04:26:22,910 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:22" (1/1) ... [2021-08-27 04:26:22,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:22" (1/1) ... [2021-08-27 04:26:22,929 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 04:26:22,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 04:26:22,930 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 04:26:22,930 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 04:26:22,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:22" (1/1) ... [2021-08-27 04:26:22,943 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 04:26:22,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:22,968 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 04:26:22,999 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 04:26:23,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 04:26:23,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 04:26:23,012 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 04:26:23,012 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 04:26:23,012 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 04:26:23,012 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 04:26:23,013 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 04:26:23,013 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 04:26:23,013 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 04:26:23,013 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 04:26:23,013 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 04:26:23,014 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 04:26:23,014 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 04:26:23,014 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 04:26:23,014 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 04:26:23,014 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 04:26:23,014 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 04:26:23,014 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 04:26:23,014 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 04:26:23,014 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 04:26:23,015 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 04:26:23,015 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 04:26:23,015 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 04:26:23,016 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 04:26:23,016 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 04:26:23,016 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 04:26:23,016 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 04:26:23,016 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 04:26:23,016 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 04:26:23,017 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 04:26:23,017 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 04:26:23,017 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 04:26:23,017 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 04:26:23,017 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 04:26:23,017 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 04:26:23,017 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 04:26:23,017 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 04:26:23,018 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 04:26:23,018 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 04:26:23,018 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 04:26:23,018 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 04:26:23,019 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 04:26:23,019 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 04:26:23,019 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 04:26:23,020 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 04:26:23,020 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 04:26:23,020 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 04:26:23,020 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 04:26:23,020 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 04:26:23,020 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 04:26:23,020 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 04:26:23,021 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 04:26:23,021 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 04:26:23,021 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 04:26:23,021 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 04:26:23,022 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 04:26:23,022 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 04:26:23,022 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 04:26:23,022 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 04:26:23,022 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 04:26:23,022 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 04:26:23,022 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 04:26:23,022 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 04:26:23,022 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 04:26:23,023 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 04:26:23,023 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 04:26:23,023 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 04:26:23,023 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 04:26:23,023 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 04:26:23,023 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 04:26:23,023 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 04:26:23,023 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 04:26:23,023 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 04:26:23,023 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 04:26:23,024 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 04:26:23,024 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 04:26:23,024 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 04:26:23,024 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 04:26:23,024 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 04:26:23,024 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 04:26:23,024 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 04:26:23,024 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 04:26:23,025 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 04:26:23,025 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 04:26:23,025 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 04:26:23,025 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 04:26:23,025 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 04:26:23,025 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 04:26:23,026 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 04:26:23,026 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 04:26:23,026 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 04:26:23,026 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 04:26:23,026 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 04:26:23,026 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 04:26:23,027 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 04:26:23,027 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 04:26:23,027 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 04:26:23,027 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 04:26:23,027 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 04:26:23,027 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 04:26:23,027 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 04:26:23,028 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 04:26:23,028 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 04:26:23,030 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 04:26:23,030 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 04:26:23,030 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 04:26:23,030 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 04:26:23,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 04:26:23,031 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 04:26:23,031 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 04:26:23,031 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 04:26:23,031 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 04:26:23,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 04:26:23,035 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 04:26:23,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 04:26:23,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 04:26:23,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 04:26:23,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 04:26:23,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 04:26:23,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 04:26:23,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 04:26:23,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 04:26:23,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 04:26:23,707 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 04:26:23,714 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2021-08-27 04:26:23,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:26:23 BoogieIcfgContainer [2021-08-27 04:26:23,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 04:26:23,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 04:26:23,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 04:26:23,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 04:26:23,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 04:26:22" (1/3) ... [2021-08-27 04:26:23,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4bc2f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 04:26:23, skipping insertion in model container [2021-08-27 04:26:23,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:22" (2/3) ... [2021-08-27 04:26:23,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4bc2f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 04:26:23, skipping insertion in model container [2021-08-27 04:26:23,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:26:23" (3/3) ... [2021-08-27 04:26:23,735 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-queue-2.i [2021-08-27 04:26:23,738 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 04:26:23,738 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2021-08-27 04:26:23,768 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 04:26:23,772 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 04:26:23,772 INFO L340 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2021-08-27 04:26:23,782 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 04:26:23,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 04:26:23,787 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:23,787 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:23,787 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 04:26:23,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:23,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1926376585, now seen corresponding path program 1 times [2021-08-27 04:26:23,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:23,797 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706355220] [2021-08-27 04:26:23,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:23,797 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:23,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:23,939 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 04:26:23,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:23,939 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706355220] [2021-08-27 04:26:23,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706355220] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:23,940 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:23,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 04:26:23,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828208078] [2021-08-27 04:26:23,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:23,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:23,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:23,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:23,954 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 04:26:24,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:24,277 INFO L93 Difference]: Finished difference Result 173 states and 184 transitions. [2021-08-27 04:26:24,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:24,279 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 04:26:24,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:24,285 INFO L225 Difference]: With dead ends: 173 [2021-08-27 04:26:24,285 INFO L226 Difference]: Without dead ends: 169 [2021-08-27 04:26:24,286 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.2ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:24,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-08-27 04:26:24,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2021-08-27 04:26:24,310 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 04:26:24,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 177 transitions. [2021-08-27 04:26:24,312 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 177 transitions. Word has length 7 [2021-08-27 04:26:24,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:24,313 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 177 transitions. [2021-08-27 04:26:24,313 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 04:26:24,313 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 177 transitions. [2021-08-27 04:26:24,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 04:26:24,313 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:24,314 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:24,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 04:26:24,314 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 04:26:24,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:24,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1926376584, now seen corresponding path program 1 times [2021-08-27 04:26:24,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:24,315 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120220535] [2021-08-27 04:26:24,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:24,315 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:24,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:24,383 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 04:26:24,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:24,383 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120220535] [2021-08-27 04:26:24,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120220535] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:24,384 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:24,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 04:26:24,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663770243] [2021-08-27 04:26:24,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:24,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:24,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:24,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:24,386 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 04:26:24,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:24,606 INFO L93 Difference]: Finished difference Result 159 states and 169 transitions. [2021-08-27 04:26:24,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:24,606 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 04:26:24,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:24,607 INFO L225 Difference]: With dead ends: 159 [2021-08-27 04:26:24,607 INFO L226 Difference]: Without dead ends: 159 [2021-08-27 04:26:24,608 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.2ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:24,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-08-27 04:26:24,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2021-08-27 04:26:24,612 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 04:26:24,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 166 transitions. [2021-08-27 04:26:24,613 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 166 transitions. Word has length 7 [2021-08-27 04:26:24,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:24,614 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 166 transitions. [2021-08-27 04:26:24,614 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 04:26:24,614 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 166 transitions. [2021-08-27 04:26:24,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 04:26:24,614 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:24,614 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:24,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 04:26:24,615 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr4REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 04:26:24,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:24,615 INFO L82 PathProgramCache]: Analyzing trace with hash 2140712926, now seen corresponding path program 1 times [2021-08-27 04:26:24,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:24,616 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061397047] [2021-08-27 04:26:24,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:24,616 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:24,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:24,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 04:26:24,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:24,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061397047] [2021-08-27 04:26:24,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061397047] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:24,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:24,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 04:26:24,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034389885] [2021-08-27 04:26:24,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 04:26:24,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:24,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 04:26:24,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 04:26:24,680 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 04:26:24,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:24,901 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2021-08-27 04:26:24,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 04:26:24,902 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 04:26:24,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:24,905 INFO L225 Difference]: With dead ends: 165 [2021-08-27 04:26:24,905 INFO L226 Difference]: Without dead ends: 165 [2021-08-27 04:26:24,906 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.2ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:24,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-08-27 04:26:24,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2021-08-27 04:26:24,920 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 04:26:24,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 172 transitions. [2021-08-27 04:26:24,923 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 172 transitions. Word has length 12 [2021-08-27 04:26:24,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:24,923 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 172 transitions. [2021-08-27 04:26:24,924 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 04:26:24,924 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 172 transitions. [2021-08-27 04:26:24,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 04:26:24,924 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:24,924 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:24,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 04:26:24,925 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr5REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 04:26:24,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:24,926 INFO L82 PathProgramCache]: Analyzing trace with hash 2140712927, now seen corresponding path program 1 times [2021-08-27 04:26:24,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:24,926 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469822962] [2021-08-27 04:26:24,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:24,926 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:25,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:25,052 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 04:26:25,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:25,052 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469822962] [2021-08-27 04:26:25,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469822962] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:25,052 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:25,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 04:26:25,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232459915] [2021-08-27 04:26:25,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 04:26:25,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:25,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 04:26:25,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-27 04:26:25,054 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 04:26:25,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:25,355 INFO L93 Difference]: Finished difference Result 248 states and 264 transitions. [2021-08-27 04:26:25,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 04:26:25,356 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 04:26:25,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:25,357 INFO L225 Difference]: With dead ends: 248 [2021-08-27 04:26:25,357 INFO L226 Difference]: Without dead ends: 248 [2021-08-27 04:26:25,357 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 47.1ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-27 04:26:25,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-08-27 04:26:25,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 162. [2021-08-27 04:26:25,360 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 04:26:25,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 177 transitions. [2021-08-27 04:26:25,360 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 177 transitions. Word has length 12 [2021-08-27 04:26:25,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:25,361 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 177 transitions. [2021-08-27 04:26:25,361 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 04:26:25,361 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 177 transitions. [2021-08-27 04:26:25,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 04:26:25,361 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:25,361 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:25,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 04:26:25,362 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 04:26:25,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:25,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1937591901, now seen corresponding path program 1 times [2021-08-27 04:26:25,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:25,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038124283] [2021-08-27 04:26:25,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:25,363 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:25,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:25,398 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 04:26:25,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:25,398 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038124283] [2021-08-27 04:26:25,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038124283] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:25,398 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:25,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 04:26:25,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243980050] [2021-08-27 04:26:25,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:25,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:25,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:25,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:25,400 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 04:26:25,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:25,548 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2021-08-27 04:26:25,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:25,548 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 04:26:25,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:25,549 INFO L225 Difference]: With dead ends: 152 [2021-08-27 04:26:25,549 INFO L226 Difference]: Without dead ends: 152 [2021-08-27 04:26:25,550 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 04:26:25,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-08-27 04:26:25,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2021-08-27 04:26:25,552 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 04:26:25,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2021-08-27 04:26:25,552 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 13 [2021-08-27 04:26:25,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:25,553 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2021-08-27 04:26:25,553 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 04:26:25,553 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2021-08-27 04:26:25,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 04:26:25,553 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:25,553 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:25,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 04:26:25,554 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr8REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 04:26:25,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:25,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1579051744, now seen corresponding path program 1 times [2021-08-27 04:26:25,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:25,555 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188244034] [2021-08-27 04:26:25,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:25,555 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:25,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:25,625 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 04:26:25,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:25,626 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188244034] [2021-08-27 04:26:25,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188244034] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:25,626 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:25,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 04:26:25,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564305340] [2021-08-27 04:26:25,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 04:26:25,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:25,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 04:26:25,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 04:26:25,627 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 04:26:26,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:26,020 INFO L93 Difference]: Finished difference Result 223 states and 238 transitions. [2021-08-27 04:26:26,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 04:26:26,020 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 04:26:26,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:26,021 INFO L225 Difference]: With dead ends: 223 [2021-08-27 04:26:26,021 INFO L226 Difference]: Without dead ends: 223 [2021-08-27 04:26:26,021 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 46.4ms TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-08-27 04:26:26,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-08-27 04:26:26,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 151. [2021-08-27 04:26:26,023 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 04:26:26,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 165 transitions. [2021-08-27 04:26:26,024 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 165 transitions. Word has length 16 [2021-08-27 04:26:26,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:26,024 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 165 transitions. [2021-08-27 04:26:26,024 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 04:26:26,024 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2021-08-27 04:26:26,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 04:26:26,024 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:26,024 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:26,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 04:26:26,025 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr9REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 04:26:26,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:26,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1579051743, now seen corresponding path program 1 times [2021-08-27 04:26:26,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:26,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842387508] [2021-08-27 04:26:26,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:26,025 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:26,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:26,098 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 04:26:26,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:26,098 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842387508] [2021-08-27 04:26:26,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842387508] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:26,098 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:26,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 04:26:26,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494674163] [2021-08-27 04:26:26,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 04:26:26,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:26,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 04:26:26,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 04:26:26,099 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 04:26:26,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:26,509 INFO L93 Difference]: Finished difference Result 215 states and 232 transitions. [2021-08-27 04:26:26,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 04:26:26,509 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 04:26:26,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:26,510 INFO L225 Difference]: With dead ends: 215 [2021-08-27 04:26:26,510 INFO L226 Difference]: Without dead ends: 215 [2021-08-27 04:26:26,510 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 91.1ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-08-27 04:26:26,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-08-27 04:26:26,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 140. [2021-08-27 04:26:26,513 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 04:26:26,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 153 transitions. [2021-08-27 04:26:26,513 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 153 transitions. Word has length 16 [2021-08-27 04:26:26,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:26,513 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 153 transitions. [2021-08-27 04:26:26,514 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 04:26:26,514 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 153 transitions. [2021-08-27 04:26:26,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 04:26:26,514 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:26,514 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 04:26:26,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 04:26:26,515 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 04:26:26,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:26,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1760689906, now seen corresponding path program 1 times [2021-08-27 04:26:26,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:26,515 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135806622] [2021-08-27 04:26:26,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:26,516 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:26,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:26,550 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 04:26:26,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:26,550 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135806622] [2021-08-27 04:26:26,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135806622] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:26,550 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:26,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 04:26:26,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703137776] [2021-08-27 04:26:26,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:26,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:26,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:26,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:26,553 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 04:26:26,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:26,674 INFO L93 Difference]: Finished difference Result 195 states and 215 transitions. [2021-08-27 04:26:26,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:26,675 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 04:26:26,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:26,675 INFO L225 Difference]: With dead ends: 195 [2021-08-27 04:26:26,676 INFO L226 Difference]: Without dead ends: 195 [2021-08-27 04:26:26,676 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.7ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:26,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-08-27 04:26:26,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 153. [2021-08-27 04:26:26,677 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 04:26:26,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 167 transitions. [2021-08-27 04:26:26,678 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 167 transitions. Word has length 19 [2021-08-27 04:26:26,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:26,678 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 167 transitions. [2021-08-27 04:26:26,678 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 04:26:26,678 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 167 transitions. [2021-08-27 04:26:26,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 04:26:26,679 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:26,679 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 04:26:26,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 04:26:26,679 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 04:26:26,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:26,679 INFO L82 PathProgramCache]: Analyzing trace with hash -555742479, now seen corresponding path program 1 times [2021-08-27 04:26:26,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:26,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108158108] [2021-08-27 04:26:26,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:26,680 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:26,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:26,727 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 04:26:26,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:26,727 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108158108] [2021-08-27 04:26:26,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108158108] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:26,727 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:26,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 04:26:26,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379975453] [2021-08-27 04:26:26,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 04:26:26,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:26,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 04:26:26,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 04:26:26,728 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 04:26:26,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:26,959 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2021-08-27 04:26:26,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 04:26:26,960 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 04:26:26,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:26,961 INFO L225 Difference]: With dead ends: 153 [2021-08-27 04:26:26,961 INFO L226 Difference]: Without dead ends: 153 [2021-08-27 04:26:26,961 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 62.2ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-08-27 04:26:26,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-08-27 04:26:26,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2021-08-27 04:26:26,963 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 04:26:26,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 165 transitions. [2021-08-27 04:26:26,964 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 165 transitions. Word has length 23 [2021-08-27 04:26:26,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:26,964 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 165 transitions. [2021-08-27 04:26:26,964 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 04:26:26,964 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2021-08-27 04:26:26,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 04:26:26,965 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:26,965 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 04:26:26,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 04:26:26,965 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr60REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 04:26:26,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:26,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1696785143, now seen corresponding path program 1 times [2021-08-27 04:26:26,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:26,966 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020702395] [2021-08-27 04:26:26,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:26,966 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:27,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:27,022 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 04:26:27,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:27,022 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020702395] [2021-08-27 04:26:27,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020702395] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:27,022 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:27,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 04:26:27,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251756690] [2021-08-27 04:26:27,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 04:26:27,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:27,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 04:26:27,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 04:26:27,023 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 04:26:27,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:27,171 INFO L93 Difference]: Finished difference Result 184 states and 200 transitions. [2021-08-27 04:26:27,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 04:26:27,172 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 04:26:27,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:27,172 INFO L225 Difference]: With dead ends: 184 [2021-08-27 04:26:27,172 INFO L226 Difference]: Without dead ends: 184 [2021-08-27 04:26:27,173 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.5ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:27,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-08-27 04:26:27,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 162. [2021-08-27 04:26:27,175 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 04:26:27,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 179 transitions. [2021-08-27 04:26:27,175 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 179 transitions. Word has length 24 [2021-08-27 04:26:27,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:27,176 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 179 transitions. [2021-08-27 04:26:27,176 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 04:26:27,176 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 179 transitions. [2021-08-27 04:26:27,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 04:26:27,177 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:27,177 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 04:26:27,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 04:26:27,177 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 04:26:27,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:27,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1457853172, now seen corresponding path program 1 times [2021-08-27 04:26:27,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:27,178 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672084046] [2021-08-27 04:26:27,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:27,178 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:27,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:27,242 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 04:26:27,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:27,242 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672084046] [2021-08-27 04:26:27,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672084046] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:27,242 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:27,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 04:26:27,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113178210] [2021-08-27 04:26:27,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 04:26:27,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:27,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 04:26:27,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 04:26:27,244 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 04:26:27,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:27,415 INFO L93 Difference]: Finished difference Result 160 states and 173 transitions. [2021-08-27 04:26:27,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 04:26:27,415 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 04:26:27,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:27,416 INFO L225 Difference]: With dead ends: 160 [2021-08-27 04:26:27,416 INFO L226 Difference]: Without dead ends: 160 [2021-08-27 04:26:27,416 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 48.5ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-27 04:26:27,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-08-27 04:26:27,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2021-08-27 04:26:27,418 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 04:26:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 169 transitions. [2021-08-27 04:26:27,419 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 169 transitions. Word has length 26 [2021-08-27 04:26:27,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:27,419 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 169 transitions. [2021-08-27 04:26:27,419 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 04:26:27,419 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 169 transitions. [2021-08-27 04:26:27,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 04:26:27,424 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:27,425 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 04:26:27,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 04:26:27,425 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 04:26:27,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:27,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1062106762, now seen corresponding path program 1 times [2021-08-27 04:26:27,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:27,426 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429509730] [2021-08-27 04:26:27,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:27,426 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:27,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:27,474 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 04:26:27,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:27,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429509730] [2021-08-27 04:26:27,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429509730] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:27,474 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:27,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 04:26:27,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793204953] [2021-08-27 04:26:27,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 04:26:27,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:27,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 04:26:27,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:27,475 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 04:26:27,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:27,629 INFO L93 Difference]: Finished difference Result 156 states and 168 transitions. [2021-08-27 04:26:27,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 04:26:27,629 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 04:26:27,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:27,630 INFO L225 Difference]: With dead ends: 156 [2021-08-27 04:26:27,630 INFO L226 Difference]: Without dead ends: 156 [2021-08-27 04:26:27,630 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 23.3ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:27,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-08-27 04:26:27,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2021-08-27 04:26:27,632 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 04:26:27,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 168 transitions. [2021-08-27 04:26:27,633 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 168 transitions. Word has length 26 [2021-08-27 04:26:27,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:27,633 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 168 transitions. [2021-08-27 04:26:27,633 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 04:26:27,633 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 168 transitions. [2021-08-27 04:26:27,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 04:26:27,636 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:27,637 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 04:26:27,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 04:26:27,637 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr64REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 04:26:27,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:27,637 INFO L82 PathProgramCache]: Analyzing trace with hash -198024619, now seen corresponding path program 1 times [2021-08-27 04:26:27,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:27,638 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477714533] [2021-08-27 04:26:27,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:27,638 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:27,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:27,749 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 04:26:27,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:27,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477714533] [2021-08-27 04:26:27,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477714533] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:27,750 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250335820] [2021-08-27 04:26:27,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:27,750 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:27,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:27,751 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 04:26:27,767 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 04:26:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:27,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-27 04:26:27,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:28,177 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 04:26:28,182 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 04:26:28,230 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 04:26:28,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250335820] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:28,231 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:26:28,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2021-08-27 04:26:28,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210938362] [2021-08-27 04:26:28,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 04:26:28,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:28,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 04:26:28,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-08-27 04:26:28,233 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 04:26:28,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:28,538 INFO L93 Difference]: Finished difference Result 185 states and 201 transitions. [2021-08-27 04:26:28,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 04:26:28,539 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 04:26:28,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:28,539 INFO L225 Difference]: With dead ends: 185 [2021-08-27 04:26:28,539 INFO L226 Difference]: Without dead ends: 185 [2021-08-27 04:26:28,540 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 160.8ms TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2021-08-27 04:26:28,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-08-27 04:26:28,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 166. [2021-08-27 04:26:28,542 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 04:26:28,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 179 transitions. [2021-08-27 04:26:28,542 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 179 transitions. Word has length 29 [2021-08-27 04:26:28,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:28,542 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 179 transitions. [2021-08-27 04:26:28,542 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 04:26:28,542 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2021-08-27 04:26:28,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 04:26:28,543 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:28,543 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 04:26:28,562 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 04:26:28,757 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 04:26:28,757 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 04:26:28,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:28,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1843797011, now seen corresponding path program 1 times [2021-08-27 04:26:28,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:28,758 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274156945] [2021-08-27 04:26:28,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:28,758 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:28,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:28,809 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 04:26:28,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:28,810 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274156945] [2021-08-27 04:26:28,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274156945] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:28,810 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636198674] [2021-08-27 04:26:28,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:28,810 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:26:28,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:28,811 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 04:26:28,849 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 04:26:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:28,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 04:26:28,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:29,162 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 04:26:29,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636198674] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 04:26:29,162 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:26:29,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-08-27 04:26:29,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974387189] [2021-08-27 04:26:29,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 04:26:29,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:29,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 04:26:29,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:29,163 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 04:26:29,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:29,448 INFO L93 Difference]: Finished difference Result 176 states and 188 transitions. [2021-08-27 04:26:29,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 04:26:29,449 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 04:26:29,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:29,449 INFO L225 Difference]: With dead ends: 176 [2021-08-27 04:26:29,450 INFO L226 Difference]: Without dead ends: 157 [2021-08-27 04:26:29,450 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 62.2ms TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-08-27 04:26:29,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-08-27 04:26:29,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2021-08-27 04:26:29,457 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 04:26:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 169 transitions. [2021-08-27 04:26:29,457 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 169 transitions. Word has length 30 [2021-08-27 04:26:29,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:29,458 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 169 transitions. [2021-08-27 04:26:29,458 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 04:26:29,458 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 169 transitions. [2021-08-27 04:26:29,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-27 04:26:29,458 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:29,458 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 04:26:29,483 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 04:26:29,672 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 04:26:29,673 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 04:26:29,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:29,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1469946611, now seen corresponding path program 1 times [2021-08-27 04:26:29,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:29,673 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113010740] [2021-08-27 04:26:29,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:29,674 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:29,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:29,689 ERROR L253 erpolLogProxyWrapper]: Interpolant 10 not inductive [2021-08-27 04:26:29,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 04:26:29,707 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 04:26:29,712 INFO L168 Benchmark]: Toolchain (without parser) took 7150.97 ms. Allocated memory was 56.6 MB in the beginning and 188.7 MB in the end (delta: 132.1 MB). Free memory was 39.9 MB in the beginning and 156.7 MB in the end (delta: -116.8 MB). Peak memory consumption was 16.1 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:29,712 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 46.1 MB. Free memory was 28.6 MB in the beginning and 28.5 MB in the end (delta: 30.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 04:26:29,713 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.04 ms. Allocated memory is still 56.6 MB. Free memory was 39.7 MB in the beginning and 31.4 MB in the end (delta: 8.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:29,713 INFO L168 Benchmark]: Boogie Preprocessor took 59.76 ms. Allocated memory is still 56.6 MB. Free memory was 31.4 MB in the beginning and 28.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:29,713 INFO L168 Benchmark]: RCFGBuilder took 786.09 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 28.2 MB in the beginning and 46.3 MB in the end (delta: -18.1 MB). Peak memory consumption was 16.5 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:29,714 INFO L168 Benchmark]: TraceAbstraction took 5993.83 ms. Allocated memory was 69.2 MB in the beginning and 188.7 MB in the end (delta: 119.5 MB). Free memory was 46.0 MB in the beginning and 156.7 MB in the end (delta: -110.7 MB). Peak memory consumption was 8.9 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:29,715 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 46.1 MB. Free memory was 28.6 MB in the beginning and 28.5 MB in the end (delta: 30.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 308.04 ms. Allocated memory is still 56.6 MB. Free memory was 39.7 MB in the beginning and 31.4 MB in the end (delta: 8.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 59.76 ms. Allocated memory is still 56.6 MB. Free memory was 31.4 MB in the beginning and 28.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 786.09 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 28.2 MB in the beginning and 46.3 MB in the end (delta: -18.1 MB). Peak memory consumption was 16.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 5993.83 ms. Allocated memory was 69.2 MB in the beginning and 188.7 MB in the end (delta: 119.5 MB). Free memory was 46.0 MB in the beginning and 156.7 MB in the end (delta: -110.7 MB). Peak memory consumption was 8.9 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 04:26:29,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 04:26:31,251 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 04:26:31,253 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 04:26:31,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 04:26:31,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 04:26:31,290 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 04:26:31,291 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 04:26:31,295 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 04:26:31,296 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 04:26:31,300 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 04:26:31,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 04:26:31,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 04:26:31,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 04:26:31,305 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 04:26:31,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 04:26:31,309 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 04:26:31,310 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 04:26:31,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 04:26:31,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 04:26:31,315 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 04:26:31,316 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 04:26:31,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 04:26:31,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 04:26:31,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 04:26:31,323 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 04:26:31,323 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 04:26:31,324 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 04:26:31,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 04:26:31,325 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 04:26:31,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 04:26:31,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 04:26:31,326 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 04:26:31,328 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 04:26:31,328 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 04:26:31,329 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 04:26:31,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 04:26:31,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 04:26:31,330 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 04:26:31,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 04:26:31,331 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 04:26:31,331 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 04:26:31,334 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2021-08-27 04:26:31,362 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 04:26:31,362 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 04:26:31,363 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 04:26:31,363 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 04:26:31,364 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 04:26:31,365 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 04:26:31,365 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 04:26:31,365 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 04:26:31,365 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 04:26:31,365 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 04:26:31,366 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 04:26:31,366 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 04:26:31,366 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 04:26:31,366 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 04:26:31,366 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 04:26:31,367 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 04:26:31,374 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 04:26:31,374 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-27 04:26:31,374 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-27 04:26:31,374 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 04:26:31,374 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 04:26:31,374 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 04:26:31,375 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 04:26:31,375 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 04:26:31,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 04:26:31,375 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 04:26:31,375 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 04:26:31,375 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-27 04:26:31,375 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-27 04:26:31,376 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 04:26:31,376 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-27 04:26:31,376 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-memcleanup) ) 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 -> 14d581c6353338cffdb717aca448574ebb528294 [2021-08-27 04:26:31,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 04:26:31,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 04:26:31,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 04:26:31,624 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 04:26:31,624 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 04:26:31,625 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-queue-2.i [2021-08-27 04:26:31,673 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e674372d/9fbb416b576249bd82601294188a0ce0/FLAG217658c3e [2021-08-27 04:26:32,110 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 04:26:32,113 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i [2021-08-27 04:26:32,126 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e674372d/9fbb416b576249bd82601294188a0ce0/FLAG217658c3e [2021-08-27 04:26:32,137 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e674372d/9fbb416b576249bd82601294188a0ce0 [2021-08-27 04:26:32,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 04:26:32,140 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 04:26:32,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 04:26:32,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 04:26:32,145 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 04:26:32,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:26:32" (1/1) ... [2021-08-27 04:26:32,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1857d3c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:32, skipping insertion in model container [2021-08-27 04:26:32,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:26:32" (1/1) ... [2021-08-27 04:26:32,150 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 04:26:32,185 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 04:26:32,442 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-2.i[22387,22400] [2021-08-27 04:26:32,444 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-2.i[22458,22471] [2021-08-27 04:26:32,446 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-2.i[22532,22545] [2021-08-27 04:26:32,447 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-2.i[22624,22637] [2021-08-27 04:26:32,448 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-2.i[22701,22714] [2021-08-27 04:26:32,450 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-2.i[22796,22809] [2021-08-27 04:26:32,451 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-2.i[22873,22886] [2021-08-27 04:26:32,452 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-2.i[22956,22969] [2021-08-27 04:26:32,453 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-2.i[23051,23064] [2021-08-27 04:26:32,454 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-2.i[23128,23141] [2021-08-27 04:26:32,456 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-2.i[23211,23224] [2021-08-27 04:26:32,459 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-2.i[23300,23313] [2021-08-27 04:26:32,460 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-2.i[23386,23399] [2021-08-27 04:26:32,462 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-2.i[23532,23545] [2021-08-27 04:26:32,468 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 04:26:32,479 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 04:26:32,508 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-2.i[22387,22400] [2021-08-27 04:26:32,509 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-2.i[22458,22471] [2021-08-27 04:26:32,510 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-2.i[22532,22545] [2021-08-27 04:26:32,510 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-2.i[22624,22637] [2021-08-27 04:26:32,510 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-2.i[22701,22714] [2021-08-27 04:26:32,511 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-2.i[22796,22809] [2021-08-27 04:26:32,511 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-2.i[22873,22886] [2021-08-27 04:26:32,512 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-2.i[22956,22969] [2021-08-27 04:26:32,512 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-2.i[23051,23064] [2021-08-27 04:26:32,513 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-2.i[23128,23141] [2021-08-27 04:26:32,513 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-2.i[23211,23224] [2021-08-27 04:26:32,514 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-2.i[23300,23313] [2021-08-27 04:26:32,515 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-2.i[23386,23399] [2021-08-27 04:26:32,515 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-2.i[23532,23545] [2021-08-27 04:26:32,517 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 04:26:32,533 INFO L208 MainTranslator]: Completed translation [2021-08-27 04:26:32,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:32 WrapperNode [2021-08-27 04:26:32,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 04:26:32,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 04:26:32,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 04:26:32,535 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 04:26:32,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:32" (1/1) ... [2021-08-27 04:26:32,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:32" (1/1) ... [2021-08-27 04:26:32,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:32" (1/1) ... [2021-08-27 04:26:32,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:32" (1/1) ... [2021-08-27 04:26:32,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:32" (1/1) ... [2021-08-27 04:26:32,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:32" (1/1) ... [2021-08-27 04:26:32,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:32" (1/1) ... [2021-08-27 04:26:32,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 04:26:32,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 04:26:32,573 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 04:26:32,573 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 04:26:32,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:32" (1/1) ... [2021-08-27 04:26:32,578 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 04:26:32,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:32,589 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 04:26:32,600 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 04:26:32,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 04:26:32,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 04:26:32,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 04:26:32,625 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 04:26:32,625 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 04:26:32,626 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 04:26:32,626 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 04:26:32,626 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 04:26:32,626 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 04:26:32,626 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 04:26:32,626 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 04:26:32,626 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 04:26:32,626 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 04:26:32,626 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 04:26:32,633 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 04:26:32,633 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 04:26:32,633 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 04:26:32,633 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 04:26:32,633 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 04:26:32,633 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 04:26:32,634 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 04:26:32,634 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 04:26:32,634 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 04:26:32,634 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 04:26:32,634 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 04:26:32,634 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 04:26:32,634 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 04:26:32,634 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 04:26:32,634 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 04:26:32,635 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 04:26:32,635 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 04:26:32,635 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 04:26:32,635 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 04:26:32,635 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 04:26:32,635 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 04:26:32,635 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 04:26:32,635 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 04:26:32,635 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 04:26:32,636 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 04:26:32,636 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 04:26:32,636 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 04:26:32,636 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 04:26:32,636 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 04:26:32,636 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 04:26:32,636 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 04:26:32,636 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 04:26:32,637 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 04:26:32,637 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 04:26:32,637 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 04:26:32,637 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 04:26:32,637 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 04:26:32,637 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 04:26:32,637 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 04:26:32,637 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 04:26:32,637 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 04:26:32,638 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 04:26:32,638 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 04:26:32,638 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 04:26:32,638 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 04:26:32,638 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 04:26:32,638 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 04:26:32,638 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 04:26:32,638 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 04:26:32,638 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 04:26:32,638 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 04:26:32,639 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 04:26:32,639 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 04:26:32,639 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 04:26:32,639 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 04:26:32,639 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 04:26:32,639 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 04:26:32,639 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 04:26:32,639 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 04:26:32,639 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 04:26:32,640 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 04:26:32,640 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 04:26:32,640 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 04:26:32,640 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 04:26:32,640 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 04:26:32,640 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 04:26:32,640 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 04:26:32,640 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 04:26:32,640 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 04:26:32,640 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 04:26:32,641 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 04:26:32,641 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 04:26:32,641 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 04:26:32,641 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 04:26:32,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 04:26:32,641 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 04:26:32,641 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 04:26:32,641 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 04:26:32,641 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 04:26:32,642 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 04:26:32,642 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 04:26:32,642 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 04:26:32,642 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 04:26:32,642 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 04:26:32,642 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 04:26:32,642 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 04:26:32,642 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 04:26:32,643 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 04:26:32,643 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 04:26:32,643 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 04:26:32,643 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 04:26:32,643 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 04:26:32,643 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 04:26:32,643 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 04:26:32,643 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 04:26:32,643 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 04:26:32,644 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 04:26:32,644 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 04:26:32,644 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 04:26:32,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 04:26:32,644 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 04:26:32,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 04:26:32,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 04:26:32,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-27 04:26:32,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 04:26:32,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-27 04:26:32,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 04:26:32,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 04:26:32,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-27 04:26:32,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 04:26:32,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2021-08-27 04:26:32,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-08-27 04:26:32,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-08-27 04:26:33,373 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 04:26:33,373 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2021-08-27 04:26:33,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:26:33 BoogieIcfgContainer [2021-08-27 04:26:33,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 04:26:33,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 04:26:33,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 04:26:33,377 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 04:26:33,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 04:26:32" (1/3) ... [2021-08-27 04:26:33,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21014fd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 04:26:33, skipping insertion in model container [2021-08-27 04:26:33,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:32" (2/3) ... [2021-08-27 04:26:33,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21014fd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 04:26:33, skipping insertion in model container [2021-08-27 04:26:33,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:26:33" (3/3) ... [2021-08-27 04:26:33,379 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-queue-2.i [2021-08-27 04:26:33,382 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 04:26:33,382 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2021-08-27 04:26:33,405 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 04:26:33,408 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 04:26:33,409 INFO L340 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2021-08-27 04:26:33,418 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 04:26:33,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 04:26:33,422 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:33,422 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:33,423 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 04:26:33,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:33,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1735636923, now seen corresponding path program 1 times [2021-08-27 04:26:33,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:26:33,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374454855] [2021-08-27 04:26:33,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:33,433 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:26:33,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:26:33,445 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 04:26:33,458 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 04:26:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:33,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 04:26:33,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:33,647 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 04:26:33,657 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 04:26:33,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:26:33,696 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 04:26:33,696 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:26:33,697 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374454855] [2021-08-27 04:26:33,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374454855] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:33,697 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:33,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-27 04:26:33,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113954469] [2021-08-27 04:26:33,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 04:26:33,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:26:33,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 04:26:33,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 04:26:33,719 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 04:26:33,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:33,905 INFO L93 Difference]: Finished difference Result 170 states and 180 transitions. [2021-08-27 04:26:33,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 04:26:33,914 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 04:26:33,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:33,922 INFO L225 Difference]: With dead ends: 170 [2021-08-27 04:26:33,922 INFO L226 Difference]: Without dead ends: 166 [2021-08-27 04:26:33,923 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 04:26:33,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-08-27 04:26:33,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2021-08-27 04:26:33,947 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 04:26:33,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2021-08-27 04:26:33,950 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 7 [2021-08-27 04:26:33,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:33,950 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2021-08-27 04:26:33,950 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 04:26:33,950 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2021-08-27 04:26:33,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 04:26:33,951 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:33,951 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:33,959 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 04:26:34,151 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 04:26:34,152 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 04:26:34,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:34,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1735636922, now seen corresponding path program 1 times [2021-08-27 04:26:34,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:26:34,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768477639] [2021-08-27 04:26:34,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:34,158 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:26:34,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:26:34,159 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 04:26:34,159 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 04:26:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:34,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 04:26:34,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:34,348 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 04:26:34,361 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 04:26:34,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:26:34,423 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 04:26:34,424 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:26:34,424 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768477639] [2021-08-27 04:26:34,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [768477639] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:34,424 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:34,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-08-27 04:26:34,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409018230] [2021-08-27 04:26:34,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:34,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:26:34,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:34,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:34,427 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 04:26:34,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:34,627 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2021-08-27 04:26:34,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:34,630 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 04:26:34,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:34,631 INFO L225 Difference]: With dead ends: 156 [2021-08-27 04:26:34,631 INFO L226 Difference]: Without dead ends: 156 [2021-08-27 04:26:34,632 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:34,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-08-27 04:26:34,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2021-08-27 04:26:34,639 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 04:26:34,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2021-08-27 04:26:34,642 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 7 [2021-08-27 04:26:34,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:34,642 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2021-08-27 04:26:34,642 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 04:26:34,642 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2021-08-27 04:26:34,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-27 04:26:34,643 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:34,643 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:34,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-08-27 04:26:34,851 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 04:26:34,851 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr4REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 04:26:34,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:34,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1828127689, now seen corresponding path program 1 times [2021-08-27 04:26:34,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:26:34,852 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715032397] [2021-08-27 04:26:34,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:34,853 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:26:34,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:26:34,853 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 04:26:34,855 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 04:26:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:34,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 04:26:34,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:34,978 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 04:26:35,027 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-08-27 04:26:35,027 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 04:26:35,046 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 04:26:35,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:26:35,094 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 04:26:35,094 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:26:35,094 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715032397] [2021-08-27 04:26:35,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1715032397] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:35,095 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:35,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-27 04:26:35,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239336379] [2021-08-27 04:26:35,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:35,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:26:35,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:35,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:35,096 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 04:26:35,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:35,286 INFO L93 Difference]: Finished difference Result 162 states and 171 transitions. [2021-08-27 04:26:35,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 04:26:35,287 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 04:26:35,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:35,288 INFO L225 Difference]: With dead ends: 162 [2021-08-27 04:26:35,288 INFO L226 Difference]: Without dead ends: 162 [2021-08-27 04:26:35,288 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 8 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 04:26:35,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-08-27 04:26:35,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 154. [2021-08-27 04:26:35,292 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 04:26:35,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2021-08-27 04:26:35,293 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 11 [2021-08-27 04:26:35,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:35,293 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 168 transitions. [2021-08-27 04:26:35,293 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 04:26:35,293 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2021-08-27 04:26:35,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-27 04:26:35,294 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:35,294 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:35,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-27 04:26:35,500 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 04:26:35,501 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr5REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 04:26:35,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:35,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1828127690, now seen corresponding path program 1 times [2021-08-27 04:26:35,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:26:35,502 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1417385808] [2021-08-27 04:26:35,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:35,502 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:26:35,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:26:35,503 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 04:26:35,510 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 04:26:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:35,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 04:26:35,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:35,672 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 04:26:35,725 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-27 04:26:35,725 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 04:26:35,737 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 04:26:35,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:26:35,936 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 04:26:35,936 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:26:35,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1417385808] [2021-08-27 04:26:35,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1417385808] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:35,936 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:35,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 6 [2021-08-27 04:26:35,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637575220] [2021-08-27 04:26:35,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 04:26:35,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:26:35,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 04:26:35,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 04:26:35,938 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 04:26:36,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:36,672 INFO L93 Difference]: Finished difference Result 243 states and 258 transitions. [2021-08-27 04:26:36,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 04:26:36,673 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 04:26:36,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:36,674 INFO L225 Difference]: With dead ends: 243 [2021-08-27 04:26:36,674 INFO L226 Difference]: Without dead ends: 243 [2021-08-27 04:26:36,674 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 206.4ms TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-08-27 04:26:36,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-08-27 04:26:36,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 155. [2021-08-27 04:26:36,679 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 04:26:36,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 169 transitions. [2021-08-27 04:26:36,680 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 169 transitions. Word has length 11 [2021-08-27 04:26:36,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:36,680 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 169 transitions. [2021-08-27 04:26:36,680 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 04:26:36,680 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 169 transitions. [2021-08-27 04:26:36,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 04:26:36,680 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:36,680 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:36,689 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 04:26:36,887 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 04:26:36,888 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 04:26:36,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:36,888 INFO L82 PathProgramCache]: Analyzing trace with hash 837384167, now seen corresponding path program 1 times [2021-08-27 04:26:36,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:26:36,888 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093561809] [2021-08-27 04:26:36,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:36,888 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:26:36,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:26:36,890 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 04:26:36,897 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 04:26:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:37,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 04:26:37,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:37,051 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 04:26:37,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:26:37,080 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 04:26:37,081 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:26:37,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093561809] [2021-08-27 04:26:37,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093561809] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:37,081 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:37,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-27 04:26:37,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273473440] [2021-08-27 04:26:37,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 04:26:37,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:26:37,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 04:26:37,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 04:26:37,082 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 04:26:37,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:37,124 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2021-08-27 04:26:37,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 04:26:37,125 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 04:26:37,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:37,126 INFO L225 Difference]: With dead ends: 145 [2021-08-27 04:26:37,126 INFO L226 Difference]: Without dead ends: 145 [2021-08-27 04:26:37,126 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 04:26:37,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-08-27 04:26:37,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2021-08-27 04:26:37,130 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 04:26:37,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2021-08-27 04:26:37,131 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 12 [2021-08-27 04:26:37,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:37,131 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2021-08-27 04:26:37,131 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 04:26:37,131 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2021-08-27 04:26:37,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 04:26:37,131 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:37,132 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:37,150 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 04:26:37,340 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 04:26:37,340 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr8REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 04:26:37,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:37,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1322768587, now seen corresponding path program 1 times [2021-08-27 04:26:37,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:26:37,341 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512959433] [2021-08-27 04:26:37,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:37,341 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:26:37,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:26:37,342 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 04:26:37,342 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 04:26:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:37,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 04:26:37,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:37,503 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 04:26:37,519 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 04:26:37,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 22 treesize of output 14 [2021-08-27 04:26:37,559 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 04:26:37,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:26:37,627 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 04:26:37,627 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:26:37,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512959433] [2021-08-27 04:26:37,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512959433] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:37,628 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:37,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-08-27 04:26:37,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384746270] [2021-08-27 04:26:37,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 04:26:37,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:26:37,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 04:26:37,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:37,629 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 04:26:37,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:37,995 INFO L93 Difference]: Finished difference Result 216 states and 230 transitions. [2021-08-27 04:26:37,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 04:26:37,995 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 04:26:37,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:37,996 INFO L225 Difference]: With dead ends: 216 [2021-08-27 04:26:37,996 INFO L226 Difference]: Without dead ends: 216 [2021-08-27 04:26:37,997 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 56.9ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-08-27 04:26:37,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-08-27 04:26:38,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 144. [2021-08-27 04:26:38,003 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 04:26:38,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 157 transitions. [2021-08-27 04:26:38,003 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 157 transitions. Word has length 15 [2021-08-27 04:26:38,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:38,004 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 157 transitions. [2021-08-27 04:26:38,004 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 04:26:38,004 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 157 transitions. [2021-08-27 04:26:38,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 04:26:38,004 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:38,005 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:38,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-08-27 04:26:38,213 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 04:26:38,214 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr9REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 04:26:38,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:38,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1322768588, now seen corresponding path program 1 times [2021-08-27 04:26:38,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:26:38,215 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939996408] [2021-08-27 04:26:38,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:38,215 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:26:38,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:26:38,215 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 04:26:38,217 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 04:26:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:38,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 04:26:38,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:38,387 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 04:26:38,411 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 04:26:38,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 17 treesize of output 13 [2021-08-27 04:26:38,443 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 04:26:38,445 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 04:26:38,471 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 04:26:38,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:26:38,659 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 04:26:38,659 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:26:38,659 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939996408] [2021-08-27 04:26:38,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939996408] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:38,659 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:38,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2021-08-27 04:26:38,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131515459] [2021-08-27 04:26:38,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 04:26:38,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:26:38,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 04:26:38,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-27 04:26:38,665 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 04:26:39,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:39,636 INFO L93 Difference]: Finished difference Result 211 states and 227 transitions. [2021-08-27 04:26:39,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 04:26:39,641 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 04:26:39,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:39,642 INFO L225 Difference]: With dead ends: 211 [2021-08-27 04:26:39,642 INFO L226 Difference]: Without dead ends: 211 [2021-08-27 04:26:39,642 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 268.9ms TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2021-08-27 04:26:39,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-08-27 04:26:39,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 137. [2021-08-27 04:26:39,645 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 04:26:39,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2021-08-27 04:26:39,646 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 15 [2021-08-27 04:26:39,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:39,646 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2021-08-27 04:26:39,646 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 04:26:39,647 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2021-08-27 04:26:39,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-27 04:26:39,647 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:39,647 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 04:26:39,654 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 04:26:39,854 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 04:26:39,854 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 04:26:39,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:39,855 INFO L82 PathProgramCache]: Analyzing trace with hash 788457692, now seen corresponding path program 1 times [2021-08-27 04:26:39,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:26:39,855 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311901766] [2021-08-27 04:26:39,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:39,855 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:26:39,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:26:39,856 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 04:26:39,857 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 04:26:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:39,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 04:26:39,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:40,043 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 04:26:40,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:26:40,089 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 04:26:40,090 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:26:40,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311901766] [2021-08-27 04:26:40,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311901766] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:40,090 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:40,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-27 04:26:40,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654113930] [2021-08-27 04:26:40,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:40,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:26:40,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:40,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:40,091 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 04:26:40,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:40,123 INFO L93 Difference]: Finished difference Result 248 states and 275 transitions. [2021-08-27 04:26:40,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:40,133 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 04:26:40,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:40,133 INFO L225 Difference]: With dead ends: 248 [2021-08-27 04:26:40,133 INFO L226 Difference]: Without dead ends: 248 [2021-08-27 04:26:40,134 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:40,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-08-27 04:26:40,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 164. [2021-08-27 04:26:40,136 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 04:26:40,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 180 transitions. [2021-08-27 04:26:40,137 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 180 transitions. Word has length 18 [2021-08-27 04:26:40,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:40,137 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 180 transitions. [2021-08-27 04:26:40,137 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 04:26:40,137 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 180 transitions. [2021-08-27 04:26:40,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 04:26:40,137 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:40,137 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 04:26:40,147 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 04:26:40,346 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 04:26:40,346 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr59REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 04:26:40,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:40,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1487936176, now seen corresponding path program 1 times [2021-08-27 04:26:40,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:26:40,347 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734013589] [2021-08-27 04:26:40,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:40,347 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:26:40,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:26:40,347 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 04:26:40,348 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 04:26:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:40,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 04:26:40,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:40,559 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 04:26:40,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:26:40,619 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 04:26:40,619 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:26:40,619 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734013589] [2021-08-27 04:26:40,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734013589] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:40,619 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:40,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-27 04:26:40,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148653739] [2021-08-27 04:26:40,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:40,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:26:40,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:40,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:40,620 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 04:26:40,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:40,665 INFO L93 Difference]: Finished difference Result 195 states and 212 transitions. [2021-08-27 04:26:40,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 04:26:40,666 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 04:26:40,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:40,667 INFO L225 Difference]: With dead ends: 195 [2021-08-27 04:26:40,667 INFO L226 Difference]: Without dead ends: 195 [2021-08-27 04:26:40,667 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 04:26:40,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-08-27 04:26:40,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 173. [2021-08-27 04:26:40,669 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 04:26:40,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 191 transitions. [2021-08-27 04:26:40,670 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 191 transitions. Word has length 21 [2021-08-27 04:26:40,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:40,671 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 191 transitions. [2021-08-27 04:26:40,671 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 04:26:40,671 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 191 transitions. [2021-08-27 04:26:40,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 04:26:40,674 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:40,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, 1, 1, 1] [2021-08-27 04:26:40,683 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 04:26:40,883 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 04:26:40,884 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 04:26:40,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:40,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1623470821, now seen corresponding path program 1 times [2021-08-27 04:26:40,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:26:40,884 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368824090] [2021-08-27 04:26:40,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:40,885 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:26:40,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:26:40,885 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 04:26:40,890 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 04:26:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:41,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 04:26:41,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:41,117 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 04:26:41,131 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 04:26:41,162 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 04:26:41,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:26:41,214 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 04:26:41,214 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:26:41,214 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368824090] [2021-08-27 04:26:41,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368824090] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:41,215 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:41,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2021-08-27 04:26:41,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670659291] [2021-08-27 04:26:41,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 04:26:41,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:26:41,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 04:26:41,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:41,216 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 04:26:41,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:41,406 INFO L93 Difference]: Finished difference Result 171 states and 188 transitions. [2021-08-27 04:26:41,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 04:26:41,406 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 04:26:41,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:41,407 INFO L225 Difference]: With dead ends: 171 [2021-08-27 04:26:41,407 INFO L226 Difference]: Without dead ends: 171 [2021-08-27 04:26:41,407 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 55.4ms TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-08-27 04:26:41,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-08-27 04:26:41,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2021-08-27 04:26:41,409 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 04:26:41,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 188 transitions. [2021-08-27 04:26:41,409 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 188 transitions. Word has length 22 [2021-08-27 04:26:41,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:41,410 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 188 transitions. [2021-08-27 04:26:41,410 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 04:26:41,410 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 188 transitions. [2021-08-27 04:26:41,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 04:26:41,410 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:41,410 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 04:26:41,420 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 04:26:41,616 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 04:26:41,618 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 04:26:41,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:41,619 INFO L82 PathProgramCache]: Analyzing trace with hash -336639908, now seen corresponding path program 1 times [2021-08-27 04:26:41,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:26:41,619 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088069959] [2021-08-27 04:26:41,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:41,619 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:26:41,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:26:41,620 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 04:26:41,621 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 04:26:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:41,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 04:26:41,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:41,929 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 04:26:41,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:26:42,012 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 04:26:42,012 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:26:42,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088069959] [2021-08-27 04:26:42,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088069959] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:42,013 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:42,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [] total 6 [2021-08-27 04:26:42,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968131929] [2021-08-27 04:26:42,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 04:26:42,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:26:42,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 04:26:42,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-27 04:26:42,015 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 04:26:42,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:42,197 INFO L93 Difference]: Finished difference Result 175 states and 191 transitions. [2021-08-27 04:26:42,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 04:26:42,198 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 04:26:42,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:42,199 INFO L225 Difference]: With dead ends: 175 [2021-08-27 04:26:42,199 INFO L226 Difference]: Without dead ends: 175 [2021-08-27 04:26:42,199 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 56.8ms TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-08-27 04:26:42,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-08-27 04:26:42,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2021-08-27 04:26:42,201 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 04:26:42,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 187 transitions. [2021-08-27 04:26:42,201 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 187 transitions. Word has length 23 [2021-08-27 04:26:42,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:42,201 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 187 transitions. [2021-08-27 04:26:42,202 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 04:26:42,202 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2021-08-27 04:26:42,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 04:26:42,202 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:42,202 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 04:26:42,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-08-27 04:26:42,408 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 04:26:42,409 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr62REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 04:26:42,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:42,409 INFO L82 PathProgramCache]: Analyzing trace with hash -317481246, now seen corresponding path program 1 times [2021-08-27 04:26:42,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:26:42,409 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [63504065] [2021-08-27 04:26:42,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:42,410 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:26:42,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:26:42,410 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 04:26:42,411 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 04:26:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:42,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 04:26:42,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:42,629 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 04:26:42,635 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 04:26:42,663 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-08-27 04:26:42,664 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 04:26:42,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:26:42,670 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 04:26:42,727 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 04:26:42,730 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 04:26:42,760 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 04:26:42,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:26:42,867 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 04:26:42,868 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:26:42,868 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [63504065] [2021-08-27 04:26:42,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [63504065] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:42,868 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:42,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-08-27 04:26:42,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054812258] [2021-08-27 04:26:42,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 04:26:42,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:26:42,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 04:26:42,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 04:26:42,869 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 04:26:43,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:43,040 INFO L93 Difference]: Finished difference Result 168 states and 181 transitions. [2021-08-27 04:26:43,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 04:26:43,040 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 04:26:43,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:43,041 INFO L225 Difference]: With dead ends: 168 [2021-08-27 04:26:43,041 INFO L226 Difference]: Without dead ends: 168 [2021-08-27 04:26:43,041 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 35.2ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 04:26:43,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-08-27 04:26:43,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2021-08-27 04:26:43,044 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 04:26:43,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 178 transitions. [2021-08-27 04:26:43,044 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 178 transitions. Word has length 23 [2021-08-27 04:26:43,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:43,044 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 178 transitions. [2021-08-27 04:26:43,044 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 04:26:43,044 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 178 transitions. [2021-08-27 04:26:43,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 04:26:43,045 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:43,045 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 04:26:43,054 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 04:26:43,252 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 04:26:43,252 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr64REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 04:26:43,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:43,252 INFO L82 PathProgramCache]: Analyzing trace with hash -90396675, now seen corresponding path program 1 times [2021-08-27 04:26:43,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:26:43,253 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765813292] [2021-08-27 04:26:43,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:43,253 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:26:43,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:26:43,254 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 04:26:43,254 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 04:26:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:43,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 04:26:43,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:43,509 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 04:26:43,513 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 04:26:43,542 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-08-27 04:26:43,542 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 04:26:43,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:26:43,548 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 04:26:43,657 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 04:26:43,659 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 04:26:43,700 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 04:26:43,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:26:43,846 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 04:26:43,846 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:26:43,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765813292] [2021-08-27 04:26:43,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765813292] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 04:26:43,847 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:26:43,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2021-08-27 04:26:43,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719514307] [2021-08-27 04:26:43,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 04:26:43,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:26:43,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 04:26:43,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 04:26:43,848 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 04:26:43,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:43,977 INFO L93 Difference]: Finished difference Result 172 states and 185 transitions. [2021-08-27 04:26:43,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 04:26:43,977 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 04:26:43,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:43,978 INFO L225 Difference]: With dead ends: 172 [2021-08-27 04:26:43,978 INFO L226 Difference]: Without dead ends: 172 [2021-08-27 04:26:43,978 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:43,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-08-27 04:26:43,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2021-08-27 04:26:43,981 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 04:26:43,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 185 transitions. [2021-08-27 04:26:43,981 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 185 transitions. Word has length 26 [2021-08-27 04:26:43,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:43,981 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 185 transitions. [2021-08-27 04:26:43,981 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 04:26:43,982 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 185 transitions. [2021-08-27 04:26:43,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 04:26:43,982 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:43,982 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 04:26:43,994 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 04:26:44,189 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 04:26:44,189 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 04:26:44,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:44,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1492669267, now seen corresponding path program 1 times [2021-08-27 04:26:44,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:26:44,190 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359874197] [2021-08-27 04:26:44,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:44,190 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:26:44,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:26:44,191 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 04:26:44,192 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 04:26:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:44,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 04:26:44,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:44,461 INFO L354 Elim1Store]: treesize reduction 34, result has 38.2 percent of original size [2021-08-27 04:26:44,461 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 04:26:48,436 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 04:26:48,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:26:50,561 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 04:26:50,561 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:26:50,561 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359874197] [2021-08-27 04:26:50,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359874197] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 04:26:50,561 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:26:50,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2021-08-27 04:26:50,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599042001] [2021-08-27 04:26:50,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 04:26:50,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:26:50,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 04:26:50,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=77, Unknown=2, NotChecked=0, Total=110 [2021-08-27 04:26:50,562 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 04:26:52,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:52,966 INFO L93 Difference]: Finished difference Result 174 states and 186 transitions. [2021-08-27 04:26:52,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 04:26:52,966 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 04:26:52,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:52,967 INFO L225 Difference]: With dead ends: 174 [2021-08-27 04:26:52,967 INFO L226 Difference]: Without dead ends: 157 [2021-08-27 04:26:52,967 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 4141.6ms TimeCoverageRelationStatistics Valid=46, Invalid=108, Unknown=2, NotChecked=0, Total=156 [2021-08-27 04:26:52,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-08-27 04:26:52,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2021-08-27 04:26:52,969 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 04:26:52,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 169 transitions. [2021-08-27 04:26:52,970 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 169 transitions. Word has length 27 [2021-08-27 04:26:52,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:52,970 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 169 transitions. [2021-08-27 04:26:52,970 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 04:26:52,973 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 169 transitions. [2021-08-27 04:26:52,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 04:26:52,974 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:52,974 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 04:26:52,985 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 04:26:53,174 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 04:26:53,175 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 04:26:53,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:53,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1623479099, now seen corresponding path program 1 times [2021-08-27 04:26:53,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:26:53,175 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596467002] [2021-08-27 04:26:53,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:53,175 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:26:53,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:26:53,176 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 04:26:53,177 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 04:26:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:53,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-27 04:26:53,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:26:53,519 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 04:26:53,576 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 04:26:53,577 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 04:26:53,613 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 04:26:53,719 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 04:26:53,719 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 04:26:53,798 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-08-27 04:26:53,799 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 04:26:53,955 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 04:26:53,955 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 04:26:53,972 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 04:26:53,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:27:03,927 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_5 (_ BitVec 32)) (v_main_~item~0.offset_51 (_ BitVec 32))) (not (= (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_51 (_ bv0 32)) (bvadd (_ bv4 32) v_main_~item~0.offset_51) v_DerPreprocessor_5))) c_main_~head~0.base) c_main_~head~0.offset) (_ bv0 32)))) is different from false [2021-08-27 04:27:03,942 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 04:27:04,133 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 04:27:04,133 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:27:04,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596467002] [2021-08-27 04:27:04,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1596467002] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 04:27:04,134 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:27:04,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-08-27 04:27:04,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78519149] [2021-08-27 04:27:04,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-27 04:27:04,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:27:04,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 04:27:04,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=4, NotChecked=30, Total=306 [2021-08-27 04:27:04,135 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 04:27:19,784 WARN L207 SmtUtils]: Spent 10.66 s on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2021-08-27 04:27:20,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:27:20,306 INFO L93 Difference]: Finished difference Result 257 states and 276 transitions. [2021-08-27 04:27:20,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 04:27:20,307 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 04:27:20,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:27:20,308 INFO L225 Difference]: With dead ends: 257 [2021-08-27 04:27:20,308 INFO L226 Difference]: Without dead ends: 257 [2021-08-27 04:27:20,308 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 20997.6ms TimeCoverageRelationStatistics Valid=171, Invalid=585, Unknown=4, NotChecked=52, Total=812 [2021-08-27 04:27:20,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-08-27 04:27:20,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 171. [2021-08-27 04:27:20,310 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 04:27:20,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 185 transitions. [2021-08-27 04:27:20,311 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 185 transitions. Word has length 31 [2021-08-27 04:27:20,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:27:20,311 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 185 transitions. [2021-08-27 04:27:20,311 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 04:27:20,311 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 185 transitions. [2021-08-27 04:27:20,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-27 04:27:20,312 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:27:20,312 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 04:27:20,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-08-27 04:27:20,522 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 04:27:20,523 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 04:27:20,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:27:20,523 INFO L82 PathProgramCache]: Analyzing trace with hash -931329674, now seen corresponding path program 1 times [2021-08-27 04:27:20,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:27:20,523 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76802243] [2021-08-27 04:27:20,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:27:20,523 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:27:20,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:27:20,524 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 04:27:20,539 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 04:27:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:27:20,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 04:27:20,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:27:20,966 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 04:27:20,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:27:21,040 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 04:27:21,040 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:27:21,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76802243] [2021-08-27 04:27:21,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76802243] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 04:27:21,040 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:27:21,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-08-27 04:27:21,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372133243] [2021-08-27 04:27:21,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 04:27:21,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:27:21,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 04:27:21,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 04:27:21,041 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 04:27:21,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:27:21,065 INFO L93 Difference]: Finished difference Result 213 states and 226 transitions. [2021-08-27 04:27:21,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 04:27:21,066 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 04:27:21,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:27:21,066 INFO L225 Difference]: With dead ends: 213 [2021-08-27 04:27:21,067 INFO L226 Difference]: Without dead ends: 213 [2021-08-27 04:27:21,067 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 04:27:21,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-08-27 04:27:21,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 173. [2021-08-27 04:27:21,069 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 04:27:21,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 183 transitions. [2021-08-27 04:27:21,070 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 183 transitions. Word has length 32 [2021-08-27 04:27:21,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:27:21,070 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 183 transitions. [2021-08-27 04:27:21,070 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 04:27:21,070 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 183 transitions. [2021-08-27 04:27:21,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-27 04:27:21,071 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:27:21,071 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:27:21,080 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 04:27:21,278 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 04:27:21,278 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr59REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 04:27:21,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:27:21,279 INFO L82 PathProgramCache]: Analyzing trace with hash 178014059, now seen corresponding path program 1 times [2021-08-27 04:27:21,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:27:21,279 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1355651401] [2021-08-27 04:27:21,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:27:21,279 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:27:21,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:27:21,280 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 04:27:21,281 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 04:27:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:27:21,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-27 04:27:21,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:27:21,673 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 04:27:21,742 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-08-27 04:27:21,742 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 04:27:21,797 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 04:27:21,956 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 04:27:21,956 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 04:27:22,051 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-08-27 04:27:22,052 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 04:27:22,462 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 04:27:22,462 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 04:27:22,630 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 04:27:22,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:27:37,649 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 04:27:37,676 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 04:27:52,885 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 04:27:52,885 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:27:52,886 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1355651401] [2021-08-27 04:27:52,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1355651401] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 04:27:52,886 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:27:52,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2021-08-27 04:27:52,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16733097] [2021-08-27 04:27:52,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-27 04:27:52,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:27:52,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-27 04:27:52,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=325, Unknown=10, NotChecked=38, Total=462 [2021-08-27 04:27:52,887 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 04:28:10,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:28:10,277 INFO L93 Difference]: Finished difference Result 218 states and 232 transitions. [2021-08-27 04:28:10,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 04:28:10,278 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 04:28:10,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:28:10,279 INFO L225 Difference]: With dead ends: 218 [2021-08-27 04:28:10,279 INFO L226 Difference]: Without dead ends: 218 [2021-08-27 04:28:10,279 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 38535.8ms TimeCoverageRelationStatistics Valid=227, Invalid=694, Unknown=13, NotChecked=58, Total=992 [2021-08-27 04:28:10,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-08-27 04:28:10,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 183. [2021-08-27 04:28:10,281 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 04:28:10,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 196 transitions. [2021-08-27 04:28:10,282 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 196 transitions. Word has length 39 [2021-08-27 04:28:10,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:28:10,282 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 196 transitions. [2021-08-27 04:28:10,282 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 04:28:10,282 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 196 transitions. [2021-08-27 04:28:10,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-27 04:28:10,283 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:28:10,283 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 04:28:10,291 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 04:28:10,484 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 04:28:10,485 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr60REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 04:28:10,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:28:10,485 INFO L82 PathProgramCache]: Analyzing trace with hash 178014060, now seen corresponding path program 1 times [2021-08-27 04:28:10,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:28:10,485 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [185337594] [2021-08-27 04:28:10,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:28:10,485 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:28:10,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:28:10,486 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 04:28:10,488 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 04:28:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:28:10,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-27 04:28:10,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:28:10,946 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 04:28:10,994 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 04:28:11,015 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 04:28:11,015 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 04:28:11,065 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 04:28:11,075 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 04:28:11,247 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 04:28:11,247 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 04:28:11,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:28:11,266 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 04:28:11,385 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-08-27 04:28:11,385 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 04:28:11,413 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-08-27 04:28:11,413 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 04:28:11,854 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 04:28:11,854 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 04:28:11,859 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 04:28:11,859 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 04:28:11,938 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 04:28:11,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:28:14,785 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_~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_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_~item~0.base (store (store (select |c_#memory_$Pointer$.offset| c_main_~item~0.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_~item~0.base (store (store (select |c_#memory_$Pointer$.base| c_main_~item~0.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 04:28:16,820 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 04:28:18,865 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 04:28:18,912 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 04:28:19,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:28:19,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:28:19,360 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 04:28:19,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:28:19,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:28:19,366 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 04:28:19,580 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 04:28:19,581 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:28:19,581 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [185337594] [2021-08-27 04:28:19,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [185337594] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 04:28:19,581 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:28:19,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-08-27 04:28:19,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039524426] [2021-08-27 04:28:19,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-27 04:28:19,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:28:19,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-27 04:28:19,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=259, Unknown=3, NotChecked=102, Total=420 [2021-08-27 04:28:19,582 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 04:28:35,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:28:35,320 INFO L93 Difference]: Finished difference Result 288 states and 304 transitions. [2021-08-27 04:28:35,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 04:28:35,321 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 04:28:35,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:28:35,322 INFO L225 Difference]: With dead ends: 288 [2021-08-27 04:28:35,322 INFO L226 Difference]: Without dead ends: 288 [2021-08-27 04:28:35,323 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 18735.9ms TimeCoverageRelationStatistics Valid=216, Invalid=915, Unknown=3, NotChecked=198, Total=1332 [2021-08-27 04:28:35,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-08-27 04:28:35,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 187. [2021-08-27 04:28:35,325 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 04:28:35,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 200 transitions. [2021-08-27 04:28:35,325 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 200 transitions. Word has length 39 [2021-08-27 04:28:35,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:28:35,326 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 200 transitions. [2021-08-27 04:28:35,326 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 04:28:35,326 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 200 transitions. [2021-08-27 04:28:35,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-08-27 04:28:35,326 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:28:35,326 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 04:28:35,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-08-27 04:28:35,534 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 04:28:35,535 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 04:28:35,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:28:35,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1067412346, now seen corresponding path program 1 times [2021-08-27 04:28:35,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:28:35,535 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270539504] [2021-08-27 04:28:35,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:28:35,535 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:28:35,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:28:35,536 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 04:28:35,539 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 04:28:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:28:36,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 24 conjunts are in the unsatisfiable core [2021-08-27 04:28:36,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:28:36,055 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 04:28:36,135 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 04:28:36,136 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 04:28:36,177 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 04:28:36,184 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 04:28:36,361 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 04:28:36,361 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 04:28:36,391 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-08-27 04:28:36,391 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 04:28:36,511 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-08-27 04:28:36,511 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 04:28:36,516 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 04:28:36,522 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 04:28:36,523 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 04:28:37,057 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-08-27 04:28:37,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 63 treesize of output 42 [2021-08-27 04:28:37,063 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-08-27 04:28:37,064 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 04:28:37,168 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 04:28:37,225 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 04:28:37,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:28:37,513 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 04:28:38,382 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 04:28:38,730 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 04:28:43,804 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 04:28:43,804 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:28:43,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270539504] [2021-08-27 04:28:43,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270539504] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 04:28:43,804 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:28:43,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2021-08-27 04:28:43,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36204836] [2021-08-27 04:28:43,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-27 04:28:43,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:28:43,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-27 04:28:43,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=534, Unknown=2, NotChecked=0, Total=600 [2021-08-27 04:28:43,806 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 04:28:48,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:28:48,288 INFO L93 Difference]: Finished difference Result 286 states and 304 transitions. [2021-08-27 04:28:48,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-08-27 04:28:48,289 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 04:28:48,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:28:48,290 INFO L225 Difference]: With dead ends: 286 [2021-08-27 04:28:48,290 INFO L226 Difference]: Without dead ends: 286 [2021-08-27 04:28:48,290 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 7170.8ms TimeCoverageRelationStatistics Valid=277, Invalid=1613, Unknown=2, NotChecked=0, Total=1892 [2021-08-27 04:28:48,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2021-08-27 04:28:48,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 186. [2021-08-27 04:28:48,293 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 04:28:48,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 198 transitions. [2021-08-27 04:28:48,294 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 198 transitions. Word has length 42 [2021-08-27 04:28:48,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:28:48,294 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 198 transitions. [2021-08-27 04:28:48,294 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 04:28:48,294 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 198 transitions. [2021-08-27 04:28:48,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-27 04:28:48,294 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:28:48,295 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 04:28:48,304 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 04:28:48,504 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 04:28:48,505 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr64REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 04:28:48,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:28:48,505 INFO L82 PathProgramCache]: Analyzing trace with hash -259639262, now seen corresponding path program 1 times [2021-08-27 04:28:48,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:28:48,505 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144312787] [2021-08-27 04:28:48,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:28:48,506 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:28:48,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:28:48,507 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 04:28:48,508 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 04:28:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:28:49,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 04:28:49,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:28:49,101 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 04:28:49,169 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-08-27 04:28:49,170 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 04:28:49,220 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 04:28:49,402 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 04:28:49,403 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 04:28:49,511 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-08-27 04:28:49,511 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 04:28:50,044 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 04:28:50,045 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 04:28:50,198 INFO L354 Elim1Store]: treesize reduction 20, result has 28.6 percent of original size [2021-08-27 04:28:50,198 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 04:28:50,273 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 04:28:50,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:29:00,660 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~item~0.offset (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| c_main_~head~0.base (_ bv0 1)) (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_11)) c_main_~head~0.base) c_main_~head~0.offset))))))))))))))))) (_ bv1 1)))) is different from false [2021-08-27 04:29:07,621 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 04:29:13,985 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 04:29:13,986 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:29:13,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144312787] [2021-08-27 04:29:13,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144312787] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 04:29:13,986 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:29:13,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2021-08-27 04:29:13,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951207501] [2021-08-27 04:29:13,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-08-27 04:29:13,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:29:13,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-08-27 04:29:13,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=415, Unknown=7, NotChecked=42, Total=552 [2021-08-27 04:29:13,988 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 04:30:05,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:30:05,984 INFO L93 Difference]: Finished difference Result 222 states and 237 transitions. [2021-08-27 04:30:05,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 04:30:05,984 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 04:30:05,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:30:05,985 INFO L225 Difference]: With dead ends: 222 [2021-08-27 04:30:05,985 INFO L226 Difference]: Without dead ends: 222 [2021-08-27 04:30:05,985 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 58 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 34889.6ms TimeCoverageRelationStatistics Valid=175, Invalid=749, Unknown=10, NotChecked=58, Total=992 [2021-08-27 04:30:05,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-08-27 04:30:05,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 206. [2021-08-27 04:30:05,998 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 04:30:05,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 228 transitions. [2021-08-27 04:30:05,999 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 228 transitions. Word has length 44 [2021-08-27 04:30:05,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:30:05,999 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 228 transitions. [2021-08-27 04:30:05,999 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 04:30:06,000 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 228 transitions. [2021-08-27 04:30:06,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-27 04:30:06,000 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:30:06,001 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 04:30:06,013 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 04:30:06,209 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 04:30:06,209 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr65REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 04:30:06,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:30:06,209 INFO L82 PathProgramCache]: Analyzing trace with hash -259639261, now seen corresponding path program 1 times [2021-08-27 04:30:06,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:30:06,210 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539216819] [2021-08-27 04:30:06,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:30:06,210 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:30:06,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:30:06,211 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 04:30:06,211 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 04:30:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:30:06,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-27 04:30:06,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:30:06,897 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 04:30:06,965 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 04:30:06,998 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 04:30:06,998 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 04:30:07,051 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 04:30:07,065 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 04:30:07,274 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 04:30:07,274 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 04:30:07,297 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 04:30:07,298 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 04:30:07,432 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-08-27 04:30:07,432 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 04:30:07,461 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-08-27 04:30:07,462 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 04:30:08,013 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 04:30:08,013 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 04:30:08,020 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 04:30:08,020 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 04:30:08,119 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 04:30:08,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:30:11,193 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 04:30:36,574 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 04:30:37,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:30:37,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:30:37,038 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 04:30:37,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:30:37,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-27 04:30:37,043 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-27 04:30:37,256 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 04:30:37,256 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:30:37,256 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [539216819] [2021-08-27 04:30:37,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [539216819] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 04:30:37,256 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:30:37,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-08-27 04:30:37,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185097392] [2021-08-27 04:30:37,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-27 04:30:37,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:30:37,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-27 04:30:37,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=318, Unknown=6, NotChecked=36, Total=420 [2021-08-27 04:30:37,257 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 04:31:19,142 WARN L207 SmtUtils]: Spent 36.38 s on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2021-08-27 04:31:36,119 WARN L207 SmtUtils]: Spent 12.55 s on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2021-08-27 04:31:41,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:31:41,739 INFO L93 Difference]: Finished difference Result 226 states and 242 transitions. [2021-08-27 04:31:41,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 04:31:41,739 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 04:31:41,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:31:41,740 INFO L225 Difference]: With dead ends: 226 [2021-08-27 04:31:41,740 INFO L226 Difference]: Without dead ends: 226 [2021-08-27 04:31:41,741 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 84984.2ms TimeCoverageRelationStatistics Valid=280, Invalid=1050, Unknown=6, NotChecked=70, Total=1406 [2021-08-27 04:31:41,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-08-27 04:31:41,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 206. [2021-08-27 04:31:41,743 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 04:31:41,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 227 transitions. [2021-08-27 04:31:41,743 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 227 transitions. Word has length 44 [2021-08-27 04:31:41,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:31:41,743 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 227 transitions. [2021-08-27 04:31:41,744 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 04:31:41,744 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 227 transitions. [2021-08-27 04:31:41,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-27 04:31:41,744 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:31:41,744 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 04:31:41,760 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 04:31:41,952 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 04:31:41,953 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 04:31:41,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:31:41,953 INFO L82 PathProgramCache]: Analyzing trace with hash 541116366, now seen corresponding path program 1 times [2021-08-27 04:31:41,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:31:41,953 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216559269] [2021-08-27 04:31:41,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:31:41,954 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:31:41,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:31:41,954 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 04:31:41,956 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 04:31:42,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:31:42,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 04:31:42,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:31:42,794 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 04:31:42,796 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 04:31:42,851 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 04:31:42,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:31:43,052 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 04:31:43,053 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:31:43,053 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1216559269] [2021-08-27 04:31:43,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1216559269] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 04:31:43,053 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:31:43,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-08-27 04:31:43,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763819489] [2021-08-27 04:31:43,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 04:31:43,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:31:43,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 04:31:43,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-27 04:31:43,054 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 04:31:43,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:31:43,392 INFO L93 Difference]: Finished difference Result 233 states and 256 transitions. [2021-08-27 04:31:43,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 04:31:43,393 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 04:31:43,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:31:43,393 INFO L225 Difference]: With dead ends: 233 [2021-08-27 04:31:43,394 INFO L226 Difference]: Without dead ends: 233 [2021-08-27 04:31:43,394 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 101.4ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-08-27 04:31:43,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-08-27 04:31:43,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 227. [2021-08-27 04:31:43,402 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 04:31:43,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 255 transitions. [2021-08-27 04:31:43,403 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 255 transitions. Word has length 45 [2021-08-27 04:31:43,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:31:43,403 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 255 transitions. [2021-08-27 04:31:43,403 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 04:31:43,403 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 255 transitions. [2021-08-27 04:31:43,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-27 04:31:43,403 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:31:43,404 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 04:31:43,412 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 04:31:43,604 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 04:31:43,604 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 04:31:43,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:31:43,605 INFO L82 PathProgramCache]: Analyzing trace with hash -405214686, now seen corresponding path program 1 times [2021-08-27 04:31:43,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:31:43,605 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41046524] [2021-08-27 04:31:43,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:31:43,605 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:31:43,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:31:43,606 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 04:31:43,607 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 04:31:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:31:44,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 04:31:44,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:31:44,361 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 04:31:44,426 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 04:31:44,426 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 04:31:44,460 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 04:31:44,466 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 04:31:44,513 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 04:31:44,564 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 04:31:44,630 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-08-27 04:31:44,630 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 04:31:45,008 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-27 04:31:45,008 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 04:31:45,103 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 04:31:45,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:31:49,336 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~item~0.offset (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 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)) (bvadd (_ bv4 32) main_~item~0.offset) v_DerPreprocessor_14)) c_main_~head~0.base) c_main_~head~0.offset) (_ bv0 32))) is different from false [2021-08-27 04:32:05,591 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~item~0.offset_80 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_main_~item~0.base) c_main_~item~0.offset))) (store |c_#memory_$Pointer$.offset| .cse0 (store (store (select |c_#memory_$Pointer$.offset| .cse0) v_main_~item~0.offset_80 (_ bv0 32)) (bvadd (_ bv4 32) v_main_~item~0.offset_80) v_DerPreprocessor_14))) c_main_~head~0.base) c_main_~head~0.offset) (_ bv0 32))) is different from false [2021-08-27 04:32:05,605 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 04:32:06,272 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 04:32:06,272 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:32:06,272 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41046524] [2021-08-27 04:32:06,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [41046524] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-27 04:32:06,272 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 04:32:06,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2021-08-27 04:32:06,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137996548] [2021-08-27 04:32:06,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 04:32:06,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:32:06,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 04:32:06,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=219, Unknown=10, NotChecked=62, Total=342 [2021-08-27 04:32:06,273 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 04:34:32,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:34:32,549 INFO L93 Difference]: Finished difference Result 340 states and 370 transitions. [2021-08-27 04:34:32,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-27 04:34:32,550 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 04:34:32,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:34:32,551 INFO L225 Difference]: With dead ends: 340 [2021-08-27 04:34:32,551 INFO L226 Difference]: Without dead ends: 340 [2021-08-27 04:34:32,551 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 35205.9ms TimeCoverageRelationStatistics Valid=296, Invalid=956, Unknown=16, NotChecked=138, Total=1406 [2021-08-27 04:34:32,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-08-27 04:34:32,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 299. [2021-08-27 04:34:32,554 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 04:34:32,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 361 transitions. [2021-08-27 04:34:32,555 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 361 transitions. Word has length 46 [2021-08-27 04:34:32,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:34:32,556 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 361 transitions. [2021-08-27 04:34:32,556 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 04:34:32,556 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 361 transitions. [2021-08-27 04:34:32,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-27 04:34:32,556 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:34:32,556 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 04:34:32,567 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 04:34:32,765 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 04:34:32,765 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr59REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 65 more)] === [2021-08-27 04:34:32,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:34:32,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1644332691, now seen corresponding path program 1 times [2021-08-27 04:34:32,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:34:32,766 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001281303] [2021-08-27 04:34:32,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:34:32,766 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:34:32,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:34:32,767 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 04:34:32,770 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 04:34:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:34:33,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 04:34:33,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:34:33,640 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 04:34:33,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-27 04:34:33,751 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 04:34:33,751 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:34:33,751 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001281303] [2021-08-27 04:34:33,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001281303] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-27 04:34:33,751 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:34:33,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-08-27 04:34:33,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492910263] [2021-08-27 04:34:33,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 04:34:33,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-27 04:34:33,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 04:34:33,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-27 04:34:33,752 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 04:34:33,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:34:33,828 INFO L93 Difference]: Finished difference Result 261 states and 300 transitions. [2021-08-27 04:34:33,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 04:34:33,829 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 04:34:33,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:34:33,829 INFO L225 Difference]: With dead ends: 261 [2021-08-27 04:34:33,829 INFO L226 Difference]: Without dead ends: 261 [2021-08-27 04:34:33,829 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 33.7ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-08-27 04:34:33,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-08-27 04:34:33,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 240. [2021-08-27 04:34:33,832 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 04:34:33,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 283 transitions. [2021-08-27 04:34:33,832 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 283 transitions. Word has length 46 [2021-08-27 04:34:33,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:34:33,833 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 283 transitions. [2021-08-27 04:34:33,833 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 04:34:33,833 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 283 transitions. [2021-08-27 04:34:33,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-27 04:34:33,833 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:34:33,833 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 04:34:33,842 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 04:34:34,036 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 04:34:34,037 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 04:34:34,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:34:34,037 INFO L82 PathProgramCache]: Analyzing trace with hash -2020163193, now seen corresponding path program 1 times [2021-08-27 04:34:34,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-27 04:34:34,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288315694] [2021-08-27 04:34:34,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:34:34,038 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-27 04:34:34,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-27 04:34:34,038 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 04:34:34,041 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 04:34:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:34:34,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-27 04:34:34,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:34:34,869 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 04:34:34,922 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 04:34:34,922 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 04:34:34,958 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 04:34:35,090 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 04:34:35,090 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 04:34:35,175 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-08-27 04:34:35,175 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 04:34:35,306 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 04:34:35,306 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 04:34:35,360 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 04:34:35,554 INFO L354 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2021-08-27 04:34:35,555 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 04:34:35,683 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-27 04:34:35,683 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288315694] [2021-08-27 04:34:35,684 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 04:34:35,684 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [956279437] [2021-08-27 04:34:35,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:34:35,684 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-08-27 04:34:35,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-08-27 04:34:35,685 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 04:34:35,685 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 04:34:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:34:36,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-27 04:34:36,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:34:36,748 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 04:34:36,893 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 04:34:36,893 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 04:34:36,953 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 04:34:37,159 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 04:34:37,159 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 04:34:37,276 INFO L354 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2021-08-27 04:34:37,276 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 04:34:37,476 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 04:34:37,477 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 04:34:37,557 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-08-27 04:34:37,557 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 04:34:37,825 INFO L354 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2021-08-27 04:34:37,826 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 04:34:38,004 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 04:34:38,004 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007316762] [2021-08-27 04:34:38,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:34:38,005 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 04:34:38,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:34:38,005 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 04:34:38,006 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 04:34:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:34:38,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-27 04:34:38,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 04:34:39,034 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 04:34:39,034 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 04:34:39,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 20 treesize of output 16 [2021-08-27 04:34:39,210 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-08-27 04:34:39,210 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 04:34:39,299 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-08-27 04:34:39,299 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 04:34:39,468 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-27 04:34:39,468 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 04:34:39,496 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 04:34:39,614 INFO L354 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2021-08-27 04:34:39,614 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 04:34:39,730 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Alternating quantifiers not yet supported [2021-08-27 04:34:39,730 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:34:39,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-08-27 04:34:39,730 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-08-27 04:34:39,730 INFO L626 BasicCegarLoop]: Counterexample might be feasible [2021-08-27 04:34:39,733 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:34:39,734 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-08-27 04:34:39,734 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-08-27 04:34:39,734 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-08-27 04:34:39,734 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-08-27 04:34:39,734 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-08-27 04:34:39,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-08-27 04:34:39,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-08-27 04:34:39,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-08-27 04:34:39,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-08-27 04:34:39,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-08-27 04:34:39,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-08-27 04:34:39,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-08-27 04:34:39,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-08-27 04:34:39,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-08-27 04:34:39,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-08-27 04:34:39,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-08-27 04:34:39,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:34:39,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:34:39,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:34:39,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:34:39,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-08-27 04:34:39,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21REQUIRES_VIOLATION [2021-08-27 04:34:39,736 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:34:39,736 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:34:39,736 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-08-27 04:34:39,736 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-08-27 04:34:39,736 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27REQUIRES_VIOLATION [2021-08-27 04:34:39,736 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-08-27 04:34:39,736 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-08-27 04:34:39,736 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION [2021-08-27 04:34:39,736 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:34:39,736 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:34:39,736 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION [2021-08-27 04:34:39,736 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr34REQUIRES_VIOLATION [2021-08-27 04:34:39,736 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:34:39,736 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION [2021-08-27 04:34:39,736 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-08-27 04:34:39,736 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-08-27 04:34:39,737 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION [2021-08-27 04:34:39,737 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:34:39,737 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41REQUIRES_VIOLATION [2021-08-27 04:34:39,737 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42REQUIRES_VIOLATION [2021-08-27 04:34:39,737 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43REQUIRES_VIOLATION [2021-08-27 04:34:39,737 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr44REQUIRES_VIOLATION [2021-08-27 04:34:39,737 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45REQUIRES_VIOLATION [2021-08-27 04:34:39,737 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr46REQUIRES_VIOLATION [2021-08-27 04:34:39,737 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr47ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:34:39,737 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr48REQUIRES_VIOLATION [2021-08-27 04:34:39,737 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr49REQUIRES_VIOLATION [2021-08-27 04:34:39,737 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr50REQUIRES_VIOLATION [2021-08-27 04:34:39,737 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr51REQUIRES_VIOLATION [2021-08-27 04:34:39,737 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr52REQUIRES_VIOLATION [2021-08-27 04:34:39,737 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr53REQUIRES_VIOLATION [2021-08-27 04:34:39,737 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr54REQUIRES_VIOLATION [2021-08-27 04:34:39,737 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr55REQUIRES_VIOLATION [2021-08-27 04:34:39,737 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr56ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:34:39,737 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr57REQUIRES_VIOLATION [2021-08-27 04:34:39,737 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr58REQUIRES_VIOLATION [2021-08-27 04:34:39,737 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr59REQUIRES_VIOLATION [2021-08-27 04:34:39,738 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr60REQUIRES_VIOLATION [2021-08-27 04:34:39,738 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr61ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:34:39,738 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr62REQUIRES_VIOLATION [2021-08-27 04:34:39,738 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr63REQUIRES_VIOLATION [2021-08-27 04:34:39,738 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr64REQUIRES_VIOLATION [2021-08-27 04:34:39,738 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr65REQUIRES_VIOLATION [2021-08-27 04:34:39,738 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr66ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:34:39,738 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr67ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:34:39,738 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr68ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:34:39,738 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr69ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 04:34:39,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2021-08-27 04:34:39,971 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 04:34:40,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-08-27 04:34:40,351 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 04:34:40,356 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 04:34:40,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 04:34:40 BoogieIcfgContainer [2021-08-27 04:34:40,363 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 04:34:40,363 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 04:34:40,363 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 04:34:40,363 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 04:34:40,363 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:26:33" (3/4) ... [2021-08-27 04:34:40,366 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 04:34:40,366 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 04:34:40,366 INFO L168 Benchmark]: Toolchain (without parser) took 488226.78 ms. Allocated memory was 67.1 MB in the beginning and 220.2 MB in the end (delta: 153.1 MB). Free memory was 45.6 MB in the beginning and 138.0 MB in the end (delta: -92.5 MB). Peak memory consumption was 61.5 MB. Max. memory is 16.1 GB. [2021-08-27 04:34:40,367 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 67.1 MB. Free memory was 48.3 MB in the beginning and 48.3 MB in the end (delta: 47.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 04:34:40,367 INFO L168 Benchmark]: CACSL2BoogieTranslator took 392.15 ms. Allocated memory is still 67.1 MB. Free memory was 45.4 MB in the beginning and 38.9 MB in the end (delta: 6.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 04:34:40,367 INFO L168 Benchmark]: Boogie Preprocessor took 37.87 ms. Allocated memory is still 67.1 MB. Free memory was 38.9 MB in the beginning and 35.2 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 04:34:40,367 INFO L168 Benchmark]: RCFGBuilder took 801.80 ms. Allocated memory was 67.1 MB in the beginning and 86.0 MB in the end (delta: 18.9 MB). Free memory was 35.2 MB in the beginning and 42.8 MB in the end (delta: -7.6 MB). Peak memory consumption was 18.7 MB. Max. memory is 16.1 GB. [2021-08-27 04:34:40,368 INFO L168 Benchmark]: TraceAbstraction took 486987.03 ms. Allocated memory was 86.0 MB in the beginning and 220.2 MB in the end (delta: 134.2 MB). Free memory was 42.3 MB in the beginning and 138.0 MB in the end (delta: -95.7 MB). Peak memory consumption was 39.5 MB. Max. memory is 16.1 GB. [2021-08-27 04:34:40,368 INFO L168 Benchmark]: Witness Printer took 3.12 ms. Allocated memory is still 220.2 MB. Free memory is still 138.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 04:34:40,369 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 67.1 MB. Free memory was 48.3 MB in the beginning and 48.3 MB in the end (delta: 47.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 392.15 ms. Allocated memory is still 67.1 MB. Free memory was 45.4 MB in the beginning and 38.9 MB in the end (delta: 6.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 37.87 ms. Allocated memory is still 67.1 MB. Free memory was 38.9 MB in the beginning and 35.2 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 801.80 ms. Allocated memory was 67.1 MB in the beginning and 86.0 MB in the end (delta: 18.9 MB). Free memory was 35.2 MB in the beginning and 42.8 MB in the end (delta: -7.6 MB). Peak memory consumption was 18.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 486987.03 ms. Allocated memory was 86.0 MB in the beginning and 220.2 MB in the end (delta: 134.2 MB). Free memory was 42.3 MB in the beginning and 138.0 MB in the end (delta: -95.7 MB). Peak memory consumption was 39.5 MB. Max. memory is 16.1 GB. * Witness Printer took 3.12 ms. Allocated memory is still 220.2 MB. Free memory is still 138.0 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. 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: 486950.3ms, OverallIterations: 25, TraceHistogramMax: 2, EmptinessCheckTime: 17.7ms, AutomataDifference: 322922.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2716 SDtfs, 6432 SDslu, 10237 SDs, 0 SdLazy, 7698 SolverSat, 488 SolverUnsat, 90 SolverUnknown, 0 SolverNotchecked, 198126.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1404 GetRequests, 1030 SyntacticMatches, 43 SemanticMatches, 331 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 1544 ImplicationChecksByTransitivity, 245580.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=299occurred in iteration=23, InterpolantAutomatonStates: 247, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 118.4ms AutomataMinimizationTime, 24 MinimizatonAttempts, 829 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 177.6ms SsaConstructionTime, 877.2ms SatisfiabilityAnalysisTime, 144851.9ms 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 04:34:40,472 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...