./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5fbdf5bf 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/heap-manipulation/bubble_sort_linux-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d7aa8b24faa4bd1f5dc31e6b8da91b11ca919e76 ....................................................................................................................................... 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/heap-manipulation/bubble_sort_linux-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d7aa8b24faa4bd1f5dc31e6b8da91b11ca919e76 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-30 17:55:50,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-30 17:55:50,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-30 17:55:51,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-30 17:55:51,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-30 17:55:51,014 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-30 17:55:51,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-30 17:55:51,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-30 17:55:51,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-30 17:55:51,018 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-30 17:55:51,019 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-30 17:55:51,020 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-30 17:55:51,020 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-30 17:55:51,020 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-30 17:55:51,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-30 17:55:51,022 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-30 17:55:51,023 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-30 17:55:51,023 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-30 17:55:51,024 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-30 17:55:51,026 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-30 17:55:51,027 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-30 17:55:51,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-30 17:55:51,028 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-30 17:55:51,029 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-30 17:55:51,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-30 17:55:51,031 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-30 17:55:51,031 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-30 17:55:51,032 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-30 17:55:51,032 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-30 17:55:51,033 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-30 17:55:51,033 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-30 17:55:51,033 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-30 17:55:51,034 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-30 17:55:51,034 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-30 17:55:51,035 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-30 17:55:51,035 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-30 17:55:51,036 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-30 17:55:51,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-30 17:55:51,036 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-30 17:55:51,037 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-30 17:55:51,039 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-30 17:55:51,040 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-08-30 17:55:51,061 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-30 17:55:51,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-30 17:55:51,062 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-30 17:55:51,063 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-30 17:55:51,064 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-30 17:55:51,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-30 17:55:51,064 INFO L138 SettingsManager]: * Use SBE=true [2021-08-30 17:55:51,064 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-30 17:55:51,065 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-30 17:55:51,065 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-30 17:55:51,065 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-30 17:55:51,066 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-30 17:55:51,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-30 17:55:51,066 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-30 17:55:51,066 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-30 17:55:51,066 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-30 17:55:51,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-30 17:55:51,066 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-30 17:55:51,067 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-30 17:55:51,067 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-30 17:55:51,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-30 17:55:51,067 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-30 17:55:51,067 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-30 17:55:51,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-30 17:55:51,067 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-30 17:55:51,068 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-30 17:55:51,068 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-30 17:55:51,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-30 17:55:51,068 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-30 17:55:51,068 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d7aa8b24faa4bd1f5dc31e6b8da91b11ca919e76 [2021-08-30 17:55:51,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-30 17:55:51,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-30 17:55:51,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-30 17:55:51,313 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-30 17:55:51,314 INFO L275 PluginConnector]: CDTParser initialized [2021-08-30 17:55:51,315 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2021-08-30 17:55:51,364 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a49a59e0/c07e46af3d8848ae89c0b71c9485c078/FLAG12dbcfbe5 [2021-08-30 17:55:51,722 INFO L306 CDTParser]: Found 1 translation units. [2021-08-30 17:55:51,723 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2021-08-30 17:55:51,735 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a49a59e0/c07e46af3d8848ae89c0b71c9485c078/FLAG12dbcfbe5 [2021-08-30 17:55:52,087 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a49a59e0/c07e46af3d8848ae89c0b71c9485c078 [2021-08-30 17:55:52,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-30 17:55:52,092 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-30 17:55:52,093 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-30 17:55:52,093 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-30 17:55:52,095 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-30 17:55:52,096 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 05:55:52" (1/1) ... [2021-08-30 17:55:52,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@509f7568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:55:52, skipping insertion in model container [2021-08-30 17:55:52,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 05:55:52" (1/1) ... [2021-08-30 17:55:52,102 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-30 17:55:52,139 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-30 17:55:52,379 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/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2021-08-30 17:55:52,398 WARN L549 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2021-08-30 17:55:52,399 WARN L549 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2021-08-30 17:55:52,400 WARN L549 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2021-08-30 17:55:52,428 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-30 17:55:52,437 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2021-08-30 17:55:52,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2b28d555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:55:52, skipping insertion in model container [2021-08-30 17:55:52,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-30 17:55:52,439 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2021-08-30 17:55:52,440 INFO L158 Benchmark]: Toolchain (without parser) took 347.97ms. Allocated memory is still 58.7MB. Free memory was 36.6MB in the beginning and 39.1MB in the end (delta: -2.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-08-30 17:55:52,441 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 58.7MB. Free memory was 41.6MB in the beginning and 41.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-30 17:55:52,442 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.63ms. Allocated memory is still 58.7MB. Free memory was 36.4MB in the beginning and 39.1MB in the end (delta: -2.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-08-30 17:55:52,444 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.15ms. Allocated memory is still 58.7MB. Free memory was 41.6MB in the beginning and 41.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 345.63ms. Allocated memory is still 58.7MB. Free memory was 36.4MB in the beginning and 39.1MB in the end (delta: -2.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 860]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-30 17:55:53,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-30 17:55:53,783 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-30 17:55:53,827 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-30 17:55:53,828 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-30 17:55:53,830 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-30 17:55:53,831 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-30 17:55:53,835 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-30 17:55:53,837 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-30 17:55:53,840 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-30 17:55:53,841 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-30 17:55:53,844 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-30 17:55:53,844 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-30 17:55:53,846 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-30 17:55:53,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-30 17:55:53,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-30 17:55:53,850 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-30 17:55:53,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-30 17:55:53,852 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-30 17:55:53,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-30 17:55:53,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-30 17:55:53,858 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-30 17:55:53,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-30 17:55:53,861 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-30 17:55:53,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-30 17:55:53,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-30 17:55:53,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-30 17:55:53,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-30 17:55:53,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-30 17:55:53,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-30 17:55:53,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-30 17:55:53,868 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-30 17:55:53,870 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-30 17:55:53,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-30 17:55:53,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-30 17:55:53,871 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-30 17:55:53,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-30 17:55:53,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-30 17:55:53,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-30 17:55:53,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-30 17:55:53,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-30 17:55:53,874 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-08-30 17:55:53,902 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-30 17:55:53,903 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-30 17:55:53,903 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-30 17:55:53,904 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-30 17:55:53,905 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-30 17:55:53,905 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-30 17:55:53,905 INFO L138 SettingsManager]: * Use SBE=true [2021-08-30 17:55:53,906 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-30 17:55:53,906 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-30 17:55:53,906 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-30 17:55:53,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-30 17:55:53,907 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-30 17:55:53,907 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-30 17:55:53,907 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-30 17:55:53,907 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-30 17:55:53,907 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-30 17:55:53,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-30 17:55:53,908 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-30 17:55:53,908 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-30 17:55:53,908 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-30 17:55:53,908 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-30 17:55:53,908 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-30 17:55:53,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-30 17:55:53,908 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-30 17:55:53,909 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-30 17:55:53,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-30 17:55:53,909 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-30 17:55:53,909 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-30 17:55:53,909 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-30 17:55:53,909 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-30 17:55:53,909 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-30 17:55:53,909 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-30 17:55:53,910 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d7aa8b24faa4bd1f5dc31e6b8da91b11ca919e76 [2021-08-30 17:55:54,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-30 17:55:54,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-30 17:55:54,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-30 17:55:54,211 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-30 17:55:54,211 INFO L275 PluginConnector]: CDTParser initialized [2021-08-30 17:55:54,213 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2021-08-30 17:55:54,264 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c8998bbb/6dc519a9ca9f43fa94f0bbc1f90eee12/FLAGd92ba7fdc [2021-08-30 17:55:54,716 INFO L306 CDTParser]: Found 1 translation units. [2021-08-30 17:55:54,716 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2021-08-30 17:55:54,731 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c8998bbb/6dc519a9ca9f43fa94f0bbc1f90eee12/FLAGd92ba7fdc [2021-08-30 17:55:55,057 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c8998bbb/6dc519a9ca9f43fa94f0bbc1f90eee12 [2021-08-30 17:55:55,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-30 17:55:55,063 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-30 17:55:55,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-30 17:55:55,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-30 17:55:55,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-30 17:55:55,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 05:55:55" (1/1) ... [2021-08-30 17:55:55,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f0a8219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:55:55, skipping insertion in model container [2021-08-30 17:55:55,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 05:55:55" (1/1) ... [2021-08-30 17:55:55,076 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-30 17:55:55,117 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-30 17:55:55,349 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/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2021-08-30 17:55:55,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-30 17:55:55,378 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-08-30 17:55:55,382 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-30 17:55:55,395 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/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2021-08-30 17:55:55,406 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-30 17:55:55,409 INFO L203 MainTranslator]: Completed pre-run [2021-08-30 17:55:55,427 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2021-08-30 17:55:55,437 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-30 17:55:55,496 INFO L208 MainTranslator]: Completed translation [2021-08-30 17:55:55,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:55:55 WrapperNode [2021-08-30 17:55:55,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-30 17:55:55,497 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-30 17:55:55,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-30 17:55:55,498 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-30 17:55:55,504 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:55:55" (1/1) ... [2021-08-30 17:55:55,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:55:55" (1/1) ... [2021-08-30 17:55:55,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:55:55" (1/1) ... [2021-08-30 17:55:55,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:55:55" (1/1) ... [2021-08-30 17:55:55,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:55:55" (1/1) ... [2021-08-30 17:55:55,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:55:55" (1/1) ... [2021-08-30 17:55:55,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:55:55" (1/1) ... [2021-08-30 17:55:55,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-30 17:55:55,565 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-30 17:55:55,565 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-30 17:55:55,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-30 17:55:55,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:55:55" (1/1) ... [2021-08-30 17:55:55,571 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-30 17:55:55,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:55:55,586 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-30 17:55:55,604 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-30 17:55:55,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-30 17:55:55,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-30 17:55:55,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2021-08-30 17:55:55,637 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-30 17:55:55,638 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-08-30 17:55:55,638 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-08-30 17:55:55,638 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2021-08-30 17:55:55,638 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2021-08-30 17:55:55,638 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2021-08-30 17:55:55,638 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_del [2021-08-30 17:55:55,639 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2021-08-30 17:55:55,639 INFO L138 BoogieDeclarations]: Found implementation of procedure list_move [2021-08-30 17:55:55,640 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_insert [2021-08-30 17:55:55,640 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_read [2021-08-30 17:55:55,640 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_destroy [2021-08-30 17:55:55,640 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2021-08-30 17:55:55,640 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort_pass [2021-08-30 17:55:55,640 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort [2021-08-30 17:55:55,640 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-30 17:55:55,640 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-30 17:55:55,641 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-30 17:55:55,641 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-30 17:55:55,641 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-30 17:55:55,641 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-30 17:55:55,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-30 17:55:55,641 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-08-30 17:55:55,642 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-08-30 17:55:55,642 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-30 17:55:55,642 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-30 17:55:55,642 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-30 17:55:55,642 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-30 17:55:55,642 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-30 17:55:55,642 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-30 17:55:55,643 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-30 17:55:55,643 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-30 17:55:55,643 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-30 17:55:55,643 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-30 17:55:55,643 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-30 17:55:55,643 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-30 17:55:55,643 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-30 17:55:55,643 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-30 17:55:55,643 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-30 17:55:55,644 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-30 17:55:55,644 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-30 17:55:55,644 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-30 17:55:55,644 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-30 17:55:55,644 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-30 17:55:55,644 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-30 17:55:55,644 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-30 17:55:55,644 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-30 17:55:55,645 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-30 17:55:55,645 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-30 17:55:55,645 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-30 17:55:55,645 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-30 17:55:55,645 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-30 17:55:55,645 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-30 17:55:55,645 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-30 17:55:55,645 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-30 17:55:55,645 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-30 17:55:55,646 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-30 17:55:55,646 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-30 17:55:55,646 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-30 17:55:55,646 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-30 17:55:55,646 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-30 17:55:55,646 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-30 17:55:55,646 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-30 17:55:55,646 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-30 17:55:55,647 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-30 17:55:55,647 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-30 17:55:55,647 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-30 17:55:55,647 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-30 17:55:55,647 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-30 17:55:55,647 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-30 17:55:55,647 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-30 17:55:55,647 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-30 17:55:55,647 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-30 17:55:55,648 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-30 17:55:55,648 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-30 17:55:55,648 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-30 17:55:55,648 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-30 17:55:55,648 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-30 17:55:55,648 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-30 17:55:55,648 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-30 17:55:55,648 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-30 17:55:55,649 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-30 17:55:55,649 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-30 17:55:55,649 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-30 17:55:55,649 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-30 17:55:55,649 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-30 17:55:55,649 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-30 17:55:55,649 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-30 17:55:55,649 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-30 17:55:55,649 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-30 17:55:55,650 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-30 17:55:55,650 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-30 17:55:55,650 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-30 17:55:55,650 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-30 17:55:55,650 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-30 17:55:55,650 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-30 17:55:55,650 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-30 17:55:55,650 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-30 17:55:55,650 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-30 17:55:55,651 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-30 17:55:55,651 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-30 17:55:55,651 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-30 17:55:55,651 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-30 17:55:55,651 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-30 17:55:55,651 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-30 17:55:55,651 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-30 17:55:55,651 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-30 17:55:55,651 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-30 17:55:55,652 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-30 17:55:55,652 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-30 17:55:55,652 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-30 17:55:55,652 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-30 17:55:55,652 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-30 17:55:55,652 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-30 17:55:55,652 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-30 17:55:55,652 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-30 17:55:55,652 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-30 17:55:55,653 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-30 17:55:55,653 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-30 17:55:55,653 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-30 17:55:55,653 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-30 17:55:55,653 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-30 17:55:55,653 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-30 17:55:55,653 INFO L130 BoogieDeclarations]: Found specification of procedure __underflow [2021-08-30 17:55:55,653 INFO L130 BoogieDeclarations]: Found specification of procedure __uflow [2021-08-30 17:55:55,654 INFO L130 BoogieDeclarations]: Found specification of procedure __overflow [2021-08-30 17:55:55,654 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2021-08-30 17:55:55,654 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_putc [2021-08-30 17:55:55,654 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_feof [2021-08-30 17:55:55,654 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ferror [2021-08-30 17:55:55,654 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_peekc_locked [2021-08-30 17:55:55,654 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_flockfile [2021-08-30 17:55:55,654 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_funlockfile [2021-08-30 17:55:55,654 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ftrylockfile [2021-08-30 17:55:55,655 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfscanf [2021-08-30 17:55:55,655 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfprintf [2021-08-30 17:55:55,655 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_padn [2021-08-30 17:55:55,655 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_sgetn [2021-08-30 17:55:55,655 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekoff [2021-08-30 17:55:55,655 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekpos [2021-08-30 17:55:55,655 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_free_backup_area [2021-08-30 17:55:55,655 INFO L130 BoogieDeclarations]: Found specification of procedure remove [2021-08-30 17:55:55,655 INFO L130 BoogieDeclarations]: Found specification of procedure rename [2021-08-30 17:55:55,655 INFO L130 BoogieDeclarations]: Found specification of procedure renameat [2021-08-30 17:55:55,655 INFO L130 BoogieDeclarations]: Found specification of procedure tmpfile [2021-08-30 17:55:55,656 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam [2021-08-30 17:55:55,656 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam_r [2021-08-30 17:55:55,656 INFO L130 BoogieDeclarations]: Found specification of procedure tempnam [2021-08-30 17:55:55,656 INFO L130 BoogieDeclarations]: Found specification of procedure fclose [2021-08-30 17:55:55,656 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2021-08-30 17:55:55,656 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_unlocked [2021-08-30 17:55:55,656 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2021-08-30 17:55:55,656 INFO L130 BoogieDeclarations]: Found specification of procedure freopen [2021-08-30 17:55:55,656 INFO L130 BoogieDeclarations]: Found specification of procedure fdopen [2021-08-30 17:55:55,656 INFO L130 BoogieDeclarations]: Found specification of procedure fmemopen [2021-08-30 17:55:55,657 INFO L130 BoogieDeclarations]: Found specification of procedure open_memstream [2021-08-30 17:55:55,657 INFO L130 BoogieDeclarations]: Found specification of procedure setbuf [2021-08-30 17:55:55,657 INFO L130 BoogieDeclarations]: Found specification of procedure setvbuf [2021-08-30 17:55:55,657 INFO L130 BoogieDeclarations]: Found specification of procedure setbuffer [2021-08-30 17:55:55,657 INFO L130 BoogieDeclarations]: Found specification of procedure setlinebuf [2021-08-30 17:55:55,657 INFO L130 BoogieDeclarations]: Found specification of procedure fprintf [2021-08-30 17:55:55,657 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2021-08-30 17:55:55,657 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2021-08-30 17:55:55,657 INFO L130 BoogieDeclarations]: Found specification of procedure vfprintf [2021-08-30 17:55:55,657 INFO L130 BoogieDeclarations]: Found specification of procedure vprintf [2021-08-30 17:55:55,658 INFO L130 BoogieDeclarations]: Found specification of procedure vsprintf [2021-08-30 17:55:55,658 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2021-08-30 17:55:55,658 INFO L130 BoogieDeclarations]: Found specification of procedure vsnprintf [2021-08-30 17:55:55,658 INFO L130 BoogieDeclarations]: Found specification of procedure vdprintf [2021-08-30 17:55:55,658 INFO L130 BoogieDeclarations]: Found specification of procedure dprintf [2021-08-30 17:55:55,658 INFO L130 BoogieDeclarations]: Found specification of procedure fscanf [2021-08-30 17:55:55,658 INFO L130 BoogieDeclarations]: Found specification of procedure scanf [2021-08-30 17:55:55,658 INFO L130 BoogieDeclarations]: Found specification of procedure sscanf [2021-08-30 17:55:55,658 INFO L130 BoogieDeclarations]: Found specification of procedure vfscanf [2021-08-30 17:55:55,658 INFO L130 BoogieDeclarations]: Found specification of procedure vscanf [2021-08-30 17:55:55,659 INFO L130 BoogieDeclarations]: Found specification of procedure vsscanf [2021-08-30 17:55:55,659 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc [2021-08-30 17:55:55,659 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2021-08-30 17:55:55,659 INFO L130 BoogieDeclarations]: Found specification of procedure getchar [2021-08-30 17:55:55,659 INFO L130 BoogieDeclarations]: Found specification of procedure getc_unlocked [2021-08-30 17:55:55,659 INFO L130 BoogieDeclarations]: Found specification of procedure getchar_unlocked [2021-08-30 17:55:55,659 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc_unlocked [2021-08-30 17:55:55,659 INFO L130 BoogieDeclarations]: Found specification of procedure fputc [2021-08-30 17:55:55,659 INFO L130 BoogieDeclarations]: Found specification of procedure putc [2021-08-30 17:55:55,659 INFO L130 BoogieDeclarations]: Found specification of procedure putchar [2021-08-30 17:55:55,659 INFO L130 BoogieDeclarations]: Found specification of procedure fputc_unlocked [2021-08-30 17:55:55,660 INFO L130 BoogieDeclarations]: Found specification of procedure putc_unlocked [2021-08-30 17:55:55,660 INFO L130 BoogieDeclarations]: Found specification of procedure putchar_unlocked [2021-08-30 17:55:55,660 INFO L130 BoogieDeclarations]: Found specification of procedure getw [2021-08-30 17:55:55,660 INFO L130 BoogieDeclarations]: Found specification of procedure putw [2021-08-30 17:55:55,660 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2021-08-30 17:55:55,660 INFO L130 BoogieDeclarations]: Found specification of procedure gets [2021-08-30 17:55:55,660 INFO L130 BoogieDeclarations]: Found specification of procedure __getdelim [2021-08-30 17:55:55,660 INFO L130 BoogieDeclarations]: Found specification of procedure getdelim [2021-08-30 17:55:55,660 INFO L130 BoogieDeclarations]: Found specification of procedure getline [2021-08-30 17:55:55,660 INFO L130 BoogieDeclarations]: Found specification of procedure fputs [2021-08-30 17:55:55,661 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2021-08-30 17:55:55,661 INFO L130 BoogieDeclarations]: Found specification of procedure ungetc [2021-08-30 17:55:55,661 INFO L130 BoogieDeclarations]: Found specification of procedure fread [2021-08-30 17:55:55,661 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite [2021-08-30 17:55:55,661 INFO L130 BoogieDeclarations]: Found specification of procedure fread_unlocked [2021-08-30 17:55:55,661 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite_unlocked [2021-08-30 17:55:55,661 INFO L130 BoogieDeclarations]: Found specification of procedure fseek [2021-08-30 17:55:55,661 INFO L130 BoogieDeclarations]: Found specification of procedure ftell [2021-08-30 17:55:55,661 INFO L130 BoogieDeclarations]: Found specification of procedure rewind [2021-08-30 17:55:55,661 INFO L130 BoogieDeclarations]: Found specification of procedure fseeko [2021-08-30 17:55:55,662 INFO L130 BoogieDeclarations]: Found specification of procedure ftello [2021-08-30 17:55:55,662 INFO L130 BoogieDeclarations]: Found specification of procedure fgetpos [2021-08-30 17:55:55,662 INFO L130 BoogieDeclarations]: Found specification of procedure fsetpos [2021-08-30 17:55:55,662 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr [2021-08-30 17:55:55,662 INFO L130 BoogieDeclarations]: Found specification of procedure feof [2021-08-30 17:55:55,662 INFO L130 BoogieDeclarations]: Found specification of procedure ferror [2021-08-30 17:55:55,662 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr_unlocked [2021-08-30 17:55:55,662 INFO L130 BoogieDeclarations]: Found specification of procedure feof_unlocked [2021-08-30 17:55:55,662 INFO L130 BoogieDeclarations]: Found specification of procedure ferror_unlocked [2021-08-30 17:55:55,662 INFO L130 BoogieDeclarations]: Found specification of procedure perror [2021-08-30 17:55:55,663 INFO L130 BoogieDeclarations]: Found specification of procedure fileno [2021-08-30 17:55:55,663 INFO L130 BoogieDeclarations]: Found specification of procedure fileno_unlocked [2021-08-30 17:55:55,663 INFO L130 BoogieDeclarations]: Found specification of procedure popen [2021-08-30 17:55:55,663 INFO L130 BoogieDeclarations]: Found specification of procedure pclose [2021-08-30 17:55:55,663 INFO L130 BoogieDeclarations]: Found specification of procedure ctermid [2021-08-30 17:55:55,663 INFO L130 BoogieDeclarations]: Found specification of procedure flockfile [2021-08-30 17:55:55,663 INFO L130 BoogieDeclarations]: Found specification of procedure ftrylockfile [2021-08-30 17:55:55,663 INFO L130 BoogieDeclarations]: Found specification of procedure funlockfile [2021-08-30 17:55:55,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-30 17:55:55,663 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2021-08-30 17:55:55,663 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2021-08-30 17:55:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-30 17:55:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2021-08-30 17:55:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-30 17:55:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure __list_del [2021-08-30 17:55:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2021-08-30 17:55:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure list_move [2021-08-30 17:55:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure gl_insert [2021-08-30 17:55:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-30 17:55:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-30 17:55:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure gl_read [2021-08-30 17:55:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure gl_destroy [2021-08-30 17:55:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-30 17:55:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2021-08-30 17:55:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-30 17:55:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort_pass [2021-08-30 17:55:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort [2021-08-30 17:55:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-30 17:55:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-30 17:55:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-30 17:55:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-08-30 17:55:55,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-30 17:55:55,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2021-08-30 17:55:55,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-08-30 17:55:55,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-08-30 17:55:56,101 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-30 17:55:56,102 INFO L299 CfgBuilder]: Removed 41 assume(true) statements. [2021-08-30 17:55:56,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 05:55:56 BoogieIcfgContainer [2021-08-30 17:55:56,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-30 17:55:56,108 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-30 17:55:56,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-30 17:55:56,111 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-30 17:55:56,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 05:55:55" (1/3) ... [2021-08-30 17:55:56,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16877a3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 05:55:56, skipping insertion in model container [2021-08-30 17:55:56,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:55:55" (2/3) ... [2021-08-30 17:55:56,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16877a3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 05:55:56, skipping insertion in model container [2021-08-30 17:55:56,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 05:55:56" (3/3) ... [2021-08-30 17:55:56,113 INFO L111 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-1.i [2021-08-30 17:55:56,116 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-30 17:55:56,116 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 71 error locations. [2021-08-30 17:55:56,149 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-30 17:55:56,162 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-30 17:55:56,162 INFO L340 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2021-08-30 17:55:56,177 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 123 states have (on average 2.089430894308943) internal successors, (257), 213 states have internal predecessors, (257), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2021-08-30 17:55:56,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-30 17:55:56,182 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:55:56,182 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:55:56,182 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting gl_insertErr0REQUIRES_VIOLATION === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-30 17:55:56,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:55:56,186 INFO L82 PathProgramCache]: Analyzing trace with hash 963234318, now seen corresponding path program 1 times [2021-08-30 17:55:56,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:55:56,192 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601808550] [2021-08-30 17:55:56,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:55:56,193 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:55:56,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:55:56,194 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-30 17:55:56,197 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-30 17:55:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:55:56,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 1 conjunts are in the unsatisfiable core [2021-08-30 17:55:56,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:55:56,441 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-30 17:55:56,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:55:56,475 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-30 17:55:56,475 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:55:56,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601808550] [2021-08-30 17:55:56,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601808550] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 17:55:56,476 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:55:56,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-30 17:55:56,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844426241] [2021-08-30 17:55:56,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-30 17:55:56,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:55:56,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-30 17:55:56,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-30 17:55:56,509 INFO L87 Difference]: Start difference. First operand has 240 states, 123 states have (on average 2.089430894308943) internal successors, (257), 213 states have internal predecessors, (257), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:55:56,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:55:56,880 INFO L93 Difference]: Finished difference Result 236 states and 258 transitions. [2021-08-30 17:55:56,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-30 17:55:56,882 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-08-30 17:55:56,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:55:56,887 INFO L225 Difference]: With dead ends: 236 [2021-08-30 17:55:56,888 INFO L226 Difference]: Without dead ends: 233 [2021-08-30 17:55:56,889 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.07ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-30 17:55:56,891 INFO L928 BasicCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 265.13ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.36ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 341.08ms IncrementalHoareTripleChecker+Time [2021-08-30 17:55:56,891 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 212 Unknown, 0 Unchecked, 2.36ms Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 341.08ms Time] [2021-08-30 17:55:56,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-08-30 17:55:56,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2021-08-30 17:55:56,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 119 states have (on average 1.7563025210084033) internal successors, (209), 206 states have internal predecessors, (209), 31 states have call successors, (31), 14 states have call predecessors, (31), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-08-30 17:55:56,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 255 transitions. [2021-08-30 17:55:56,924 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 255 transitions. Word has length 10 [2021-08-30 17:55:56,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:55:56,924 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 255 transitions. [2021-08-30 17:55:56,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:55:56,924 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 255 transitions. [2021-08-30 17:55:56,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-30 17:55:56,925 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:55:56,925 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:55:56,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-08-30 17:55:57,130 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-30 17:55:57,131 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting gl_insertErr0REQUIRES_VIOLATION === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-30 17:55:57,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:55:57,131 INFO L82 PathProgramCache]: Analyzing trace with hash 963234380, now seen corresponding path program 1 times [2021-08-30 17:55:57,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:55:57,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1370760322] [2021-08-30 17:55:57,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:55:57,132 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:55:57,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:55:57,133 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-30 17:55:57,136 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-30 17:55:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:55:57,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-30 17:55:57,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:55:57,320 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-30 17:55:57,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:55:57,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:55:57,350 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-30 17:55:57,350 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:55:57,350 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1370760322] [2021-08-30 17:55:57,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1370760322] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 17:55:57,351 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:55:57,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-30 17:55:57,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173509827] [2021-08-30 17:55:57,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-30 17:55:57,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:55:57,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-30 17:55:57,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-30 17:55:57,378 INFO L87 Difference]: Start difference. First operand 233 states and 255 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:55:57,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:55:57,816 INFO L93 Difference]: Finished difference Result 230 states and 252 transitions. [2021-08-30 17:55:57,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-30 17:55:57,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-08-30 17:55:57,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:55:57,818 INFO L225 Difference]: With dead ends: 230 [2021-08-30 17:55:57,818 INFO L226 Difference]: Without dead ends: 230 [2021-08-30 17:55:57,818 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.88ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-30 17:55:57,819 INFO L928 BasicCegarLoop]: 46 mSDtfsCounter, 8 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 324.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.03ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 414.82ms IncrementalHoareTripleChecker+Time [2021-08-30 17:55:57,819 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 89 Invalid, 406 Unknown, 0 Unchecked, 4.03ms Time], IncrementalHoareTripleChecker [2 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 414.82ms Time] [2021-08-30 17:55:57,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-08-30 17:55:57,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2021-08-30 17:55:57,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 119 states have (on average 1.73109243697479) internal successors, (206), 203 states have internal predecessors, (206), 31 states have call successors, (31), 14 states have call predecessors, (31), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-08-30 17:55:57,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 252 transitions. [2021-08-30 17:55:57,843 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 252 transitions. Word has length 10 [2021-08-30 17:55:57,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:55:57,844 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 252 transitions. [2021-08-30 17:55:57,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:55:57,845 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 252 transitions. [2021-08-30 17:55:57,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-30 17:55:57,845 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:55:57,845 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:55:57,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-30 17:55:58,055 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-30 17:55:58,055 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting gl_insertErr1REQUIRES_VIOLATION === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-30 17:55:58,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:55:58,056 INFO L82 PathProgramCache]: Analyzing trace with hash 963234381, now seen corresponding path program 1 times [2021-08-30 17:55:58,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:55:58,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085189895] [2021-08-30 17:55:58,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:55:58,057 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:55:58,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:55:58,057 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-30 17:55:58,059 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-30 17:55:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:55:58,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-30 17:55:58,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:55:58,221 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-30 17:55:58,241 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-30 17:55:58,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:55:58,297 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-30 17:55:58,297 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:55:58,300 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085189895] [2021-08-30 17:55:58,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085189895] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 17:55:58,300 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:55:58,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-08-30 17:55:58,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145359374] [2021-08-30 17:55:58,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 17:55:58,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:55:58,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 17:55:58,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-30 17:55:58,302 INFO L87 Difference]: Start difference. First operand 230 states and 252 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:55:58,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:55:58,860 INFO L93 Difference]: Finished difference Result 227 states and 249 transitions. [2021-08-30 17:55:58,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-30 17:55:58,861 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-08-30 17:55:58,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:55:58,862 INFO L225 Difference]: With dead ends: 227 [2021-08-30 17:55:58,862 INFO L226 Difference]: Without dead ends: 227 [2021-08-30 17:55:58,862 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.57ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-30 17:55:58,863 INFO L928 BasicCegarLoop]: 46 mSDtfsCounter, 10 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 455.52ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.21ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 540.06ms IncrementalHoareTripleChecker+Time [2021-08-30 17:55:58,863 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 89 Invalid, 404 Unknown, 0 Unchecked, 3.21ms Time], IncrementalHoareTripleChecker [3 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 540.06ms Time] [2021-08-30 17:55:58,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-08-30 17:55:58,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2021-08-30 17:55:58,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 119 states have (on average 1.7058823529411764) internal successors, (203), 200 states have internal predecessors, (203), 31 states have call successors, (31), 14 states have call predecessors, (31), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-08-30 17:55:58,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 249 transitions. [2021-08-30 17:55:58,871 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 249 transitions. Word has length 10 [2021-08-30 17:55:58,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:55:58,871 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 249 transitions. [2021-08-30 17:55:58,871 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:55:58,871 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 249 transitions. [2021-08-30 17:55:58,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-30 17:55:58,872 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:55:58,872 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:55:58,893 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-30 17:55:59,096 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-30 17:55:59,098 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting list_addErr0REQUIRES_VIOLATION === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-30 17:55:59,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:55:59,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1039428672, now seen corresponding path program 1 times [2021-08-30 17:55:59,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:55:59,099 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [753722771] [2021-08-30 17:55:59,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:55:59,099 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:55:59,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:55:59,100 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-30 17:55:59,100 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-30 17:55:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:55:59,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-30 17:55:59,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:55:59,301 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-08-30 17:55:59,302 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 3 case distinctions, treesize of input 15 treesize of output 37 [2021-08-30 17:55:59,454 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-08-30 17:55:59,454 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 20 treesize of output 27 [2021-08-30 17:55:59,609 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-30 17:55:59,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:56:16,109 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-30 17:56:16,110 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:56:16,110 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [753722771] [2021-08-30 17:56:16,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [753722771] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 17:56:16,110 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:56:16,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-08-30 17:56:16,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360038528] [2021-08-30 17:56:16,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-30 17:56:16,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:56:16,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-30 17:56:16,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=50, Unknown=2, NotChecked=0, Total=72 [2021-08-30 17:56:16,112 INFO L87 Difference]: Start difference. First operand 227 states and 249 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 17:56:16,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:56:16,491 INFO L93 Difference]: Finished difference Result 234 states and 259 transitions. [2021-08-30 17:56:16,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-30 17:56:16,492 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2021-08-30 17:56:16,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:56:16,494 INFO L225 Difference]: With dead ends: 234 [2021-08-30 17:56:16,494 INFO L226 Difference]: Without dead ends: 234 [2021-08-30 17:56:16,494 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 16451.39ms TimeCoverageRelationStatistics Valid=20, Invalid=50, Unknown=2, NotChecked=0, Total=72 [2021-08-30 17:56:16,495 INFO L928 BasicCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 285.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.33ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 420 IncrementalHoareTripleChecker+Unchecked, 361.49ms IncrementalHoareTripleChecker+Time [2021-08-30 17:56:16,495 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 820 Unknown, 0 Unchecked, 3.33ms Time], IncrementalHoareTripleChecker [0 Valid, 400 Invalid, 0 Unknown, 420 Unchecked, 361.49ms Time] [2021-08-30 17:56:16,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-08-30 17:56:16,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2021-08-30 17:56:16,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 124 states have (on average 1.685483870967742) internal successors, (209), 204 states have internal predecessors, (209), 33 states have call successors, (33), 16 states have call predecessors, (33), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2021-08-30 17:56:16,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 259 transitions. [2021-08-30 17:56:16,502 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 259 transitions. Word has length 13 [2021-08-30 17:56:16,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:56:16,503 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 259 transitions. [2021-08-30 17:56:16,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 17:56:16,503 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 259 transitions. [2021-08-30 17:56:16,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-30 17:56:16,503 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:56:16,503 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:56:16,523 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-30 17:56:16,710 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-30 17:56:16,710 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting list_addErr1REQUIRES_VIOLATION === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-30 17:56:16,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:56:16,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1039428673, now seen corresponding path program 1 times [2021-08-30 17:56:16,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:56:16,711 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578935800] [2021-08-30 17:56:16,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:56:16,711 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:56:16,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:56:16,712 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-30 17:56:16,713 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-30 17:56:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:56:16,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-30 17:56:16,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:56:16,877 INFO L354 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2021-08-30 17:56:16,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 42 [2021-08-30 17:56:16,922 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-08-30 17:56:16,923 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 3 case distinctions, treesize of input 42 treesize of output 63 [2021-08-30 17:56:17,225 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-08-30 17:56:17,226 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 3 case distinctions, treesize of input 44 treesize of output 51 [2021-08-30 17:56:17,266 INFO L354 Elim1Store]: treesize reduction 2, result has 92.0 percent of original size [2021-08-30 17:56:17,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 64 [2021-08-30 17:56:17,599 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-30 17:56:17,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:56:24,344 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-30 17:56:24,344 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:56:24,344 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578935800] [2021-08-30 17:56:24,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578935800] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 17:56:24,344 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:56:24,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2021-08-30 17:56:24,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502496299] [2021-08-30 17:56:24,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-30 17:56:24,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:56:24,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-30 17:56:24,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=65, Unknown=2, NotChecked=0, Total=90 [2021-08-30 17:56:24,345 INFO L87 Difference]: Start difference. First operand 234 states and 259 transitions. Second operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 17:56:27,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:56:27,322 INFO L93 Difference]: Finished difference Result 341 states and 380 transitions. [2021-08-30 17:56:27,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-30 17:56:27,323 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2021-08-30 17:56:27,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:56:27,325 INFO L225 Difference]: With dead ends: 341 [2021-08-30 17:56:27,325 INFO L226 Difference]: Without dead ends: 341 [2021-08-30 17:56:27,325 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 6509.33ms TimeCoverageRelationStatistics Valid=23, Invalid=65, Unknown=2, NotChecked=0, Total=90 [2021-08-30 17:56:27,325 INFO L928 BasicCegarLoop]: 65 mSDtfsCounter, 199 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2560.61ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 1823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.59ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 695 IncrementalHoareTripleChecker+Unchecked, 2927.15ms IncrementalHoareTripleChecker+Time [2021-08-30 17:56:27,326 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 193 Invalid, 1823 Unknown, 0 Unchecked, 10.59ms Time], IncrementalHoareTripleChecker [9 Valid, 1119 Invalid, 0 Unknown, 695 Unchecked, 2927.15ms Time] [2021-08-30 17:56:27,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-08-30 17:56:27,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 292. [2021-08-30 17:56:27,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 182 states have (on average 1.7087912087912087) internal successors, (311), 259 states have internal predecessors, (311), 34 states have call successors, (34), 18 states have call predecessors, (34), 13 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2021-08-30 17:56:27,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 363 transitions. [2021-08-30 17:56:27,333 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 363 transitions. Word has length 13 [2021-08-30 17:56:27,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:56:27,334 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 363 transitions. [2021-08-30 17:56:27,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 17:56:27,334 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 363 transitions. [2021-08-30 17:56:27,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-30 17:56:27,334 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:56:27,334 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:56:27,345 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-30 17:56:27,541 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-30 17:56:27,543 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __list_addErr0REQUIRES_VIOLATION === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-30 17:56:27,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:56:27,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1094064828, now seen corresponding path program 1 times [2021-08-30 17:56:27,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:56:27,544 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [606186926] [2021-08-30 17:56:27,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:56:27,544 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:56:27,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:56:27,545 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-30 17:56:27,546 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-30 17:56:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:56:27,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 27 conjunts are in the unsatisfiable core [2021-08-30 17:56:27,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:56:27,753 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-08-30 17:56:27,753 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 3 case distinctions, treesize of input 15 treesize of output 37 [2021-08-30 17:56:27,978 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-30 17:56:27,978 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 14 treesize of output 14 [2021-08-30 17:56:28,040 INFO L354 Elim1Store]: treesize reduction 336, result has 2.0 percent of original size [2021-08-30 17:56:28,040 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 4 case distinctions, treesize of input 60 treesize of output 15 [2021-08-30 17:56:28,083 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 25 treesize of output 17 [2021-08-30 17:56:28,130 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-30 17:56:28,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:56:28,192 INFO L354 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2021-08-30 17:56:28,193 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 29 treesize of output 28 [2021-08-30 17:56:42,564 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (gl_insert_~node~1.offset (_ BitVec 32)) (v_gl_insert_~node~1.base_19 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_gl_insert_~node~1.base_19))))))) (= |c_~#gl_list~0.base| (select (select (store |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_19 (store (store (store (store (select |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_19) gl_insert_~node~1.offset v_DerPreprocessor_1) (bvadd gl_insert_~node~1.offset (_ bv1 32)) v_DerPreprocessor_2) (bvadd (_ bv2 32) gl_insert_~node~1.offset) v_DerPreprocessor_3) (bvadd gl_insert_~node~1.offset (_ bv3 32)) v_DerPreprocessor_4)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) is different from false [2021-08-30 17:56:44,598 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (gl_insert_~node~1.offset (_ BitVec 32)) (v_gl_insert_~node~1.base_19 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_gl_insert_~node~1.base_19)))))))) (= |c_~#gl_list~0.base| (select (select (store |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_19 (store (store (store (store (select |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_19) gl_insert_~node~1.offset v_DerPreprocessor_1) (bvadd gl_insert_~node~1.offset (_ bv1 32)) v_DerPreprocessor_2) (bvadd (_ bv2 32) gl_insert_~node~1.offset) v_DerPreprocessor_3) (bvadd gl_insert_~node~1.offset (_ bv3 32)) v_DerPreprocessor_4)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) is different from false [2021-08-30 17:56:44,738 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-30 17:56:44,738 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:56:44,738 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [606186926] [2021-08-30 17:56:44,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [606186926] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 17:56:44,738 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:56:44,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 11] imperfect sequences [] total 13 [2021-08-30 17:56:44,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250876166] [2021-08-30 17:56:44,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-30 17:56:44,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:56:44,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-30 17:56:44,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=8, NotChecked=42, Total=182 [2021-08-30 17:56:44,739 INFO L87 Difference]: Start difference. First operand 292 states and 363 transitions. Second operand has 14 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 6 states have call successors, (9), 7 states have call predecessors, (9), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 17:56:48,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:56:48,545 INFO L93 Difference]: Finished difference Result 308 states and 379 transitions. [2021-08-30 17:56:48,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-30 17:56:48,547 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 6 states have call successors, (9), 7 states have call predecessors, (9), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2021-08-30 17:56:48,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:56:48,549 INFO L225 Difference]: With dead ends: 308 [2021-08-30 17:56:48,549 INFO L226 Difference]: Without dead ends: 308 [2021-08-30 17:56:48,549 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 18562.52ms TimeCoverageRelationStatistics Valid=80, Invalid=261, Unknown=9, NotChecked=70, Total=420 [2021-08-30 17:56:48,549 INFO L928 BasicCegarLoop]: 48 mSDtfsCounter, 44 mSDsluCounter, 1968 mSDsCounter, 0 mSdLazyCounter, 1644 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1407.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 2549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.84ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 893 IncrementalHoareTripleChecker+Unchecked, 1610.13ms IncrementalHoareTripleChecker+Time [2021-08-30 17:56:48,550 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 499 Invalid, 2549 Unknown, 0 Unchecked, 9.84ms Time], IncrementalHoareTripleChecker [12 Valid, 1644 Invalid, 0 Unknown, 893 Unchecked, 1610.13ms Time] [2021-08-30 17:56:48,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-08-30 17:56:48,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 300. [2021-08-30 17:56:48,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 188 states have (on average 1.7234042553191489) internal successors, (324), 266 states have internal predecessors, (324), 35 states have call successors, (35), 19 states have call predecessors, (35), 14 states have return successors, (19), 15 states have call predecessors, (19), 19 states have call successors, (19) [2021-08-30 17:56:48,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 378 transitions. [2021-08-30 17:56:48,556 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 378 transitions. Word has length 16 [2021-08-30 17:56:48,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:56:48,556 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 378 transitions. [2021-08-30 17:56:48,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 6 states have call successors, (9), 7 states have call predecessors, (9), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 17:56:48,556 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 378 transitions. [2021-08-30 17:56:48,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-30 17:56:48,557 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:56:48,557 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:56:48,566 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-30 17:56:48,760 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-30 17:56:48,761 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __list_addErr1REQUIRES_VIOLATION === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-30 17:56:48,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:56:48,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1094064827, now seen corresponding path program 1 times [2021-08-30 17:56:48,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:56:48,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718021841] [2021-08-30 17:56:48,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:56:48,762 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:56:48,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:56:48,763 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-30 17:56:48,764 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-30 17:56:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:56:48,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 48 conjunts are in the unsatisfiable core [2021-08-30 17:56:48,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:56:48,991 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-08-30 17:56:48,992 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 3 case distinctions, treesize of input 28 treesize of output 49 [2021-08-30 17:56:49,032 INFO L354 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2021-08-30 17:56:49,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 63 [2021-08-30 17:56:49,413 INFO L354 Elim1Store]: treesize reduction -2, result has 108.0 percent of original size [2021-08-30 17:56:49,413 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 65 [2021-08-30 17:56:49,447 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-08-30 17:56:49,447 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 3 case distinctions, treesize of input 60 treesize of output 67 [2021-08-30 17:56:49,628 INFO L354 Elim1Store]: treesize reduction 336, result has 2.0 percent of original size [2021-08-30 17:56:49,630 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 4 case distinctions, treesize of input 116 treesize of output 71 [2021-08-30 17:56:49,672 INFO L354 Elim1Store]: treesize reduction 336, result has 2.0 percent of original size [2021-08-30 17:56:49,673 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 4 case distinctions, treesize of input 68 treesize of output 23 [2021-08-30 17:56:49,833 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 34 treesize of output 26 [2021-08-30 17:56:49,836 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 23 treesize of output 15 [2021-08-30 17:56:49,932 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-30 17:56:49,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:57:04,868 WARN L210 SmtUtils]: Spent 6.32s on a formula simplification that was a NOOP. DAG size: 47 [2021-08-30 17:57:07,004 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_gl_insert_~node~1.base_20 (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| v_gl_insert_~node~1.base_20 (store (store (store (store (select |c_#memory_$Pointer$.offset| v_gl_insert_~node~1.base_20) gl_insert_~node~1.offset v_DerPreprocessor_9) (bvadd gl_insert_~node~1.offset (_ bv1 32)) v_DerPreprocessor_10) (bvadd (_ bv2 32) gl_insert_~node~1.offset) v_DerPreprocessor_11) (bvadd gl_insert_~node~1.offset (_ bv3 32)) v_DerPreprocessor_12)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse1 (bvadd gl_insert_~node~1.offset (_ bv1 32))) (.cse2 (bvadd (_ bv2 32) gl_insert_~node~1.offset)) (.cse3 (bvadd gl_insert_~node~1.offset (_ bv3 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| v_gl_insert_~node~1.base_20 (store (store (store (store (select |c_#memory_$Pointer$.offset| v_gl_insert_~node~1.base_20) gl_insert_~node~1.offset v_DerPreprocessor_9) .cse1 v_DerPreprocessor_10) .cse2 v_DerPreprocessor_11) .cse3 v_DerPreprocessor_12)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) (_ bv8 32)) (select (store |c_#length| v_gl_insert_~node~1.base_20 (_ bv20 32)) (select (select (store |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_20 (store (store (store (store (select |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_20) gl_insert_~node~1.offset v_DerPreprocessor_5) .cse1 v_DerPreprocessor_6) .cse2 v_DerPreprocessor_7) .cse3 v_DerPreprocessor_8)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_gl_insert_~node~1.base_20))))))) is different from false [2021-08-30 17:57:09,130 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_gl_insert_~node~1.base_20 (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| v_gl_insert_~node~1.base_20 (store (store (store (store (select |c_#memory_$Pointer$.offset| v_gl_insert_~node~1.base_20) gl_insert_~node~1.offset v_DerPreprocessor_9) (bvadd gl_insert_~node~1.offset (_ bv1 32)) v_DerPreprocessor_10) (bvadd (_ bv2 32) gl_insert_~node~1.offset) v_DerPreprocessor_11) (bvadd gl_insert_~node~1.offset (_ bv3 32)) v_DerPreprocessor_12)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse1 (bvadd gl_insert_~node~1.offset (_ bv1 32))) (.cse2 (bvadd (_ bv2 32) gl_insert_~node~1.offset)) (.cse3 (bvadd gl_insert_~node~1.offset (_ bv3 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| v_gl_insert_~node~1.base_20 (store (store (store (store (select |c_#memory_$Pointer$.offset| v_gl_insert_~node~1.base_20) gl_insert_~node~1.offset v_DerPreprocessor_9) .cse1 v_DerPreprocessor_10) .cse2 v_DerPreprocessor_11) .cse3 v_DerPreprocessor_12)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) (_ bv8 32)) (select (store |c_#length| v_gl_insert_~node~1.base_20 (_ bv20 32)) (select (select (store |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_20 (store (store (store (store (select |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_20) gl_insert_~node~1.offset v_DerPreprocessor_5) .cse1 v_DerPreprocessor_6) .cse2 v_DerPreprocessor_7) .cse3 v_DerPreprocessor_8)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_#valid| v_gl_insert_~node~1.base_20)))))))) is different from false [2021-08-30 17:57:11,265 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_gl_insert_~node~1.base_20 (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| v_gl_insert_~node~1.base_20 (store (store (store (store (select |c_#memory_$Pointer$.offset| v_gl_insert_~node~1.base_20) gl_insert_~node~1.offset v_DerPreprocessor_9) (bvadd gl_insert_~node~1.offset (_ bv1 32)) v_DerPreprocessor_10) (bvadd (_ bv2 32) gl_insert_~node~1.offset) v_DerPreprocessor_11) (bvadd gl_insert_~node~1.offset (_ bv3 32)) v_DerPreprocessor_12)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse1 (bvadd gl_insert_~node~1.offset (_ bv1 32))) (.cse2 (bvadd (_ bv2 32) gl_insert_~node~1.offset)) (.cse3 (bvadd gl_insert_~node~1.offset (_ bv3 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| v_gl_insert_~node~1.base_20 (store (store (store (store (select |c_#memory_$Pointer$.offset| v_gl_insert_~node~1.base_20) gl_insert_~node~1.offset v_DerPreprocessor_9) .cse1 v_DerPreprocessor_10) .cse2 v_DerPreprocessor_11) .cse3 v_DerPreprocessor_12)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) (_ bv8 32)) (select (store |c_#length| v_gl_insert_~node~1.base_20 (_ bv20 32)) (select (select (store |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_20 (store (store (store (store (select |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_20) gl_insert_~node~1.offset v_DerPreprocessor_5) .cse1 v_DerPreprocessor_6) .cse2 v_DerPreprocessor_7) .cse3 v_DerPreprocessor_8)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_gl_insert_~node~1.base_20)))))))))) is different from false [2021-08-30 17:57:24,285 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-30 17:57:24,286 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:57:24,286 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [718021841] [2021-08-30 17:57:24,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [718021841] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 17:57:24,286 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:57:24,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 12] imperfect sequences [] total 20 [2021-08-30 17:57:24,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859093627] [2021-08-30 17:57:24,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-30 17:57:24,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:57:24,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-30 17:57:24,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=257, Unknown=10, NotChecked=102, Total=420 [2021-08-30 17:57:24,287 INFO L87 Difference]: Start difference. First operand 300 states and 378 transitions. Second operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 9 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 17:57:26,375 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#gl_list~0.base| (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (forall ((v_gl_insert_~node~1.base_20 (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| v_gl_insert_~node~1.base_20 (store (store (store (store (select |c_#memory_$Pointer$.offset| v_gl_insert_~node~1.base_20) gl_insert_~node~1.offset v_DerPreprocessor_9) (bvadd gl_insert_~node~1.offset (_ bv1 32)) v_DerPreprocessor_10) (bvadd (_ bv2 32) gl_insert_~node~1.offset) v_DerPreprocessor_11) (bvadd gl_insert_~node~1.offset (_ bv3 32)) v_DerPreprocessor_12)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse1 (bvadd gl_insert_~node~1.offset (_ bv1 32))) (.cse2 (bvadd (_ bv2 32) gl_insert_~node~1.offset)) (.cse3 (bvadd gl_insert_~node~1.offset (_ bv3 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| v_gl_insert_~node~1.base_20 (store (store (store (store (select |c_#memory_$Pointer$.offset| v_gl_insert_~node~1.base_20) gl_insert_~node~1.offset v_DerPreprocessor_9) .cse1 v_DerPreprocessor_10) .cse2 v_DerPreprocessor_11) .cse3 v_DerPreprocessor_12)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) (_ bv8 32)) (select (store |c_#length| v_gl_insert_~node~1.base_20 (_ bv20 32)) (select (select (store |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_20 (store (store (store (store (select |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_20) gl_insert_~node~1.offset v_DerPreprocessor_5) .cse1 v_DerPreprocessor_6) .cse2 v_DerPreprocessor_7) .cse3 v_DerPreprocessor_8)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_gl_insert_~node~1.base_20)))))))))) (let ((.cse4 (select |c_#length| (_ bv0 32)))) (or (= (_ bv22 32) .cse4) (= |c_~#gl_list~0.base| (_ bv0 32)) (= (_ bv2 32) .cse4) (= (_ bv0 1) (select |c_#valid| (_ bv0 32))))) (= (select (select |c_#memory_$Pointer$.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) |c_~#gl_list~0.offset|) (= |c_~#gl_list~0.offset| (_ bv0 32)) (= (_ bv8 32) (select |c_#length| |c_~#gl_list~0.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| |c_~#gl_list~0.base|))))) is different from false [2021-08-30 17:57:28,482 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#gl_list~0.base| (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (let ((.cse0 (select |c_#length| (_ bv0 32)))) (or (= (_ bv22 32) .cse0) (= |c_~#gl_list~0.base| (_ bv0 32)) (= (_ bv2 32) .cse0) (= (_ bv0 1) (select |c_#valid| (_ bv0 32))))) (= (select (select |c_#memory_$Pointer$.offset| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) |c_~#gl_list~0.offset|) (= |c_~#gl_list~0.offset| (_ bv0 32)) (= (_ bv8 32) (select |c_#length| |c_~#gl_list~0.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| |c_~#gl_list~0.base|)))) (forall ((v_gl_insert_~node~1.base_20 (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| v_gl_insert_~node~1.base_20 (store (store (store (store (select |c_#memory_$Pointer$.offset| v_gl_insert_~node~1.base_20) gl_insert_~node~1.offset v_DerPreprocessor_9) (bvadd gl_insert_~node~1.offset (_ bv1 32)) v_DerPreprocessor_10) (bvadd (_ bv2 32) gl_insert_~node~1.offset) v_DerPreprocessor_11) (bvadd gl_insert_~node~1.offset (_ bv3 32)) v_DerPreprocessor_12)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))) (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse2 (bvadd gl_insert_~node~1.offset (_ bv1 32))) (.cse3 (bvadd (_ bv2 32) gl_insert_~node~1.offset)) (.cse4 (bvadd gl_insert_~node~1.offset (_ bv3 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| v_gl_insert_~node~1.base_20 (store (store (store (store (select |c_#memory_$Pointer$.offset| v_gl_insert_~node~1.base_20) gl_insert_~node~1.offset v_DerPreprocessor_9) .cse2 v_DerPreprocessor_10) .cse3 v_DerPreprocessor_11) .cse4 v_DerPreprocessor_12)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) (_ bv8 32)) (select (store |c_#length| v_gl_insert_~node~1.base_20 (_ bv20 32)) (select (select (store |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_20 (store (store (store (store (select |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_20) gl_insert_~node~1.offset v_DerPreprocessor_5) .cse2 v_DerPreprocessor_6) .cse3 v_DerPreprocessor_7) .cse4 v_DerPreprocessor_8)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_gl_insert_~node~1.base_20)))))))) is different from false [2021-08-30 17:57:33,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:57:33,769 INFO L93 Difference]: Finished difference Result 301 states and 378 transitions. [2021-08-30 17:57:33,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-30 17:57:33,770 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 9 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2021-08-30 17:57:33,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:57:33,772 INFO L225 Difference]: With dead ends: 301 [2021-08-30 17:57:33,772 INFO L226 Difference]: Without dead ends: 301 [2021-08-30 17:57:33,773 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 39842.97ms TimeCoverageRelationStatistics Valid=61, Invalid=288, Unknown=13, NotChecked=190, Total=552 [2021-08-30 17:57:33,773 INFO L928 BasicCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 2315 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2760.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 3035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.99ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1844 IncrementalHoareTripleChecker+Unchecked, 3135.51ms IncrementalHoareTripleChecker+Time [2021-08-30 17:57:33,774 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 654 Invalid, 3035 Unknown, 0 Unchecked, 13.99ms Time], IncrementalHoareTripleChecker [0 Valid, 1191 Invalid, 0 Unknown, 1844 Unchecked, 3135.51ms Time] [2021-08-30 17:57:33,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-08-30 17:57:33,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 300. [2021-08-30 17:57:33,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 188 states have (on average 1.7180851063829787) internal successors, (323), 266 states have internal predecessors, (323), 35 states have call successors, (35), 19 states have call predecessors, (35), 14 states have return successors, (19), 15 states have call predecessors, (19), 19 states have call successors, (19) [2021-08-30 17:57:33,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 377 transitions. [2021-08-30 17:57:33,779 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 377 transitions. Word has length 16 [2021-08-30 17:57:33,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:57:33,779 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 377 transitions. [2021-08-30 17:57:33,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 9 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 17:57:33,780 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 377 transitions. [2021-08-30 17:57:33,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-30 17:57:33,780 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:57:33,780 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:57:33,787 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-30 17:57:33,984 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-30 17:57:33,985 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __list_addErr2REQUIRES_VIOLATION === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-30 17:57:33,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:57:33,986 INFO L82 PathProgramCache]: Analyzing trace with hash 443729184, now seen corresponding path program 1 times [2021-08-30 17:57:33,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:57:33,986 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603398175] [2021-08-30 17:57:33,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:57:33,986 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:57:33,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:57:33,987 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-30 17:57:33,988 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-30 17:57:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:57:34,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-30 17:57:34,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:57:34,118 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-30 17:57:34,172 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-30 17:57:34,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:57:34,225 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-30 17:57:34,225 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:57:34,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603398175] [2021-08-30 17:57:34,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603398175] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 17:57:34,225 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:57:34,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2021-08-30 17:57:34,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601933449] [2021-08-30 17:57:34,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-30 17:57:34,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:57:34,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-30 17:57:34,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-30 17:57:34,226 INFO L87 Difference]: Start difference. First operand 300 states and 377 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:57:35,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:57:35,440 INFO L93 Difference]: Finished difference Result 320 states and 394 transitions. [2021-08-30 17:57:35,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-30 17:57:35,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-08-30 17:57:35,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:57:35,442 INFO L225 Difference]: With dead ends: 320 [2021-08-30 17:57:35,442 INFO L226 Difference]: Without dead ends: 320 [2021-08-30 17:57:35,442 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 60.45ms TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-30 17:57:35,442 INFO L928 BasicCegarLoop]: 45 mSDtfsCounter, 42 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1025.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.60ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1167.50ms IncrementalHoareTripleChecker+Time [2021-08-30 17:57:35,442 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 249 Invalid, 1220 Unknown, 0 Unchecked, 5.60ms Time], IncrementalHoareTripleChecker [5 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1167.50ms Time] [2021-08-30 17:57:35,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2021-08-30 17:57:35,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 312. [2021-08-30 17:57:35,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 198 states have (on average 1.707070707070707) internal successors, (338), 275 states have internal predecessors, (338), 36 states have call successors, (36), 21 states have call predecessors, (36), 16 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2021-08-30 17:57:35,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 394 transitions. [2021-08-30 17:57:35,454 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 394 transitions. Word has length 17 [2021-08-30 17:57:35,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:57:35,454 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 394 transitions. [2021-08-30 17:57:35,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:57:35,454 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 394 transitions. [2021-08-30 17:57:35,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-30 17:57:35,455 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:57:35,455 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:57:35,464 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-30 17:57:35,656 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-30 17:57:35,659 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __list_addErr3REQUIRES_VIOLATION === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-30 17:57:35,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:57:35,659 INFO L82 PathProgramCache]: Analyzing trace with hash 443729185, now seen corresponding path program 1 times [2021-08-30 17:57:35,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:57:35,659 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325810932] [2021-08-30 17:57:35,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:57:35,659 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:57:35,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:57:35,660 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-30 17:57:35,661 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-30 17:57:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:57:35,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-30 17:57:35,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:57:35,790 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-30 17:57:35,890 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-30 17:57:35,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:57:36,192 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-30 17:57:36,192 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:57:36,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325810932] [2021-08-30 17:57:36,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325810932] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 17:57:36,192 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:57:36,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2021-08-30 17:57:36,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438366245] [2021-08-30 17:57:36,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-30 17:57:36,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:57:36,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-30 17:57:36,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-08-30 17:57:36,193 INFO L87 Difference]: Start difference. First operand 312 states and 394 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 8 states have internal predecessors, (18), 5 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:57:40,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:57:40,165 INFO L93 Difference]: Finished difference Result 318 states and 390 transitions. [2021-08-30 17:57:40,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-30 17:57:40,166 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 8 states have internal predecessors, (18), 5 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-08-30 17:57:40,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:57:40,167 INFO L225 Difference]: With dead ends: 318 [2021-08-30 17:57:40,167 INFO L226 Difference]: Without dead ends: 318 [2021-08-30 17:57:40,167 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 302.47ms TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-08-30 17:57:40,168 INFO L928 BasicCegarLoop]: 45 mSDtfsCounter, 44 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 2030 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3487.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 2035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.30ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3881.75ms IncrementalHoareTripleChecker+Time [2021-08-30 17:57:40,168 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 413 Invalid, 2035 Unknown, 0 Unchecked, 8.30ms Time], IncrementalHoareTripleChecker [5 Valid, 2030 Invalid, 0 Unknown, 0 Unchecked, 3881.75ms Time] [2021-08-30 17:57:40,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2021-08-30 17:57:40,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 312. [2021-08-30 17:57:40,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 198 states have (on average 1.6868686868686869) internal successors, (334), 275 states have internal predecessors, (334), 36 states have call successors, (36), 21 states have call predecessors, (36), 16 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2021-08-30 17:57:40,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 390 transitions. [2021-08-30 17:57:40,173 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 390 transitions. Word has length 17 [2021-08-30 17:57:40,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:57:40,173 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 390 transitions. [2021-08-30 17:57:40,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 8 states have internal predecessors, (18), 5 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:57:40,174 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 390 transitions. [2021-08-30 17:57:40,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-30 17:57:40,174 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:57:40,174 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:57:40,183 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-30 17:57:40,381 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-30 17:57:40,381 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __list_addErr6REQUIRES_VIOLATION === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-30 17:57:40,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:57:40,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1221999107, now seen corresponding path program 1 times [2021-08-30 17:57:40,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:57:40,382 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369860939] [2021-08-30 17:57:40,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:57:40,382 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:57:40,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:57:40,383 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-30 17:57:40,383 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-30 17:57:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:57:40,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-30 17:57:40,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:57:40,546 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-30 17:57:40,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:57:40,590 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-30 17:57:40,590 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:57:40,590 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369860939] [2021-08-30 17:57:40,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369860939] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 17:57:40,590 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:57:40,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-30 17:57:40,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814705334] [2021-08-30 17:57:40,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-30 17:57:40,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:57:40,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-30 17:57:40,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-30 17:57:40,591 INFO L87 Difference]: Start difference. First operand 312 states and 390 transitions. Second operand has 5 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:57:41,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:57:41,397 INFO L93 Difference]: Finished difference Result 311 states and 387 transitions. [2021-08-30 17:57:41,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-30 17:57:41,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-08-30 17:57:41,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:57:41,399 INFO L225 Difference]: With dead ends: 311 [2021-08-30 17:57:41,399 INFO L226 Difference]: Without dead ends: 311 [2021-08-30 17:57:41,399 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.21ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-30 17:57:41,400 INFO L928 BasicCegarLoop]: 45 mSDtfsCounter, 22 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 679.80ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.91ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 777.96ms IncrementalHoareTripleChecker+Time [2021-08-30 17:57:41,400 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 171 Invalid, 780 Unknown, 0 Unchecked, 2.91ms Time], IncrementalHoareTripleChecker [0 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 777.96ms Time] [2021-08-30 17:57:41,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2021-08-30 17:57:41,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2021-08-30 17:57:41,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 198 states have (on average 1.6717171717171717) internal successors, (331), 274 states have internal predecessors, (331), 36 states have call successors, (36), 21 states have call predecessors, (36), 16 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2021-08-30 17:57:41,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 387 transitions. [2021-08-30 17:57:41,406 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 387 transitions. Word has length 19 [2021-08-30 17:57:41,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:57:41,406 INFO L470 AbstractCegarLoop]: Abstraction has 311 states and 387 transitions. [2021-08-30 17:57:41,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:57:41,406 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 387 transitions. [2021-08-30 17:57:41,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-30 17:57:41,407 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:57:41,407 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:57:41,429 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-30 17:57:41,624 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-30 17:57:41,625 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __list_addErr7REQUIRES_VIOLATION === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-30 17:57:41,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:57:41,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1221999108, now seen corresponding path program 1 times [2021-08-30 17:57:41,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:57:41,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332830650] [2021-08-30 17:57:41,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:57:41,625 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:57:41,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:57:41,626 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-30 17:57:41,627 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-30 17:57:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:57:41,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-30 17:57:41,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:57:41,883 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-30 17:57:41,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:57:42,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-08-30 17:57:42,248 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-30 17:57:42,248 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:57:42,248 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332830650] [2021-08-30 17:57:42,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1332830650] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 17:57:42,248 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:57:42,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2021-08-30 17:57:42,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588537258] [2021-08-30 17:57:42,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-30 17:57:42,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:57:42,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-30 17:57:42,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-08-30 17:57:42,249 INFO L87 Difference]: Start difference. First operand 311 states and 387 transitions. Second operand has 14 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 17:57:45,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:57:45,568 INFO L93 Difference]: Finished difference Result 314 states and 384 transitions. [2021-08-30 17:57:45,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-30 17:57:45,569 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2021-08-30 17:57:45,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:57:45,570 INFO L225 Difference]: With dead ends: 314 [2021-08-30 17:57:45,570 INFO L226 Difference]: Without dead ends: 314 [2021-08-30 17:57:45,570 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 565.04ms TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2021-08-30 17:57:45,571 INFO L928 BasicCegarLoop]: 44 mSDtfsCounter, 305 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2701.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.04ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3000.12ms IncrementalHoareTripleChecker+Time [2021-08-30 17:57:45,571 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [307 Valid, 302 Invalid, 1414 Unknown, 0 Unchecked, 9.04ms Time], IncrementalHoareTripleChecker [12 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 3000.12ms Time] [2021-08-30 17:57:45,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-08-30 17:57:45,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 310. [2021-08-30 17:57:45,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 198 states have (on average 1.6565656565656566) internal successors, (328), 273 states have internal predecessors, (328), 36 states have call successors, (36), 21 states have call predecessors, (36), 16 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2021-08-30 17:57:45,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 384 transitions. [2021-08-30 17:57:45,576 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 384 transitions. Word has length 19 [2021-08-30 17:57:45,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:57:45,577 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 384 transitions. [2021-08-30 17:57:45,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 5 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 17:57:45,577 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 384 transitions. [2021-08-30 17:57:45,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-30 17:57:45,578 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:57:45,578 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:57:45,596 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-30 17:57:45,785 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-30 17:57:45,785 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-30 17:57:45,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:57:45,786 INFO L82 PathProgramCache]: Analyzing trace with hash 695927283, now seen corresponding path program 1 times [2021-08-30 17:57:45,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:57:45,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1413060402] [2021-08-30 17:57:45,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:57:45,786 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:57:45,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:57:45,787 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-30 17:57:45,787 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-30 17:57:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:57:45,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-30 17:57:45,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:57:46,031 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-30 17:57:46,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:57:46,110 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-30 17:57:46,110 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:57:46,110 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1413060402] [2021-08-30 17:57:46,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1413060402] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 17:57:46,110 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:57:46,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-08-30 17:57:46,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535926268] [2021-08-30 17:57:46,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-30 17:57:46,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:57:46,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-30 17:57:46,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-30 17:57:46,111 INFO L87 Difference]: Start difference. First operand 310 states and 384 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-30 17:57:46,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:57:46,851 INFO L93 Difference]: Finished difference Result 309 states and 381 transitions. [2021-08-30 17:57:46,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-30 17:57:46,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 38 [2021-08-30 17:57:46,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:57:46,852 INFO L225 Difference]: With dead ends: 309 [2021-08-30 17:57:46,852 INFO L226 Difference]: Without dead ends: 309 [2021-08-30 17:57:46,853 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.68ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-30 17:57:46,853 INFO L928 BasicCegarLoop]: 43 mSDtfsCounter, 311 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 610.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.23ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 704.69ms IncrementalHoareTripleChecker+Time [2021-08-30 17:57:46,853 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 128 Invalid, 493 Unknown, 0 Unchecked, 4.23ms Time], IncrementalHoareTripleChecker [15 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 704.69ms Time] [2021-08-30 17:57:46,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-08-30 17:57:46,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2021-08-30 17:57:46,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 198 states have (on average 1.6464646464646464) internal successors, (326), 272 states have internal predecessors, (326), 35 states have call successors, (35), 21 states have call predecessors, (35), 16 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2021-08-30 17:57:46,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 381 transitions. [2021-08-30 17:57:46,858 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 381 transitions. Word has length 38 [2021-08-30 17:57:46,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:57:46,859 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 381 transitions. [2021-08-30 17:57:46,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-30 17:57:46,859 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 381 transitions. [2021-08-30 17:57:46,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-30 17:57:46,860 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:57:46,860 INFO L513 BasicCegarLoop]: trace histogram [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-30 17:57:46,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-08-30 17:57:47,067 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-30 17:57:47,067 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting list_addErr0REQUIRES_VIOLATION === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-30 17:57:47,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:57:47,068 INFO L82 PathProgramCache]: Analyzing trace with hash 507100171, now seen corresponding path program 1 times [2021-08-30 17:57:47,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:57:47,068 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1705450588] [2021-08-30 17:57:47,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:57:47,068 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:57:47,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:57:47,069 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-30 17:57:47,091 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-30 17:57:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:57:47,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-30 17:57:47,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:57:47,287 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-30 17:57:47,429 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-08-30 17:57:47,430 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 20 treesize of output 25 [2021-08-30 17:57:47,487 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:57:47,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:57:47,732 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:57:47,732 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:57:47,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1705450588] [2021-08-30 17:57:47,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1705450588] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:57:47,732 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-30 17:57:47,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2021-08-30 17:57:47,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833154745] [2021-08-30 17:57:47,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-30 17:57:47,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:57:47,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-30 17:57:47,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-30 17:57:47,736 INFO L87 Difference]: Start difference. First operand 309 states and 381 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-08-30 17:57:48,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:57:48,278 INFO L93 Difference]: Finished difference Result 310 states and 380 transitions. [2021-08-30 17:57:48,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-30 17:57:48,279 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 38 [2021-08-30 17:57:48,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:57:48,280 INFO L225 Difference]: With dead ends: 310 [2021-08-30 17:57:48,280 INFO L226 Difference]: Without dead ends: 310 [2021-08-30 17:57:48,280 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 61 SyntacticMatches, 9 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 159.37ms TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-08-30 17:57:48,281 INFO L928 BasicCegarLoop]: 45 mSDtfsCounter, 18 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 432.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.36ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 496.45ms IncrementalHoareTripleChecker+Time [2021-08-30 17:57:48,281 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 158 Invalid, 617 Unknown, 0 Unchecked, 2.36ms Time], IncrementalHoareTripleChecker [1 Valid, 404 Invalid, 0 Unknown, 212 Unchecked, 496.45ms Time] [2021-08-30 17:57:48,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-08-30 17:57:48,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2021-08-30 17:57:48,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 198 states have (on average 1.6414141414141414) internal successors, (325), 272 states have internal predecessors, (325), 35 states have call successors, (35), 21 states have call predecessors, (35), 16 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2021-08-30 17:57:48,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 380 transitions. [2021-08-30 17:57:48,286 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 380 transitions. Word has length 38 [2021-08-30 17:57:48,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:57:48,286 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 380 transitions. [2021-08-30 17:57:48,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-08-30 17:57:48,287 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 380 transitions. [2021-08-30 17:57:48,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-30 17:57:48,287 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:57:48,287 INFO L513 BasicCegarLoop]: trace histogram [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-30 17:57:48,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2021-08-30 17:57:48,496 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-30 17:57:48,497 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting list_addErr1REQUIRES_VIOLATION === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-30 17:57:48,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:57:48,497 INFO L82 PathProgramCache]: Analyzing trace with hash 507100172, now seen corresponding path program 1 times [2021-08-30 17:57:48,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:57:48,498 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [936793011] [2021-08-30 17:57:48,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:57:48,498 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:57:48,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:57:48,499 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-30 17:57:48,500 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-30 17:57:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:57:48,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-30 17:57:48,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:57:49,205 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-30 17:57:49,205 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 29 treesize of output 31 [2021-08-30 17:57:49,214 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-08-30 17:57:49,214 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 28 treesize of output 28 [2021-08-30 17:57:49,391 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:57:49,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:57:51,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2021-08-30 17:57:51,991 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-30 17:57:51,991 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 49 treesize of output 48 [2021-08-30 17:57:54,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2021-08-30 17:57:54,539 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-30 17:57:54,540 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 48 treesize of output 52 [2021-08-30 17:57:54,558 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-30 17:57:54,558 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 52 treesize of output 51 [2021-08-30 17:57:54,774 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:57:54,774 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:57:54,774 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [936793011] [2021-08-30 17:57:54,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [936793011] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:57:54,774 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-30 17:57:54,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2021-08-30 17:57:54,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051553388] [2021-08-30 17:57:54,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-30 17:57:54,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:57:54,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-30 17:57:54,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=246, Unknown=1, NotChecked=0, Total=306 [2021-08-30 17:57:54,775 INFO L87 Difference]: Start difference. First operand 309 states and 380 transitions. Second operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 16 states have internal predecessors, (52), 9 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2021-08-30 17:57:57,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:57:57,102 INFO L93 Difference]: Finished difference Result 326 states and 395 transitions. [2021-08-30 17:57:57,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-30 17:57:57,103 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 16 states have internal predecessors, (52), 9 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) Word has length 38 [2021-08-30 17:57:57,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:57:57,105 INFO L225 Difference]: With dead ends: 326 [2021-08-30 17:57:57,105 INFO L226 Difference]: Without dead ends: 326 [2021-08-30 17:57:57,105 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 5036.81ms TimeCoverageRelationStatistics Valid=115, Invalid=390, Unknown=1, NotChecked=0, Total=506 [2021-08-30 17:57:57,105 INFO L928 BasicCegarLoop]: 43 mSDtfsCounter, 221 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1834.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 1897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.16ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 793 IncrementalHoareTripleChecker+Unchecked, 2078.36ms IncrementalHoareTripleChecker+Time [2021-08-30 17:57:57,105 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 55 Invalid, 1897 Unknown, 0 Unchecked, 7.16ms Time], IncrementalHoareTripleChecker [10 Valid, 1094 Invalid, 0 Unknown, 793 Unchecked, 2078.36ms Time] [2021-08-30 17:57:57,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-08-30 17:57:57,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 309. [2021-08-30 17:57:57,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 201 states have (on average 1.626865671641791) internal successors, (327), 274 states have internal predecessors, (327), 34 states have call successors, (34), 20 states have call predecessors, (34), 16 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2021-08-30 17:57:57,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 380 transitions. [2021-08-30 17:57:57,111 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 380 transitions. Word has length 38 [2021-08-30 17:57:57,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:57:57,111 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 380 transitions. [2021-08-30 17:57:57,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 16 states have internal predecessors, (52), 9 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2021-08-30 17:57:57,111 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 380 transitions. [2021-08-30 17:57:57,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-30 17:57:57,112 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:57:57,112 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:57:57,128 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-30 17:57:57,321 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-30 17:57:57,321 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting inspectErr0REQUIRES_VIOLATION === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-30 17:57:57,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:57:57,322 INFO L82 PathProgramCache]: Analyzing trace with hash 695915251, now seen corresponding path program 1 times [2021-08-30 17:57:57,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:57:57,322 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836044162] [2021-08-30 17:57:57,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:57:57,323 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:57:57,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:57:57,323 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-30 17:57:57,326 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-30 17:57:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:57:57,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-30 17:57:57,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:57:57,601 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-30 17:57:57,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:57:57,828 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-08-30 17:57:57,829 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 21 treesize of output 20 [2021-08-30 17:57:57,844 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-30 17:57:57,844 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:57:57,844 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [836044162] [2021-08-30 17:57:57,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [836044162] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 17:57:57,844 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:57:57,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 7 [2021-08-30 17:57:57,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429391811] [2021-08-30 17:57:57,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-30 17:57:57,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:57:57,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-30 17:57:57,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-30 17:57:57,845 INFO L87 Difference]: Start difference. First operand 309 states and 380 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-30 17:57:59,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:57:59,119 INFO L93 Difference]: Finished difference Result 344 states and 385 transitions. [2021-08-30 17:57:59,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-30 17:57:59,120 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2021-08-30 17:57:59,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:57:59,121 INFO L225 Difference]: With dead ends: 344 [2021-08-30 17:57:59,121 INFO L226 Difference]: Without dead ends: 344 [2021-08-30 17:57:59,121 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 89.64ms TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-08-30 17:57:59,121 INFO L928 BasicCegarLoop]: 43 mSDtfsCounter, 261 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1079.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.20ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 1223.47ms IncrementalHoareTripleChecker+Time [2021-08-30 17:57:59,121 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [261 Valid, 152 Invalid, 1032 Unknown, 0 Unchecked, 6.20ms Time], IncrementalHoareTripleChecker [13 Valid, 894 Invalid, 0 Unknown, 125 Unchecked, 1223.47ms Time] [2021-08-30 17:57:59,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-08-30 17:57:59,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 305. [2021-08-30 17:57:59,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 201 states have (on average 1.5820895522388059) internal successors, (318), 270 states have internal predecessors, (318), 34 states have call successors, (34), 20 states have call predecessors, (34), 16 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2021-08-30 17:57:59,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 371 transitions. [2021-08-30 17:57:59,127 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 371 transitions. Word has length 38 [2021-08-30 17:57:59,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:57:59,127 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 371 transitions. [2021-08-30 17:57:59,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-30 17:57:59,127 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 371 transitions. [2021-08-30 17:57:59,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-30 17:57:59,127 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:57:59,127 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:57:59,135 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-30 17:57:59,329 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-30 17:57:59,330 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting inspectErr1REQUIRES_VIOLATION === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-30 17:57:59,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:57:59,330 INFO L82 PathProgramCache]: Analyzing trace with hash 695915252, now seen corresponding path program 1 times [2021-08-30 17:57:59,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:57:59,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418750165] [2021-08-30 17:57:59,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:57:59,330 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:57:59,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:57:59,331 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-30 17:57:59,334 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-30 17:57:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:57:59,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-30 17:57:59,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:57:59,743 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-30 17:57:59,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:58:00,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-08-30 17:58:00,467 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-30 17:58:00,469 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 16 treesize of output 20 [2021-08-30 17:58:00,618 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-30 17:58:00,619 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:58:00,619 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418750165] [2021-08-30 17:58:00,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1418750165] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-30 17:58:00,619 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:58:00,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 8] imperfect sequences [] total 14 [2021-08-30 17:58:00,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986269727] [2021-08-30 17:58:00,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-30 17:58:00,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-30 17:58:00,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-30 17:58:00,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-08-30 17:58:00,620 INFO L87 Difference]: Start difference. First operand 305 states and 371 transitions. Second operand has 15 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 7 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2021-08-30 17:58:03,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:58:03,945 INFO L93 Difference]: Finished difference Result 303 states and 367 transitions. [2021-08-30 17:58:03,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-30 17:58:03,946 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 7 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) Word has length 38 [2021-08-30 17:58:03,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:58:03,947 INFO L225 Difference]: With dead ends: 303 [2021-08-30 17:58:03,947 INFO L226 Difference]: Without dead ends: 303 [2021-08-30 17:58:03,947 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 603.81ms TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2021-08-30 17:58:03,948 INFO L928 BasicCegarLoop]: 40 mSDtfsCounter, 497 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 1610 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2702.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.67ms SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3070.02ms IncrementalHoareTripleChecker+Time [2021-08-30 17:58:03,948 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [500 Valid, 49 Invalid, 1643 Unknown, 0 Unchecked, 10.67ms Time], IncrementalHoareTripleChecker [33 Valid, 1610 Invalid, 0 Unknown, 0 Unchecked, 3070.02ms Time] [2021-08-30 17:58:03,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-08-30 17:58:03,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2021-08-30 17:58:03,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 201 states have (on average 1.5621890547263682) internal successors, (314), 268 states have internal predecessors, (314), 34 states have call successors, (34), 20 states have call predecessors, (34), 16 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2021-08-30 17:58:03,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 367 transitions. [2021-08-30 17:58:03,952 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 367 transitions. Word has length 38 [2021-08-30 17:58:03,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:58:03,953 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 367 transitions. [2021-08-30 17:58:03,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 7 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2021-08-30 17:58:03,953 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 367 transitions. [2021-08-30 17:58:03,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-08-30 17:58:03,953 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:58:03,954 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-08-30 17:58:03,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2021-08-30 17:58:04,161 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-30 17:58:04,161 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __list_addErr0REQUIRES_VIOLATION === [__list_delErr0REQUIRES_VIOLATION, __list_delErr1REQUIRES_VIOLATION, __list_delErr2REQUIRES_VIOLATION, __list_delErr3REQUIRES_VIOLATION (and 67 more)] === [2021-08-30 17:58:04,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:58:04,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1621786009, now seen corresponding path program 1 times [2021-08-30 17:58:04,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-30 17:58:04,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803365571] [2021-08-30 17:58:04,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:58:04,162 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-30 17:58:04,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-30 17:58:04,163 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-30 17:58:04,164 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-30 17:58:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:58:04,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 42 conjunts are in the unsatisfiable core [2021-08-30 17:58:04,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:58:04,449 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-08-30 17:58:04,450 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 3 case distinctions, treesize of input 15 treesize of output 37 [2021-08-30 17:58:04,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-08-30 17:58:04,616 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 0 case distinctions, treesize of input 13 treesize of output 10 [2021-08-30 17:58:04,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-08-30 17:58:04,986 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-30 17:58:04,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-08-30 17:58:06,432 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-08-30 17:58:06,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 64 treesize of output 45 [2021-08-30 17:58:12,613 INFO L173 IndexEqualityManager]: detected equality via solver [2021-08-30 17:58:12,625 INFO L354 Elim1Store]: treesize reduction 18, result has 30.8 percent of original size [2021-08-30 17:58:12,626 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 34 treesize of output 33 [2021-08-30 17:58:12,880 INFO L354 Elim1Store]: treesize reduction 42, result has 44.0 percent of original size [2021-08-30 17:58:12,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 58 [2021-08-30 17:58:13,229 INFO L354 Elim1Store]: treesize reduction 809, result has 3.1 percent of original size [2021-08-30 17:58:13,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 129 treesize of output 69 [2021-08-30 17:58:13,617 INFO L354 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2021-08-30 17:58:13,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 78 [2021-08-30 17:58:13,994 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:58:13,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:58:16,319 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| c_gl_insert_~node~1.base (store (store (store (store (select |c_#memory_$Pointer$.base| c_gl_insert_~node~1.base) gl_insert_~node~1.offset v_DerPreprocessor_13) (bvadd gl_insert_~node~1.offset (_ bv1 32)) v_DerPreprocessor_14) (bvadd (_ bv2 32) gl_insert_~node~1.offset) v_DerPreprocessor_15) (bvadd gl_insert_~node~1.offset (_ bv3 32)) v_DerPreprocessor_16)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))))))))))) (_ bv1 1)))) is different from false [2021-08-30 17:58:18,365 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_gl_insert_~node~1.base_50 (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_gl_insert_~node~1.base_50))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_gl_insert_~node~1.base_50 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_50 (store (store (store (store (select |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_50) gl_insert_~node~1.offset v_DerPreprocessor_13) (bvadd gl_insert_~node~1.offset (_ bv1 32)) v_DerPreprocessor_14) (bvadd (_ bv2 32) gl_insert_~node~1.offset) v_DerPreprocessor_15) (bvadd gl_insert_~node~1.offset (_ bv3 32)) v_DerPreprocessor_16)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))))))))))))))) is different from false [2021-08-30 17:58:20,401 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_gl_insert_~node~1.base_50 (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_gl_insert_~node~1.base_50))) (= (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_gl_insert_~node~1.base_50 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_50 (store (store (store (store (select |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_50) gl_insert_~node~1.offset v_DerPreprocessor_13) (bvadd gl_insert_~node~1.offset (_ bv1 32)) v_DerPreprocessor_14) (bvadd (_ bv2 32) gl_insert_~node~1.offset) v_DerPreprocessor_15) (bvadd gl_insert_~node~1.offset (_ bv3 32)) v_DerPreprocessor_16)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))))))))))))))))) (_ bv1 1)) (_ bv0 1)))) is different from false [2021-08-30 17:58:22,438 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_gl_insert_~node~1.base_50 (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (gl_insert_~node~1.offset (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_gl_insert_~node~1.base_50))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_gl_insert_~node~1.base_50 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_50 (store (store (store (store (select |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_50) gl_insert_~node~1.offset v_DerPreprocessor_13) (bvadd gl_insert_~node~1.offset (_ bv1 32)) v_DerPreprocessor_14) (bvadd (_ bv2 32) gl_insert_~node~1.offset) v_DerPreprocessor_15) (bvadd gl_insert_~node~1.offset (_ bv3 32)) v_DerPreprocessor_16)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))))))))))))))))))))) is different from false [2021-08-30 17:58:22,866 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-30 17:58:22,866 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [803365571] [2021-08-30 17:58:22,866 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-08-30 17:58:22,866 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1554906638] [2021-08-30 17:58:22,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:58:22,867 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-08-30 17:58:22,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-08-30 17:58:22,875 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-08-30 17:58:22,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2021-08-30 17:58:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:58:23,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 39 conjunts are in the unsatisfiable core [2021-08-30 17:58:23,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:58:23,286 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 9 treesize of output 3 [2021-08-30 17:58:23,370 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-30 17:58:24,019 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-30 17:58:24,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-08-30 17:58:24,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-08-30 17:58:24,708 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-08-30 17:58:24,708 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 64 treesize of output 45 [2021-08-30 17:58:25,108 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-08-30 17:58:25,108 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 38 [2021-08-30 17:58:25,631 INFO L354 Elim1Store]: treesize reduction 809, result has 3.1 percent of original size [2021-08-30 17:58:25,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 132 treesize of output 72 [2021-08-30 17:58:26,313 INFO L354 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2021-08-30 17:58:26,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 57 [2021-08-30 17:58:28,209 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:58:28,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:58:44,114 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-08-30 17:58:44,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1895 treesize of output 1913 [2021-08-30 17:58:52,216 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-08-30 17:58:52,217 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531613870] [2021-08-30 17:58:52,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:58:52,217 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:58:52,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:58:52,218 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:58:52,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-08-30 17:58:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:58:52,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 41 conjunts are in the unsatisfiable core [2021-08-30 17:58:52,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:58:52,415 INFO L354 Elim1Store]: treesize reduction 77, result has 29.4 percent of original size [2021-08-30 17:58:52,416 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 3 case distinctions, treesize of input 15 treesize of output 37 [2021-08-30 17:58:52,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-08-30 17:58:52,540 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 0 case distinctions, treesize of input 13 treesize of output 10 [2021-08-30 17:58:52,637 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-30 17:58:53,043 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-08-30 17:58:53,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-08-30 17:58:54,158 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-08-30 17:58:54,158 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 63 treesize of output 44 [2021-08-30 17:59:04,553 INFO L354 Elim1Store]: treesize reduction 23, result has 42.5 percent of original size [2021-08-30 17:59:04,553 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 30 treesize of output 37 [2021-08-30 17:59:06,783 INFO L354 Elim1Store]: treesize reduction 42, result has 44.0 percent of original size [2021-08-30 17:59:06,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 58 [2021-08-30 17:59:07,173 INFO L354 Elim1Store]: treesize reduction 809, result has 3.1 percent of original size [2021-08-30 17:59:07,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 126 treesize of output 66 [2021-08-30 17:59:07,372 INFO L354 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2021-08-30 17:59:07,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 78 [2021-08-30 17:59:07,530 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:59:07,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:59:09,624 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_22 (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (gl_insert_~node~1.offset (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| c_gl_insert_~node~1.base (store (store (store (store (select |c_#memory_$Pointer$.base| c_gl_insert_~node~1.base) gl_insert_~node~1.offset v_DerPreprocessor_21) (bvadd gl_insert_~node~1.offset (_ bv1 32)) v_DerPreprocessor_22) (bvadd (_ bv2 32) gl_insert_~node~1.offset) v_DerPreprocessor_23) (bvadd gl_insert_~node~1.offset (_ bv3 32)) v_DerPreprocessor_24)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))))))))))))) is different from false [2021-08-30 17:59:11,673 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_gl_insert_~node~1.base_61 (_ BitVec 32)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_22 (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (gl_insert_~node~1.offset (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| v_gl_insert_~node~1.base_61 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_61 (store (store (store (store (select |c_#memory_$Pointer$.base| v_gl_insert_~node~1.base_61) gl_insert_~node~1.offset v_DerPreprocessor_21) (bvadd gl_insert_~node~1.offset (_ bv1 32)) v_DerPreprocessor_22) (bvadd (_ bv2 32) gl_insert_~node~1.offset) v_DerPreprocessor_23) (bvadd gl_insert_~node~1.offset (_ bv3 32)) v_DerPreprocessor_24)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))))))))) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| v_gl_insert_~node~1.base_61))))) is different from false [2021-08-30 17:59:56,463 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-08-30 17:59:56,463 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:59:56,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-08-30 17:59:56,464 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-08-30 17:59:56,464 INFO L627 BasicCegarLoop]: Counterexample might be feasible [2021-08-30 17:59:56,467 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_addErr0REQUIRES_VIOLATION (70 of 71 remaining) [2021-08-30 17:59:56,469 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_delErr0REQUIRES_VIOLATION (69 of 71 remaining) [2021-08-30 17:59:56,469 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_delErr1REQUIRES_VIOLATION (68 of 71 remaining) [2021-08-30 17:59:56,469 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_delErr2REQUIRES_VIOLATION (67 of 71 remaining) [2021-08-30 17:59:56,469 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_delErr3REQUIRES_VIOLATION (66 of 71 remaining) [2021-08-30 17:59:56,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_insertErr0REQUIRES_VIOLATION (65 of 71 remaining) [2021-08-30 17:59:56,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_insertErr1REQUIRES_VIOLATION (64 of 71 remaining) [2021-08-30 17:59:56,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_insertErr2REQUIRES_VIOLATION (63 of 71 remaining) [2021-08-30 17:59:56,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_insertErr3REQUIRES_VIOLATION (62 of 71 remaining) [2021-08-30 17:59:56,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_insertErr4REQUIRES_VIOLATION (61 of 71 remaining) [2021-08-30 17:59:56,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_insertErr5REQUIRES_VIOLATION (60 of 71 remaining) [2021-08-30 17:59:56,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_sort_passErr0REQUIRES_VIOLATION (59 of 71 remaining) [2021-08-30 17:59:56,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_sort_passErr1REQUIRES_VIOLATION (58 of 71 remaining) [2021-08-30 17:59:56,470 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_sort_passErr2REQUIRES_VIOLATION (57 of 71 remaining) [2021-08-30 17:59:56,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_sort_passErr3REQUIRES_VIOLATION (56 of 71 remaining) [2021-08-30 17:59:56,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr0REQUIRES_VIOLATION (55 of 71 remaining) [2021-08-30 17:59:56,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr1REQUIRES_VIOLATION (54 of 71 remaining) [2021-08-30 17:59:56,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr2REQUIRES_VIOLATION (53 of 71 remaining) [2021-08-30 17:59:56,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr3REQUIRES_VIOLATION (52 of 71 remaining) [2021-08-30 17:59:56,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr4REQUIRES_VIOLATION (51 of 71 remaining) [2021-08-30 17:59:56,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr5REQUIRES_VIOLATION (50 of 71 remaining) [2021-08-30 17:59:56,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr6REQUIRES_VIOLATION (49 of 71 remaining) [2021-08-30 17:59:56,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr7REQUIRES_VIOLATION (48 of 71 remaining) [2021-08-30 17:59:56,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr8REQUIRES_VIOLATION (47 of 71 remaining) [2021-08-30 17:59:56,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr9REQUIRES_VIOLATION (46 of 71 remaining) [2021-08-30 17:59:56,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr10REQUIRES_VIOLATION (45 of 71 remaining) [2021-08-30 17:59:56,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr11REQUIRES_VIOLATION (44 of 71 remaining) [2021-08-30 17:59:56,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr12REQUIRES_VIOLATION (43 of 71 remaining) [2021-08-30 17:59:56,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr13REQUIRES_VIOLATION (42 of 71 remaining) [2021-08-30 17:59:56,472 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr14REQUIRES_VIOLATION (41 of 71 remaining) [2021-08-30 17:59:56,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr15REQUIRES_VIOLATION (40 of 71 remaining) [2021-08-30 17:59:56,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr16REQUIRES_VIOLATION (39 of 71 remaining) [2021-08-30 17:59:56,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr17REQUIRES_VIOLATION (38 of 71 remaining) [2021-08-30 17:59:56,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr18REQUIRES_VIOLATION (37 of 71 remaining) [2021-08-30 17:59:56,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr19REQUIRES_VIOLATION (36 of 71 remaining) [2021-08-30 17:59:56,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr20REQUIRES_VIOLATION (35 of 71 remaining) [2021-08-30 17:59:56,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr21REQUIRES_VIOLATION (34 of 71 remaining) [2021-08-30 17:59:56,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr22REQUIRES_VIOLATION (33 of 71 remaining) [2021-08-30 17:59:56,473 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr23REQUIRES_VIOLATION (32 of 71 remaining) [2021-08-30 17:59:56,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr24REQUIRES_VIOLATION (31 of 71 remaining) [2021-08-30 17:59:56,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr25REQUIRES_VIOLATION (30 of 71 remaining) [2021-08-30 17:59:56,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr26REQUIRES_VIOLATION (29 of 71 remaining) [2021-08-30 17:59:56,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr27REQUIRES_VIOLATION (28 of 71 remaining) [2021-08-30 17:59:56,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr28REQUIRES_VIOLATION (27 of 71 remaining) [2021-08-30 17:59:56,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location inspectErr29REQUIRES_VIOLATION (26 of 71 remaining) [2021-08-30 17:59:56,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location val_from_nodeErr0REQUIRES_VIOLATION (25 of 71 remaining) [2021-08-30 17:59:56,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location val_from_nodeErr1REQUIRES_VIOLATION (24 of 71 remaining) [2021-08-30 17:59:56,474 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location failErr0ASSERT_VIOLATIONMEMORY_LEAK (23 of 71 remaining) [2021-08-30 17:59:56,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_destroyErr0REQUIRES_VIOLATION (22 of 71 remaining) [2021-08-30 17:59:56,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_destroyErr1REQUIRES_VIOLATION (21 of 71 remaining) [2021-08-30 17:59:56,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_destroyErr2REQUIRES_VIOLATION (20 of 71 remaining) [2021-08-30 17:59:56,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_destroyErr3REQUIRES_VIOLATION (19 of 71 remaining) [2021-08-30 17:59:56,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_destroyErr4REQUIRES_VIOLATION (18 of 71 remaining) [2021-08-30 17:59:56,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_destroyErr5REQUIRES_VIOLATION (17 of 71 remaining) [2021-08-30 17:59:56,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_destroyErr6ASSERT_VIOLATIONMEMORY_FREE (16 of 71 remaining) [2021-08-30 17:59:56,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_destroyErr7ASSERT_VIOLATIONMEMORY_FREE (15 of 71 remaining) [2021-08-30 17:59:56,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location gl_destroyErr8ASSERT_VIOLATIONMEMORY_FREE (14 of 71 remaining) [2021-08-30 17:59:56,475 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_addErr1REQUIRES_VIOLATION (13 of 71 remaining) [2021-08-30 17:59:56,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_addErr2REQUIRES_VIOLATION (12 of 71 remaining) [2021-08-30 17:59:56,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_addErr3REQUIRES_VIOLATION (11 of 71 remaining) [2021-08-30 17:59:56,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_addErr4REQUIRES_VIOLATION (10 of 71 remaining) [2021-08-30 17:59:56,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_addErr5REQUIRES_VIOLATION (9 of 71 remaining) [2021-08-30 17:59:56,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_addErr6REQUIRES_VIOLATION (8 of 71 remaining) [2021-08-30 17:59:56,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __list_addErr7REQUIRES_VIOLATION (7 of 71 remaining) [2021-08-30 17:59:56,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0ENSURES_VIOLATIONMEMORY_LEAK (6 of 71 remaining) [2021-08-30 17:59:56,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location list_addErr0REQUIRES_VIOLATION (5 of 71 remaining) [2021-08-30 17:59:56,476 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location list_addErr1REQUIRES_VIOLATION (4 of 71 remaining) [2021-08-30 17:59:56,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location list_moveErr0REQUIRES_VIOLATION (3 of 71 remaining) [2021-08-30 17:59:56,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location list_moveErr1REQUIRES_VIOLATION (2 of 71 remaining) [2021-08-30 17:59:56,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location list_moveErr2REQUIRES_VIOLATION (1 of 71 remaining) [2021-08-30 17:59:56,477 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location list_moveErr3REQUIRES_VIOLATION (0 of 71 remaining) [2021-08-30 17:59:56,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2021-08-30 17:59:56,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2021-08-30 17:59:56,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-08-30 17:59:57,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:59:57,086 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-30 17:59:57,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 05:59:57 BoogieIcfgContainer [2021-08-30 17:59:57,095 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-30 17:59:57,096 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-30 17:59:57,096 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-30 17:59:57,096 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-30 17:59:57,096 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 05:55:56" (3/4) ... [2021-08-30 17:59:57,098 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-30 17:59:57,098 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-30 17:59:57,099 INFO L158 Benchmark]: Toolchain (without parser) took 242036.52ms. Allocated memory was 69.2MB in the beginning and 121.6MB in the end (delta: 52.4MB). Free memory was 48.2MB in the beginning and 34.0MB in the end (delta: 14.2MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. [2021-08-30 17:59:57,099 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 69.2MB. Free memory was 51.9MB in the beginning and 51.8MB in the end (delta: 48.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-30 17:59:57,100 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.26ms. Allocated memory was 69.2MB in the beginning and 86.0MB in the end (delta: 16.8MB). Free memory was 48.0MB in the beginning and 63.8MB in the end (delta: -15.8MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2021-08-30 17:59:57,100 INFO L158 Benchmark]: Boogie Preprocessor took 66.65ms. Allocated memory is still 86.0MB. Free memory was 63.8MB in the beginning and 58.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-08-30 17:59:57,100 INFO L158 Benchmark]: RCFGBuilder took 542.44ms. Allocated memory is still 86.0MB. Free memory was 58.7MB in the beginning and 43.1MB in the end (delta: 15.6MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2021-08-30 17:59:57,101 INFO L158 Benchmark]: TraceAbstraction took 240986.99ms. Allocated memory was 86.0MB in the beginning and 121.6MB in the end (delta: 35.7MB). Free memory was 42.7MB in the beginning and 35.0MB in the end (delta: 7.7MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. [2021-08-30 17:59:57,102 INFO L158 Benchmark]: Witness Printer took 2.55ms. Allocated memory is still 121.6MB. Free memory is still 34.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-08-30 17:59:57,105 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.16ms. Allocated memory is still 69.2MB. Free memory was 51.9MB in the beginning and 51.8MB in the end (delta: 48.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.26ms. Allocated memory was 69.2MB in the beginning and 86.0MB in the end (delta: 16.8MB). Free memory was 48.0MB in the beginning and 63.8MB in the end (delta: -15.8MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.65ms. Allocated memory is still 86.0MB. Free memory was 63.8MB in the beginning and 58.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 542.44ms. Allocated memory is still 86.0MB. Free memory was 58.7MB in the beginning and 43.1MB in the end (delta: 15.6MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * TraceAbstraction took 240986.99ms. Allocated memory was 86.0MB in the beginning and 121.6MB in the end (delta: 35.7MB). Free memory was 42.7MB in the beginning and 35.0MB in the end (delta: 7.7MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. * Witness Printer took 2.55ms. Allocated memory is still 121.6MB. Free memory is still 34.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 878]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L850] struct list_head gl_list = { &(gl_list), &(gl_list) }; [L949] CALL gl_read() [L909] CALL gl_insert(__VERIFIER_nondet_int()) [L899] struct node *node = malloc(sizeof *node); [L900] COND FALSE !(!node) [L902] node->value = value [L903] CALL list_add(&node->linkage, &gl_list) [L890] EXPR head->next [L890] CALL __list_add(new, head, head->next) [L878] next->prev = new [L879] new->next = next [L880] new->prev = prev [L881] prev->next = new [L890] RET __list_add(new, head, head->next) [L903] RET list_add(&node->linkage, &gl_list) [L904] (&node->nested)->next = (&node->nested) [L904] (&node->nested)->prev = (&node->nested) [L909] RET gl_insert(__VERIFIER_nondet_int()) [L911] COND TRUE __VERIFIER_nondet_int() [L909] CALL gl_insert(__VERIFIER_nondet_int()) [L899] struct node *node = malloc(sizeof *node); [L900] COND FALSE !(!node) [L902] node->value = value [L903] CALL list_add(&node->linkage, &gl_list) [L890] EXPR head->next [L890] CALL __list_add(new, head, head->next) [L878] next->prev = new - UnprovableResult [Line: 885]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 885]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 886]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 886]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 902]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 902]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 904]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 904]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 904]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 904]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 928]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 928]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 930]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 930]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 923]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 923]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 916]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 916]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 917]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 917]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 917]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 917]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 918]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 918]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 918]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 879]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 879]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 880]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 880]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 881]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 881]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 947]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 890]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 890]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 894]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 894]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 894]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 894]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 19 procedures, 255 locations, 71 error locations. Started 1 CEGAR loops. OverallTime: 240937.64ms, OverallIterations: 17, TraceHistogramMax: 2, EmptinessCheckTime: 14.51ms, AutomataDifference: 35631.91ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 11.80ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1999 SdHoareTripleChecker+Valid, 25730.57ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1984 mSDsluCounter, 3463 SdHoareTripleChecker+Invalid, 22613.05ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4982 IncrementalHoareTripleChecker+Unchecked, 12880 mSDsCounter, 121 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15277 IncrementalHoareTripleChecker+Invalid, 20380 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 121 mSolverCounterUnsat, 740 mSDtfsCounter, 15277 mSolverCounterSat, 103.83ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 729 GetRequests, 524 SyntacticMatches, 42 SemanticMatches, 163 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 88253.20ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=312occurred in iteration=8, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 129.33ms AutomataMinimizationTime, 16 MinimizatonAttempts, 133 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 137.72ms SsaConstructionTime, 617.39ms SatisfiabilityAnalysisTime, 86547.59ms InterpolantComputationTime, 350 NumberOfCodeBlocks, 350 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 668 ConstructedInterpolants, 88 QuantifiedInterpolants, 7016 SizeOfPredicates, 142 NumberOfNonLiveVariables, 2454 ConjunctsInSsa, 194 ConjunctsInUnsatCore, 32 InterpolantComputations, 28 PerfectInterpolantSequences, 22/28 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-30 17:59:57,167 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...