./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 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/uthash-2.0.2/uthash_JEN_test6-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 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-19 13:13:19,529 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-19 13:13:19,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-19 13:13:19,564 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-19 13:13:19,564 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-19 13:13:19,567 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-19 13:13:19,568 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-19 13:13:19,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-19 13:13:19,577 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-19 13:13:19,581 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-19 13:13:19,581 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-19 13:13:19,582 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-19 13:13:19,583 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-19 13:13:19,584 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-19 13:13:19,585 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-19 13:13:19,590 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-19 13:13:19,591 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-19 13:13:19,591 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-19 13:13:19,593 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-19 13:13:19,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-19 13:13:19,597 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-19 13:13:19,597 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-19 13:13:19,598 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-19 13:13:19,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-19 13:13:19,606 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-19 13:13:19,606 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-19 13:13:19,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-19 13:13:19,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-19 13:13:19,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-19 13:13:19,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-19 13:13:19,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-19 13:13:19,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-19 13:13:19,610 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-19 13:13:19,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-19 13:13:19,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-19 13:13:19,612 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-19 13:13:19,612 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-19 13:13:19,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-19 13:13:19,613 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-19 13:13:19,613 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-19 13:13:19,614 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-19 13:13:19,614 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-19 13:13:19,639 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-19 13:13:19,640 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-19 13:13:19,640 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-19 13:13:19,640 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-19 13:13:19,641 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-19 13:13:19,641 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-19 13:13:19,641 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-19 13:13:19,642 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-19 13:13:19,642 INFO L138 SettingsManager]: * Use SBE=true [2021-12-19 13:13:19,642 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-19 13:13:19,642 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-19 13:13:19,643 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-19 13:13:19,643 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-19 13:13:19,643 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-19 13:13:19,643 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-19 13:13:19,643 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-19 13:13:19,643 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-19 13:13:19,643 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-19 13:13:19,644 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-19 13:13:19,644 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-19 13:13:19,644 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-19 13:13:19,644 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-19 13:13:19,644 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-19 13:13:19,644 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-19 13:13:19,644 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-19 13:13:19,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-19 13:13:19,645 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-19 13:13:19,645 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-19 13:13:19,645 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-19 13:13:19,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-19 13:13:19,645 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-19 13:13:19,645 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 -> 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 [2021-12-19 13:13:19,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-19 13:13:19,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-19 13:13:19,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-19 13:13:19,843 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-19 13:13:19,843 INFO L275 PluginConnector]: CDTParser initialized [2021-12-19 13:13:19,844 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2021-12-19 13:13:19,921 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c1cb5a94/f857fdcbbd3745fab1d6ee657b17240a/FLAGcef33b4ca [2021-12-19 13:13:20,380 INFO L306 CDTParser]: Found 1 translation units. [2021-12-19 13:13:20,381 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2021-12-19 13:13:20,414 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c1cb5a94/f857fdcbbd3745fab1d6ee657b17240a/FLAGcef33b4ca [2021-12-19 13:13:20,923 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c1cb5a94/f857fdcbbd3745fab1d6ee657b17240a [2021-12-19 13:13:20,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-19 13:13:20,926 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-19 13:13:20,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-19 13:13:20,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-19 13:13:20,931 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-19 13:13:20,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:13:20" (1/1) ... [2021-12-19 13:13:20,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@588fbc1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:13:20, skipping insertion in model container [2021-12-19 13:13:20,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:13:20" (1/1) ... [2021-12-19 13:13:20,939 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-19 13:13:20,986 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 13:13:21,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[44118,44131] [2021-12-19 13:13:21,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[44660,44673] [2021-12-19 13:13:21,475 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[56247,56260] [2021-12-19 13:13:21,476 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[56368,56381] [2021-12-19 13:13:21,480 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 13:13:21,487 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-12-19 13:13:21,488 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@52329833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:13:21, skipping insertion in model container [2021-12-19 13:13:21,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-19 13:13:21,488 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-19 13:13:21,492 INFO L158 Benchmark]: Toolchain (without parser) took 562.61ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 53.6MB in the beginning and 80.2MB in the end (delta: -26.5MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2021-12-19 13:13:21,493 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 92.3MB. Free memory is still 61.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-19 13:13:21,493 INFO L158 Benchmark]: CACSL2BoogieTranslator took 560.07ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 53.4MB in the beginning and 80.2MB in the end (delta: -26.7MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2021-12-19 13:13:21,494 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.10ms. Allocated memory is still 92.3MB. Free memory is still 61.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 560.07ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 53.4MB in the beginning and 80.2MB in the end (delta: -26.7MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 990]: 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-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 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-19 13:13:23,027 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-19 13:13:23,029 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-19 13:13:23,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-19 13:13:23,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-19 13:13:23,057 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-19 13:13:23,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-19 13:13:23,062 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-19 13:13:23,063 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-19 13:13:23,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-19 13:13:23,067 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-19 13:13:23,070 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-19 13:13:23,070 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-19 13:13:23,072 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-19 13:13:23,073 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-19 13:13:23,075 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-19 13:13:23,076 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-19 13:13:23,076 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-19 13:13:23,078 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-19 13:13:23,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-19 13:13:23,084 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-19 13:13:23,085 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-19 13:13:23,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-19 13:13:23,087 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-19 13:13:23,092 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-19 13:13:23,092 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-19 13:13:23,092 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-19 13:13:23,093 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-19 13:13:23,094 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-19 13:13:23,095 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-19 13:13:23,095 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-19 13:13:23,096 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-19 13:13:23,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-19 13:13:23,098 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-19 13:13:23,099 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-19 13:13:23,099 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-19 13:13:23,100 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-19 13:13:23,100 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-19 13:13:23,100 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-19 13:13:23,101 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-19 13:13:23,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-19 13:13:23,105 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-19 13:13:23,136 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-19 13:13:23,136 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-19 13:13:23,137 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-19 13:13:23,137 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-19 13:13:23,138 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-19 13:13:23,138 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-19 13:13:23,139 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-19 13:13:23,139 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-19 13:13:23,139 INFO L138 SettingsManager]: * Use SBE=true [2021-12-19 13:13:23,139 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-19 13:13:23,140 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-19 13:13:23,140 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-19 13:13:23,140 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-19 13:13:23,140 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-19 13:13:23,141 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-19 13:13:23,141 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-19 13:13:23,141 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-19 13:13:23,141 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-19 13:13:23,141 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-19 13:13:23,141 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-19 13:13:23,141 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-19 13:13:23,142 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-19 13:13:23,142 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-19 13:13:23,142 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-19 13:13:23,146 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-19 13:13:23,147 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-19 13:13:23,147 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-19 13:13:23,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-19 13:13:23,147 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-19 13:13:23,147 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-19 13:13:23,147 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-19 13:13:23,148 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-19 13:13:23,148 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-19 13:13:23,148 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-19 13:13:23,148 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 -> 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 [2021-12-19 13:13:23,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-19 13:13:23,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-19 13:13:23,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-19 13:13:23,401 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-19 13:13:23,401 INFO L275 PluginConnector]: CDTParser initialized [2021-12-19 13:13:23,402 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2021-12-19 13:13:23,455 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4ca04f7a/752281f66ebb4256b15fcecb80a93581/FLAG6101e36eb [2021-12-19 13:13:23,946 INFO L306 CDTParser]: Found 1 translation units. [2021-12-19 13:13:23,946 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2021-12-19 13:13:23,963 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4ca04f7a/752281f66ebb4256b15fcecb80a93581/FLAG6101e36eb [2021-12-19 13:13:24,423 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4ca04f7a/752281f66ebb4256b15fcecb80a93581 [2021-12-19 13:13:24,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-19 13:13:24,425 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-19 13:13:24,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-19 13:13:24,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-19 13:13:24,430 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-19 13:13:24,431 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:13:24" (1/1) ... [2021-12-19 13:13:24,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1437aa8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:13:24, skipping insertion in model container [2021-12-19 13:13:24,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:13:24" (1/1) ... [2021-12-19 13:13:24,436 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-19 13:13:24,491 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 13:13:24,821 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[44118,44131] [2021-12-19 13:13:24,832 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[44660,44673] [2021-12-19 13:13:24,925 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[56247,56260] [2021-12-19 13:13:24,926 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[56368,56381] [2021-12-19 13:13:24,934 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 13:13:24,947 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-19 13:13:24,956 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 13:13:24,971 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[44118,44131] [2021-12-19 13:13:24,975 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[44660,44673] [2021-12-19 13:13:25,034 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[56247,56260] [2021-12-19 13:13:25,035 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[56368,56381] [2021-12-19 13:13:25,038 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 13:13:25,044 INFO L203 MainTranslator]: Completed pre-run [2021-12-19 13:13:25,062 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[44118,44131] [2021-12-19 13:13:25,064 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[44660,44673] [2021-12-19 13:13:25,111 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[56247,56260] [2021-12-19 13:13:25,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i[56368,56381] [2021-12-19 13:13:25,127 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 13:13:25,184 INFO L208 MainTranslator]: Completed translation [2021-12-19 13:13:25,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:13:25 WrapperNode [2021-12-19 13:13:25,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-19 13:13:25,186 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-19 13:13:25,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-19 13:13:25,186 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-19 13:13:25,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:13:25" (1/1) ... [2021-12-19 13:13:25,242 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:13:25" (1/1) ... [2021-12-19 13:13:25,292 INFO L137 Inliner]: procedures = 285, calls = 294, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1042 [2021-12-19 13:13:25,292 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-19 13:13:25,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-19 13:13:25,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-19 13:13:25,294 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-19 13:13:25,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:13:25" (1/1) ... [2021-12-19 13:13:25,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:13:25" (1/1) ... [2021-12-19 13:13:25,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:13:25" (1/1) ... [2021-12-19 13:13:25,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:13:25" (1/1) ... [2021-12-19 13:13:25,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:13:25" (1/1) ... [2021-12-19 13:13:25,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:13:25" (1/1) ... [2021-12-19 13:13:25,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:13:25" (1/1) ... [2021-12-19 13:13:25,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-19 13:13:25,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-19 13:13:25,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-19 13:13:25,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-19 13:13:25,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:13:25" (1/1) ... [2021-12-19 13:13:25,380 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-19 13:13:25,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 13:13:25,406 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-19 13:13:25,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-19 13:13:25,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-12-19 13:13:25,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-19 13:13:25,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-19 13:13:25,437 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-12-19 13:13:25,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-19 13:13:25,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-19 13:13:25,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-19 13:13:25,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-19 13:13:25,438 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2021-12-19 13:13:25,438 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2021-12-19 13:13:25,438 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-19 13:13:25,438 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-19 13:13:25,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-19 13:13:25,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-19 13:13:25,438 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2021-12-19 13:13:25,439 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2021-12-19 13:13:25,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-19 13:13:25,439 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2021-12-19 13:13:25,440 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2021-12-19 13:13:25,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-19 13:13:25,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-19 13:13:25,620 INFO L236 CfgBuilder]: Building ICFG [2021-12-19 13:13:25,622 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-19 13:13:28,395 INFO L277 CfgBuilder]: Performing block encoding [2021-12-19 13:13:28,403 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-19 13:13:28,404 INFO L301 CfgBuilder]: Removed 63 assume(true) statements. [2021-12-19 13:13:28,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:13:28 BoogieIcfgContainer [2021-12-19 13:13:28,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-19 13:13:28,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-19 13:13:28,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-19 13:13:28,409 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-19 13:13:28,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 01:13:24" (1/3) ... [2021-12-19 13:13:28,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76634f33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:13:28, skipping insertion in model container [2021-12-19 13:13:28,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:13:25" (2/3) ... [2021-12-19 13:13:28,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76634f33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:13:28, skipping insertion in model container [2021-12-19 13:13:28,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:13:28" (3/3) ... [2021-12-19 13:13:28,410 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test6-1.i [2021-12-19 13:13:28,413 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-19 13:13:28,414 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 531 error locations. [2021-12-19 13:13:28,438 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-19 13:13:28,442 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-19 13:13:28,442 INFO L340 AbstractCegarLoop]: Starting to check reachability of 531 error locations. [2021-12-19 13:13:28,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 1083 states, 534 states have (on average 2.2284644194756553) internal successors, (1190), 1065 states have internal predecessors, (1190), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-19 13:13:28,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-19 13:13:28,469 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:13:28,469 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-19 13:13:28,469 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:13:28,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:13:28,476 INFO L85 PathProgramCache]: Analyzing trace with hash 77521, now seen corresponding path program 1 times [2021-12-19 13:13:28,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:13:28,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769613522] [2021-12-19 13:13:28,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:13:28,484 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:13:28,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:13:28,486 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:13:28,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-19 13:13:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:13:28,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-19 13:13:28,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:13:28,654 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-12-19 13:13:28,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:13:28,674 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:13:28,674 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:13:28,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769613522] [2021-12-19 13:13:28,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769613522] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:13:28,675 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:13:28,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-19 13:13:28,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423038424] [2021-12-19 13:13:28,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:13:28,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-19 13:13:28,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:13:28,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 13:13:28,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 13:13:28,713 INFO L87 Difference]: Start difference. First operand has 1083 states, 534 states have (on average 2.2284644194756553) internal successors, (1190), 1065 states have internal predecessors, (1190), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:13:29,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:13:29,965 INFO L93 Difference]: Finished difference Result 1162 states and 1229 transitions. [2021-12-19 13:13:29,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 13:13:29,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-19 13:13:29,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:13:29,979 INFO L225 Difference]: With dead ends: 1162 [2021-12-19 13:13:29,980 INFO L226 Difference]: Without dead ends: 1160 [2021-12-19 13:13:29,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 13:13:29,984 INFO L933 BasicCegarLoop]: 798 mSDtfsCounter, 714 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-19 13:13:29,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [717 Valid, 1044 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-19 13:13:30,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2021-12-19 13:13:30,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1103. [2021-12-19 13:13:30,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 568 states have (on average 2.084507042253521) internal successors, (1184), 1086 states have internal predecessors, (1184), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-12-19 13:13:30,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1210 transitions. [2021-12-19 13:13:30,064 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1210 transitions. Word has length 3 [2021-12-19 13:13:30,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:13:30,065 INFO L470 AbstractCegarLoop]: Abstraction has 1103 states and 1210 transitions. [2021-12-19 13:13:30,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:13:30,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1210 transitions. [2021-12-19 13:13:30,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-19 13:13:30,065 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:13:30,065 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-19 13:13:30,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-19 13:13:30,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:13:30,272 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:13:30,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:13:30,273 INFO L85 PathProgramCache]: Analyzing trace with hash 77522, now seen corresponding path program 1 times [2021-12-19 13:13:30,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:13:30,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024625542] [2021-12-19 13:13:30,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:13:30,274 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:13:30,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:13:30,275 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:13:30,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-19 13:13:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:13:30,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 13:13:30,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:13:30,369 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-12-19 13:13:30,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:13:30,377 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:13:30,377 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:13:30,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024625542] [2021-12-19 13:13:30,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1024625542] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:13:30,378 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:13:30,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-19 13:13:30,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928869008] [2021-12-19 13:13:30,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:13:30,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-19 13:13:30,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:13:30,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 13:13:30,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 13:13:30,381 INFO L87 Difference]: Start difference. First operand 1103 states and 1210 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:13:32,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:13:32,142 INFO L93 Difference]: Finished difference Result 1497 states and 1638 transitions. [2021-12-19 13:13:32,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 13:13:32,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-19 13:13:32,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:13:32,146 INFO L225 Difference]: With dead ends: 1497 [2021-12-19 13:13:32,147 INFO L226 Difference]: Without dead ends: 1497 [2021-12-19 13:13:32,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 13:13:32,148 INFO L933 BasicCegarLoop]: 943 mSDtfsCounter, 418 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-19 13:13:32,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [423 Valid, 1538 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-19 13:13:32,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2021-12-19 13:13:32,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1307. [2021-12-19 13:13:32,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1307 states, 771 states have (on average 2.0700389105058368) internal successors, (1596), 1288 states have internal predecessors, (1596), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-19 13:13:32,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1626 transitions. [2021-12-19 13:13:32,183 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1626 transitions. Word has length 3 [2021-12-19 13:13:32,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:13:32,184 INFO L470 AbstractCegarLoop]: Abstraction has 1307 states and 1626 transitions. [2021-12-19 13:13:32,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:13:32,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1626 transitions. [2021-12-19 13:13:32,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-19 13:13:32,185 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:13:32,185 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:13:32,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-19 13:13:32,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:13:32,392 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:13:32,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:13:32,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1111693489, now seen corresponding path program 1 times [2021-12-19 13:13:32,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:13:32,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860203825] [2021-12-19 13:13:32,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:13:32,395 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:13:32,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:13:32,396 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:13:32,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-19 13:13:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:13:32,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 13:13:32,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:13:32,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-19 13:13:32,523 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-12-19 13:13:32,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 13:13:32,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-19 13:13:32,586 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:13:32,587 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-12-19 13:13:32,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-12-19 13:13:32,610 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:13:32,610 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:13:32,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860203825] [2021-12-19 13:13:32,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860203825] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:13:32,611 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:13:32,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 13:13:32,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900510224] [2021-12-19 13:13:32,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:13:32,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:13:32,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:13:32,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:13:32,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:13:32,613 INFO L87 Difference]: Start difference. First operand 1307 states and 1626 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:13:35,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:13:35,533 INFO L93 Difference]: Finished difference Result 1997 states and 2371 transitions. [2021-12-19 13:13:35,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 13:13:35,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-19 13:13:35,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:13:35,539 INFO L225 Difference]: With dead ends: 1997 [2021-12-19 13:13:35,539 INFO L226 Difference]: Without dead ends: 1997 [2021-12-19 13:13:35,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:13:35,540 INFO L933 BasicCegarLoop]: 655 mSDtfsCounter, 719 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 1812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-12-19 13:13:35,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [723 Valid, 1587 Invalid, 1812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1797 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2021-12-19 13:13:35,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2021-12-19 13:13:35,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1452. [2021-12-19 13:13:35,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1452 states, 916 states have (on average 2.0513100436681224) internal successors, (1879), 1433 states have internal predecessors, (1879), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-19 13:13:35,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 1909 transitions. [2021-12-19 13:13:35,563 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 1909 transitions. Word has length 8 [2021-12-19 13:13:35,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:13:35,564 INFO L470 AbstractCegarLoop]: Abstraction has 1452 states and 1909 transitions. [2021-12-19 13:13:35,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:13:35,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1909 transitions. [2021-12-19 13:13:35,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-19 13:13:35,564 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:13:35,564 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:13:35,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-19 13:13:35,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:13:35,771 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:13:35,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:13:35,772 INFO L85 PathProgramCache]: Analyzing trace with hash -102759776, now seen corresponding path program 1 times [2021-12-19 13:13:35,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:13:35,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694969007] [2021-12-19 13:13:35,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:13:35,773 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:13:35,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:13:35,774 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:13:35,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-19 13:13:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:13:35,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 13:13:35,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:13:35,918 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-12-19 13:13:35,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:13:35,938 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:13:35,938 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:13:35,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694969007] [2021-12-19 13:13:35,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1694969007] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:13:35,939 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:13:35,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 13:13:35,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329944784] [2021-12-19 13:13:35,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:13:35,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:13:35,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:13:35,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:13:35,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:13:35,943 INFO L87 Difference]: Start difference. First operand 1452 states and 1909 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:13:37,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:13:37,863 INFO L93 Difference]: Finished difference Result 2430 states and 3107 transitions. [2021-12-19 13:13:37,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-19 13:13:37,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-19 13:13:37,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:13:37,880 INFO L225 Difference]: With dead ends: 2430 [2021-12-19 13:13:37,881 INFO L226 Difference]: Without dead ends: 2430 [2021-12-19 13:13:37,881 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:13:37,884 INFO L933 BasicCegarLoop]: 1014 mSDtfsCounter, 2141 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2147 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-19 13:13:37,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2147 Valid, 1973 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-12-19 13:13:37,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2021-12-19 13:13:37,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 1407. [2021-12-19 13:13:37,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1407 states, 916 states have (on average 1.9868995633187774) internal successors, (1820), 1388 states have internal predecessors, (1820), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-19 13:13:37,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 1850 transitions. [2021-12-19 13:13:37,909 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 1850 transitions. Word has length 9 [2021-12-19 13:13:37,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:13:37,909 INFO L470 AbstractCegarLoop]: Abstraction has 1407 states and 1850 transitions. [2021-12-19 13:13:37,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:13:37,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1850 transitions. [2021-12-19 13:13:37,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-19 13:13:37,910 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:13:37,910 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:13:37,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-19 13:13:38,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:13:38,120 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:13:38,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:13:38,120 INFO L85 PathProgramCache]: Analyzing trace with hash -102759775, now seen corresponding path program 1 times [2021-12-19 13:13:38,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:13:38,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1048233343] [2021-12-19 13:13:38,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:13:38,121 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:13:38,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:13:38,122 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:13:38,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-19 13:13:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:13:38,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 13:13:38,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:13:38,224 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-12-19 13:13:38,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:13:38,259 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:13:38,259 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:13:38,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1048233343] [2021-12-19 13:13:38,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1048233343] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:13:38,259 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:13:38,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 13:13:38,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26220285] [2021-12-19 13:13:38,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:13:38,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:13:38,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:13:38,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:13:38,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:13:38,261 INFO L87 Difference]: Start difference. First operand 1407 states and 1850 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:13:40,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:13:40,300 INFO L93 Difference]: Finished difference Result 2046 states and 2685 transitions. [2021-12-19 13:13:40,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 13:13:40,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-19 13:13:40,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:13:40,305 INFO L225 Difference]: With dead ends: 2046 [2021-12-19 13:13:40,306 INFO L226 Difference]: Without dead ends: 2046 [2021-12-19 13:13:40,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:13:40,306 INFO L933 BasicCegarLoop]: 1193 mSDtfsCounter, 1375 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 2096 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-19 13:13:40,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1378 Valid, 2096 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-12-19 13:13:40,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2021-12-19 13:13:40,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 1397. [2021-12-19 13:13:40,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1397 states, 916 states have (on average 1.960698689956332) internal successors, (1796), 1378 states have internal predecessors, (1796), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-19 13:13:40,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 1826 transitions. [2021-12-19 13:13:40,324 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 1826 transitions. Word has length 9 [2021-12-19 13:13:40,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:13:40,325 INFO L470 AbstractCegarLoop]: Abstraction has 1397 states and 1826 transitions. [2021-12-19 13:13:40,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:13:40,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 1826 transitions. [2021-12-19 13:13:40,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-19 13:13:40,325 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:13:40,325 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:13:40,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-19 13:13:40,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:13:40,533 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr516ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:13:40,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:13:40,533 INFO L85 PathProgramCache]: Analyzing trace with hash -856298529, now seen corresponding path program 1 times [2021-12-19 13:13:40,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:13:40,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1575647749] [2021-12-19 13:13:40,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:13:40,535 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:13:40,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:13:40,536 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:13:40,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-19 13:13:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:13:40,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 13:13:40,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:13:40,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:13:40,690 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:13:40,690 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:13:40,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1575647749] [2021-12-19 13:13:40,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1575647749] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:13:40,690 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:13:40,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 13:13:40,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031162000] [2021-12-19 13:13:40,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:13:40,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:13:40,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:13:40,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:13:40,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:13:40,692 INFO L87 Difference]: Start difference. First operand 1397 states and 1826 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:13:41,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:13:41,130 INFO L93 Difference]: Finished difference Result 1873 states and 2393 transitions. [2021-12-19 13:13:41,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-19 13:13:41,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-19 13:13:41,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:13:41,135 INFO L225 Difference]: With dead ends: 1873 [2021-12-19 13:13:41,135 INFO L226 Difference]: Without dead ends: 1873 [2021-12-19 13:13:41,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:13:41,137 INFO L933 BasicCegarLoop]: 1156 mSDtfsCounter, 546 mSDsluCounter, 1966 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 3122 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-19 13:13:41,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [555 Valid, 3122 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-19 13:13:41,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2021-12-19 13:13:41,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1648. [2021-12-19 13:13:41,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1167 states have (on average 1.974293059125964) internal successors, (2304), 1629 states have internal predecessors, (2304), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-19 13:13:41,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2334 transitions. [2021-12-19 13:13:41,182 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2334 transitions. Word has length 11 [2021-12-19 13:13:41,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:13:41,182 INFO L470 AbstractCegarLoop]: Abstraction has 1648 states and 2334 transitions. [2021-12-19 13:13:41,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:13:41,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2334 transitions. [2021-12-19 13:13:41,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-19 13:13:41,183 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:13:41,183 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:13:41,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-19 13:13:41,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:13:41,383 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:13:41,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:13:41,384 INFO L85 PathProgramCache]: Analyzing trace with hash 2117571646, now seen corresponding path program 1 times [2021-12-19 13:13:41,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:13:41,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816994771] [2021-12-19 13:13:41,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:13:41,384 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:13:41,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:13:41,387 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:13:41,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-19 13:13:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:13:41,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 13:13:41,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:13:41,508 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 13:13:41,508 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 13:13:41,509 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 13:13:41,541 INFO L354 Elim1Store]: treesize reduction 166, result has 13.5 percent of original size [2021-12-19 13:13:41,541 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 3 case distinctions, treesize of input 30 treesize of output 36 [2021-12-19 13:13:41,575 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-12-19 13:13:41,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 23 [2021-12-19 13:13:41,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:13:41,597 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:13:41,597 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:13:41,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816994771] [2021-12-19 13:13:41,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816994771] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:13:41,597 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:13:41,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 13:13:41,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321745716] [2021-12-19 13:13:41,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:13:41,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:13:41,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:13:41,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:13:41,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:13:41,598 INFO L87 Difference]: Start difference. First operand 1648 states and 2334 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:13:42,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:13:42,479 INFO L93 Difference]: Finished difference Result 1654 states and 2037 transitions. [2021-12-19 13:13:42,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 13:13:42,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-19 13:13:42,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:13:42,484 INFO L225 Difference]: With dead ends: 1654 [2021-12-19 13:13:42,484 INFO L226 Difference]: Without dead ends: 1654 [2021-12-19 13:13:42,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:13:42,485 INFO L933 BasicCegarLoop]: 1040 mSDtfsCounter, 357 mSDsluCounter, 1937 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 2977 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-19 13:13:42,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [362 Valid, 2977 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-19 13:13:42,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2021-12-19 13:13:42,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1290. [2021-12-19 13:13:42,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 811 states have (on average 1.9506781750924784) internal successors, (1582), 1273 states have internal predecessors, (1582), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-12-19 13:13:42,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1608 transitions. [2021-12-19 13:13:42,521 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1608 transitions. Word has length 14 [2021-12-19 13:13:42,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:13:42,521 INFO L470 AbstractCegarLoop]: Abstraction has 1290 states and 1608 transitions. [2021-12-19 13:13:42,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:13:42,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1608 transitions. [2021-12-19 13:13:42,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-19 13:13:42,523 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:13:42,523 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:13:42,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-19 13:13:42,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:13:42,731 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:13:42,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:13:42,731 INFO L85 PathProgramCache]: Analyzing trace with hash 769788685, now seen corresponding path program 1 times [2021-12-19 13:13:42,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:13:42,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244158867] [2021-12-19 13:13:42,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:13:42,732 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:13:42,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:13:42,734 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:13:42,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-19 13:13:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:13:42,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 13:13:42,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:13:42,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:13:42,896 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:13:42,896 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:13:42,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244158867] [2021-12-19 13:13:42,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244158867] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:13:42,896 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:13:42,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 13:13:42,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017790694] [2021-12-19 13:13:42,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:13:42,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-19 13:13:42,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:13:42,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 13:13:42,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 13:13:42,898 INFO L87 Difference]: Start difference. First operand 1290 states and 1608 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:13:42,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:13:42,916 INFO L93 Difference]: Finished difference Result 1230 states and 1522 transitions. [2021-12-19 13:13:42,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 13:13:42,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-19 13:13:42,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:13:42,919 INFO L225 Difference]: With dead ends: 1230 [2021-12-19 13:13:42,920 INFO L226 Difference]: Without dead ends: 1230 [2021-12-19 13:13:42,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 13:13:42,920 INFO L933 BasicCegarLoop]: 1029 mSDtfsCounter, 959 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-19 13:13:42,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [971 Valid, 1096 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-19 13:13:42,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2021-12-19 13:13:42,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1230. [2021-12-19 13:13:42,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 775 states have (on average 1.9303225806451614) internal successors, (1496), 1213 states have internal predecessors, (1496), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-12-19 13:13:42,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1522 transitions. [2021-12-19 13:13:42,933 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1522 transitions. Word has length 19 [2021-12-19 13:13:42,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:13:42,933 INFO L470 AbstractCegarLoop]: Abstraction has 1230 states and 1522 transitions. [2021-12-19 13:13:42,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:13:42,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1522 transitions. [2021-12-19 13:13:42,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-19 13:13:42,934 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:13:42,934 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:13:42,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-19 13:13:43,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:13:43,140 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:13:43,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:13:43,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1032548102, now seen corresponding path program 1 times [2021-12-19 13:13:43,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:13:43,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398161908] [2021-12-19 13:13:43,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:13:43,141 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:13:43,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:13:43,142 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:13:43,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-19 13:13:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:13:43,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-19 13:13:43,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:13:43,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:13:43,295 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:13:43,295 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:13:43,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398161908] [2021-12-19 13:13:43,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398161908] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:13:43,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:13:43,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 13:13:43,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053948451] [2021-12-19 13:13:43,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:13:43,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:13:43,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:13:43,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:13:43,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:13:43,296 INFO L87 Difference]: Start difference. First operand 1230 states and 1522 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:13:43,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:13:43,342 INFO L93 Difference]: Finished difference Result 1202 states and 1466 transitions. [2021-12-19 13:13:43,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 13:13:43,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-19 13:13:43,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:13:43,346 INFO L225 Difference]: With dead ends: 1202 [2021-12-19 13:13:43,346 INFO L226 Difference]: Without dead ends: 1202 [2021-12-19 13:13:43,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:13:43,346 INFO L933 BasicCegarLoop]: 984 mSDtfsCounter, 930 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 2028 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-19 13:13:43,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [942 Valid, 2028 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-19 13:13:43,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2021-12-19 13:13:43,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1200. [2021-12-19 13:13:43,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 759 states have (on average 1.8945981554677207) internal successors, (1438), 1183 states have internal predecessors, (1438), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-12-19 13:13:43,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1464 transitions. [2021-12-19 13:13:43,374 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1464 transitions. Word has length 21 [2021-12-19 13:13:43,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:13:43,374 INFO L470 AbstractCegarLoop]: Abstraction has 1200 states and 1464 transitions. [2021-12-19 13:13:43,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:13:43,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1464 transitions. [2021-12-19 13:13:43,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-19 13:13:43,375 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:13:43,375 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:13:43,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-19 13:13:43,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:13:43,583 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:13:43,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:13:43,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1673308372, now seen corresponding path program 1 times [2021-12-19 13:13:43,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:13:43,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [730791053] [2021-12-19 13:13:43,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:13:43,584 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:13:43,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:13:43,585 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:13:43,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-19 13:13:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:13:43,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 13:13:43,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:13:43,717 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-12-19 13:13:43,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:13:43,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:13:43,781 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:13:43,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [730791053] [2021-12-19 13:13:43,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [730791053] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:13:43,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:13:43,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 13:13:43,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841762394] [2021-12-19 13:13:43,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:13:43,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-19 13:13:43,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:13:43,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-19 13:13:43,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:13:43,782 INFO L87 Difference]: Start difference. First operand 1200 states and 1464 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:13:45,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:13:45,848 INFO L93 Difference]: Finished difference Result 2184 states and 2665 transitions. [2021-12-19 13:13:45,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-19 13:13:45,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-19 13:13:45,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:13:45,853 INFO L225 Difference]: With dead ends: 2184 [2021-12-19 13:13:45,853 INFO L226 Difference]: Without dead ends: 2184 [2021-12-19 13:13:45,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-19 13:13:45,853 INFO L933 BasicCegarLoop]: 841 mSDtfsCounter, 2037 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 1841 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2040 SdHoareTripleChecker+Valid, 2019 SdHoareTripleChecker+Invalid, 1860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-19 13:13:45,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2040 Valid, 2019 Invalid, 1860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1841 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-12-19 13:13:45,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2021-12-19 13:13:45,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 1196. [2021-12-19 13:13:45,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 759 states have (on average 1.8840579710144927) internal successors, (1430), 1179 states have internal predecessors, (1430), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-12-19 13:13:45,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1456 transitions. [2021-12-19 13:13:45,866 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1456 transitions. Word has length 35 [2021-12-19 13:13:45,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:13:45,866 INFO L470 AbstractCegarLoop]: Abstraction has 1196 states and 1456 transitions. [2021-12-19 13:13:45,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:13:45,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1456 transitions. [2021-12-19 13:13:45,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-19 13:13:45,867 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:13:45,867 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:13:45,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-19 13:13:46,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:13:46,075 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:13:46,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:13:46,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1673308373, now seen corresponding path program 1 times [2021-12-19 13:13:46,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:13:46,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1622445190] [2021-12-19 13:13:46,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:13:46,076 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:13:46,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:13:46,077 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:13:46,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-19 13:13:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:13:46,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 13:13:46,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:13:46,215 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-12-19 13:13:46,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:13:46,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:13:46,360 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:13:46,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1622445190] [2021-12-19 13:13:46,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1622445190] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:13:46,360 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:13:46,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 13:13:46,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278245854] [2021-12-19 13:13:46,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:13:46,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-19 13:13:46,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:13:46,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-19 13:13:46,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:13:46,361 INFO L87 Difference]: Start difference. First operand 1196 states and 1456 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:13:48,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:13:48,734 INFO L93 Difference]: Finished difference Result 1806 states and 2219 transitions. [2021-12-19 13:13:48,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-19 13:13:48,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-19 13:13:48,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:13:48,747 INFO L225 Difference]: With dead ends: 1806 [2021-12-19 13:13:48,747 INFO L226 Difference]: Without dead ends: 1806 [2021-12-19 13:13:48,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-19 13:13:48,748 INFO L933 BasicCegarLoop]: 1234 mSDtfsCounter, 1782 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1782 SdHoareTripleChecker+Valid, 2595 SdHoareTripleChecker+Invalid, 1632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-19 13:13:48,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1782 Valid, 2595 Invalid, 1632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-12-19 13:13:48,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2021-12-19 13:13:48,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1192. [2021-12-19 13:13:48,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 759 states have (on average 1.8735177865612649) internal successors, (1422), 1175 states have internal predecessors, (1422), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-12-19 13:13:48,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1448 transitions. [2021-12-19 13:13:48,761 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1448 transitions. Word has length 35 [2021-12-19 13:13:48,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:13:48,761 INFO L470 AbstractCegarLoop]: Abstraction has 1192 states and 1448 transitions. [2021-12-19 13:13:48,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:13:48,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1448 transitions. [2021-12-19 13:13:48,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-19 13:13:48,766 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:13:48,766 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:13:48,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-19 13:13:48,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:13:48,975 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting alt_mallocErr0REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:13:48,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:13:48,975 INFO L85 PathProgramCache]: Analyzing trace with hash -2063927218, now seen corresponding path program 1 times [2021-12-19 13:13:48,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:13:48,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858236703] [2021-12-19 13:13:48,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:13:48,976 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:13:48,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:13:48,977 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:13:48,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-19 13:13:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:13:49,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-19 13:13:49,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:13:49,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:13:49,246 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:13:49,246 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:13:49,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1858236703] [2021-12-19 13:13:49,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1858236703] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:13:49,247 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:13:49,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 13:13:49,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463849008] [2021-12-19 13:13:49,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:13:49,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:13:49,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:13:49,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:13:49,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:13:49,248 INFO L87 Difference]: Start difference. First operand 1192 states and 1448 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:13:49,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:13:49,282 INFO L93 Difference]: Finished difference Result 1180 states and 1428 transitions. [2021-12-19 13:13:49,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 13:13:49,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-12-19 13:13:49,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:13:49,287 INFO L225 Difference]: With dead ends: 1180 [2021-12-19 13:13:49,287 INFO L226 Difference]: Without dead ends: 1180 [2021-12-19 13:13:49,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:13:49,287 INFO L933 BasicCegarLoop]: 978 mSDtfsCounter, 906 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 2006 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-19 13:13:49,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [918 Valid, 2006 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-19 13:13:49,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2021-12-19 13:13:49,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1180. [2021-12-19 13:13:49,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 747 states have (on average 1.8768406961178046) internal successors, (1402), 1163 states have internal predecessors, (1402), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-12-19 13:13:49,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1428 transitions. [2021-12-19 13:13:49,297 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1428 transitions. Word has length 54 [2021-12-19 13:13:49,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:13:49,298 INFO L470 AbstractCegarLoop]: Abstraction has 1180 states and 1428 transitions. [2021-12-19 13:13:49,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:13:49,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1428 transitions. [2021-12-19 13:13:49,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-19 13:13:49,298 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:13:49,298 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:13:49,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-19 13:13:49,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:13:49,507 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting alt_mallocErr0REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:13:49,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:13:49,508 INFO L85 PathProgramCache]: Analyzing trace with hash -203140862, now seen corresponding path program 1 times [2021-12-19 13:13:49,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:13:49,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307470839] [2021-12-19 13:13:49,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:13:49,508 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:13:49,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:13:49,509 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:13:49,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-19 13:13:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:13:49,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 13:13:49,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:13:49,801 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:13:49,802 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 19 treesize of output 26 [2021-12-19 13:13:49,825 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-19 13:13:49,825 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 14 treesize of output 19 [2021-12-19 13:13:50,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:13:50,053 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:13:50,053 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:13:50,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307470839] [2021-12-19 13:13:50,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307470839] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:13:50,054 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:13:50,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-19 13:13:50,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767083538] [2021-12-19 13:13:50,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:13:50,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 13:13:50,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:13:50,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 13:13:50,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:13:50,056 INFO L87 Difference]: Start difference. First operand 1180 states and 1428 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:13:52,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:13:52,095 INFO L93 Difference]: Finished difference Result 2641 states and 3168 transitions. [2021-12-19 13:13:52,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 13:13:52,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-12-19 13:13:52,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:13:52,101 INFO L225 Difference]: With dead ends: 2641 [2021-12-19 13:13:52,102 INFO L226 Difference]: Without dead ends: 2641 [2021-12-19 13:13:52,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 13:13:52,102 INFO L933 BasicCegarLoop]: 881 mSDtfsCounter, 1374 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 1524 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 1960 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-19 13:13:52,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1377 Valid, 1960 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1524 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-12-19 13:13:52,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2641 states. [2021-12-19 13:13:52,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2641 to 1617. [2021-12-19 13:13:52,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1169 states have (on average 1.872540633019675) internal successors, (2189), 1588 states have internal predecessors, (2189), 25 states have call successors, (25), 8 states have call predecessors, (25), 7 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-19 13:13:52,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2239 transitions. [2021-12-19 13:13:52,120 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2239 transitions. Word has length 62 [2021-12-19 13:13:52,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:13:52,121 INFO L470 AbstractCegarLoop]: Abstraction has 1617 states and 2239 transitions. [2021-12-19 13:13:52,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:13:52,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2239 transitions. [2021-12-19 13:13:52,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-19 13:13:52,121 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:13:52,121 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:13:52,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-19 13:13:52,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:13:52,334 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting alt_mallocErr1REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:13:52,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:13:52,334 INFO L85 PathProgramCache]: Analyzing trace with hash -203140861, now seen corresponding path program 1 times [2021-12-19 13:13:52,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:13:52,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760140858] [2021-12-19 13:13:52,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:13:52,335 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:13:52,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:13:52,336 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:13:52,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-19 13:13:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:13:52,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-19 13:13:52,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:13:52,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 13:13:52,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-19 13:13:52,673 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:13:52,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-19 13:13:53,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:13:53,158 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:13:53,158 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:13:53,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760140858] [2021-12-19 13:13:53,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760140858] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:13:53,159 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:13:53,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 13:13:53,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109310133] [2021-12-19 13:13:53,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:13:53,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-19 13:13:53,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:13:53,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-19 13:13:53,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-19 13:13:53,160 INFO L87 Difference]: Start difference. First operand 1617 states and 2239 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:13:55,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:13:55,200 INFO L93 Difference]: Finished difference Result 1623 states and 2246 transitions. [2021-12-19 13:13:55,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-19 13:13:55,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-12-19 13:13:55,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:13:55,204 INFO L225 Difference]: With dead ends: 1623 [2021-12-19 13:13:55,204 INFO L226 Difference]: Without dead ends: 1623 [2021-12-19 13:13:55,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-19 13:13:55,205 INFO L933 BasicCegarLoop]: 960 mSDtfsCounter, 111 mSDsluCounter, 1516 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 2476 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-19 13:13:55,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 2476 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-12-19 13:13:55,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2021-12-19 13:13:55,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1622. [2021-12-19 13:13:55,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1173 states have (on average 1.8695652173913044) internal successors, (2193), 1592 states have internal predecessors, (2193), 26 states have call successors, (26), 9 states have call predecessors, (26), 7 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2021-12-19 13:13:55,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2245 transitions. [2021-12-19 13:13:55,220 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2245 transitions. Word has length 62 [2021-12-19 13:13:55,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:13:55,220 INFO L470 AbstractCegarLoop]: Abstraction has 1622 states and 2245 transitions. [2021-12-19 13:13:55,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:13:55,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2245 transitions. [2021-12-19 13:13:55,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-19 13:13:55,221 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:13:55,221 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:13:55,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-19 13:13:55,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:13:55,433 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:13:55,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:13:55,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1864793253, now seen corresponding path program 1 times [2021-12-19 13:13:55,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:13:55,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960882988] [2021-12-19 13:13:55,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:13:55,435 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:13:55,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:13:55,436 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:13:55,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-19 13:13:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:13:55,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 13:13:55,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:13:55,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:13:55,744 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:13:55,744 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:13:55,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960882988] [2021-12-19 13:13:55,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [960882988] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:13:55,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:13:55,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-19 13:13:55,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858305215] [2021-12-19 13:13:55,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:13:55,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-19 13:13:55,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:13:55,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-19 13:13:55,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-19 13:13:55,747 INFO L87 Difference]: Start difference. First operand 1622 states and 2245 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:13:55,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:13:55,823 INFO L93 Difference]: Finished difference Result 1648 states and 2272 transitions. [2021-12-19 13:13:55,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-19 13:13:55,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-12-19 13:13:55,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:13:55,827 INFO L225 Difference]: With dead ends: 1648 [2021-12-19 13:13:55,827 INFO L226 Difference]: Without dead ends: 1648 [2021-12-19 13:13:55,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-19 13:13:55,828 INFO L933 BasicCegarLoop]: 975 mSDtfsCounter, 19 mSDsluCounter, 3893 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 4868 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-19 13:13:55,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 4868 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-19 13:13:55,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2021-12-19 13:13:55,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1646. [2021-12-19 13:13:55,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1646 states, 1191 states have (on average 1.8606213266162888) internal successors, (2216), 1612 states have internal predecessors, (2216), 28 states have call successors, (28), 13 states have call predecessors, (28), 11 states have return successors, (28), 24 states have call predecessors, (28), 28 states have call successors, (28) [2021-12-19 13:13:55,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2272 transitions. [2021-12-19 13:13:55,850 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2272 transitions. Word has length 68 [2021-12-19 13:13:55,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:13:55,851 INFO L470 AbstractCegarLoop]: Abstraction has 1646 states and 2272 transitions. [2021-12-19 13:13:55,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 13:13:55,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2272 transitions. [2021-12-19 13:13:55,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-19 13:13:55,851 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:13:55,852 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:13:55,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-19 13:13:56,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:13:56,056 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:13:56,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:13:56,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1913615011, now seen corresponding path program 1 times [2021-12-19 13:13:56,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:13:56,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1677844438] [2021-12-19 13:13:56,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:13:56,058 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:13:56,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:13:56,059 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:13:56,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-19 13:13:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:13:56,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-19 13:13:56,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:13:56,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:13:56,411 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:13:56,411 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:13:56,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1677844438] [2021-12-19 13:13:56,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1677844438] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:13:56,411 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:13:56,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-19 13:13:56,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016100829] [2021-12-19 13:13:56,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:13:56,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-19 13:13:56,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:13:56,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-19 13:13:56,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-19 13:13:56,412 INFO L87 Difference]: Start difference. First operand 1646 states and 2272 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-19 13:13:56,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:13:56,532 INFO L93 Difference]: Finished difference Result 1658 states and 2286 transitions. [2021-12-19 13:13:56,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-19 13:13:56,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2021-12-19 13:13:56,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:13:56,546 INFO L225 Difference]: With dead ends: 1658 [2021-12-19 13:13:56,547 INFO L226 Difference]: Without dead ends: 1658 [2021-12-19 13:13:56,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-19 13:13:56,547 INFO L933 BasicCegarLoop]: 975 mSDtfsCounter, 23 mSDsluCounter, 2824 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3799 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-19 13:13:56,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 3799 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-19 13:13:56,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2021-12-19 13:13:56,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1649. [2021-12-19 13:13:56,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1193 states have (on average 1.859178541492037) internal successors, (2218), 1614 states have internal predecessors, (2218), 28 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2021-12-19 13:13:56,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2275 transitions. [2021-12-19 13:13:56,586 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2275 transitions. Word has length 68 [2021-12-19 13:13:56,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:13:56,587 INFO L470 AbstractCegarLoop]: Abstraction has 1649 states and 2275 transitions. [2021-12-19 13:13:56,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-19 13:13:56,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2275 transitions. [2021-12-19 13:13:56,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-19 13:13:56,588 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:13:56,588 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:13:56,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2021-12-19 13:13:56,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:13:56,798 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:13:56,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:13:56,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1847999061, now seen corresponding path program 1 times [2021-12-19 13:13:56,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:13:56,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [167269919] [2021-12-19 13:13:56,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:13:56,799 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:13:56,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:13:56,800 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:13:56,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-19 13:13:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:13:57,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 13:13:57,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:13:57,106 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-12-19 13:13:57,301 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-19 13:13:57,301 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 15 treesize of output 20 [2021-12-19 13:13:57,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:13:57,309 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:13:57,309 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:13:57,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [167269919] [2021-12-19 13:13:57,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [167269919] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:13:57,309 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:13:57,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-19 13:13:57,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699088301] [2021-12-19 13:13:57,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:13:57,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-19 13:13:57,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:13:57,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-19 13:13:57,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-19 13:13:57,310 INFO L87 Difference]: Start difference. First operand 1649 states and 2275 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-19 13:13:59,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:13:59,642 INFO L93 Difference]: Finished difference Result 2771 states and 3753 transitions. [2021-12-19 13:13:59,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-19 13:13:59,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-12-19 13:13:59,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:13:59,647 INFO L225 Difference]: With dead ends: 2771 [2021-12-19 13:13:59,647 INFO L226 Difference]: Without dead ends: 2771 [2021-12-19 13:13:59,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-19 13:13:59,647 INFO L933 BasicCegarLoop]: 807 mSDtfsCounter, 1430 mSDsluCounter, 2180 mSDsCounter, 0 mSdLazyCounter, 2110 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 2987 SdHoareTripleChecker+Invalid, 2871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 742 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-19 13:13:59,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1436 Valid, 2987 Invalid, 2871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2110 Invalid, 0 Unknown, 742 Unchecked, 2.3s Time] [2021-12-19 13:13:59,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2771 states. [2021-12-19 13:13:59,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2771 to 1648. [2021-12-19 13:13:59,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1193 states have (on average 1.8575020955574182) internal successors, (2216), 1613 states have internal predecessors, (2216), 28 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2021-12-19 13:13:59,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2273 transitions. [2021-12-19 13:13:59,673 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2273 transitions. Word has length 73 [2021-12-19 13:13:59,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:13:59,674 INFO L470 AbstractCegarLoop]: Abstraction has 1648 states and 2273 transitions. [2021-12-19 13:13:59,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-19 13:13:59,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2273 transitions. [2021-12-19 13:13:59,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-19 13:13:59,675 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:13:59,675 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:13:59,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-19 13:13:59,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:13:59,891 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:13:59,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:13:59,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1847999062, now seen corresponding path program 1 times [2021-12-19 13:13:59,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:13:59,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113055012] [2021-12-19 13:13:59,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:13:59,892 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:13:59,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:13:59,892 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:13:59,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-19 13:14:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:14:00,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-19 13:14:00,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:14:00,210 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-12-19 13:14:00,214 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-12-19 13:14:00,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 13:14:00,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-19 13:14:00,597 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:14:00,597 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-12-19 13:14:00,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:14:00,610 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:14:00,610 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:14:00,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113055012] [2021-12-19 13:14:00,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113055012] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:14:00,610 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:14:00,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-19 13:14:00,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386487785] [2021-12-19 13:14:00,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:14:00,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-19 13:14:00,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:14:00,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-19 13:14:00,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-19 13:14:00,611 INFO L87 Difference]: Start difference. First operand 1648 states and 2273 transitions. Second operand has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-19 13:14:04,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:14:04,326 INFO L93 Difference]: Finished difference Result 2842 states and 3878 transitions. [2021-12-19 13:14:04,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-19 13:14:04,331 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-12-19 13:14:04,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:14:04,335 INFO L225 Difference]: With dead ends: 2842 [2021-12-19 13:14:04,335 INFO L226 Difference]: Without dead ends: 2842 [2021-12-19 13:14:04,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-19 13:14:04,336 INFO L933 BasicCegarLoop]: 1061 mSDtfsCounter, 2203 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 3073 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2209 SdHoareTripleChecker+Valid, 3042 SdHoareTripleChecker+Invalid, 3985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 3073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 882 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2021-12-19 13:14:04,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2209 Valid, 3042 Invalid, 3985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 3073 Invalid, 0 Unknown, 882 Unchecked, 3.7s Time] [2021-12-19 13:14:04,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2021-12-19 13:14:04,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 1644. [2021-12-19 13:14:04,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1644 states, 1197 states have (on average 1.8412698412698412) internal successors, (2204), 1609 states have internal predecessors, (2204), 28 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2021-12-19 13:14:04,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 2261 transitions. [2021-12-19 13:14:04,376 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 2261 transitions. Word has length 73 [2021-12-19 13:14:04,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:14:04,376 INFO L470 AbstractCegarLoop]: Abstraction has 1644 states and 2261 transitions. [2021-12-19 13:14:04,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-19 13:14:04,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2261 transitions. [2021-12-19 13:14:04,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-19 13:14:04,378 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:14:04,378 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:14:04,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-19 13:14:04,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:14:04,584 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:14:04,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:14:04,584 INFO L85 PathProgramCache]: Analyzing trace with hash 816968073, now seen corresponding path program 1 times [2021-12-19 13:14:04,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:14:04,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331396624] [2021-12-19 13:14:04,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:14:04,585 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:14:04,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:14:04,586 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:14:04,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-19 13:14:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:14:04,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 13:14:04,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:14:04,880 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-12-19 13:14:04,893 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 13 treesize of output 9 [2021-12-19 13:14:04,929 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 24 treesize of output 12 [2021-12-19 13:14:04,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:14:04,951 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:14:04,951 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:14:04,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [331396624] [2021-12-19 13:14:04,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [331396624] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:14:04,952 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:14:04,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-19 13:14:04,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643626243] [2021-12-19 13:14:04,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:14:04,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-19 13:14:04,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:14:04,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-19 13:14:04,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-19 13:14:04,953 INFO L87 Difference]: Start difference. First operand 1644 states and 2261 transitions. Second operand has 8 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-19 13:14:07,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:14:07,336 INFO L93 Difference]: Finished difference Result 1659 states and 2277 transitions. [2021-12-19 13:14:07,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-19 13:14:07,337 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 80 [2021-12-19 13:14:07,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:14:07,339 INFO L225 Difference]: With dead ends: 1659 [2021-12-19 13:14:07,339 INFO L226 Difference]: Without dead ends: 1659 [2021-12-19 13:14:07,340 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-19 13:14:07,340 INFO L933 BasicCegarLoop]: 961 mSDtfsCounter, 23 mSDsluCounter, 3121 mSDsCounter, 0 mSdLazyCounter, 2696 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4082 SdHoareTripleChecker+Invalid, 2698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-19 13:14:07,340 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 4082 Invalid, 2698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2696 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-12-19 13:14:07,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2021-12-19 13:14:07,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1658. [2021-12-19 13:14:07,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1209 states have (on average 1.836228287841191) internal successors, (2220), 1621 states have internal predecessors, (2220), 28 states have call successors, (28), 15 states have call predecessors, (28), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2021-12-19 13:14:07,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2277 transitions. [2021-12-19 13:14:07,356 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2277 transitions. Word has length 80 [2021-12-19 13:14:07,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:14:07,356 INFO L470 AbstractCegarLoop]: Abstraction has 1658 states and 2277 transitions. [2021-12-19 13:14:07,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-19 13:14:07,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2277 transitions. [2021-12-19 13:14:07,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-12-19 13:14:07,357 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:14:07,357 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:14:07,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-19 13:14:07,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:14:07,567 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:14:07,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:14:07,567 INFO L85 PathProgramCache]: Analyzing trace with hash -443793445, now seen corresponding path program 1 times [2021-12-19 13:14:07,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:14:07,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726834836] [2021-12-19 13:14:07,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:14:07,568 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:14:07,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:14:07,569 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:14:07,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-19 13:14:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:14:07,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-19 13:14:07,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:14:07,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-19 13:14:07,922 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 13 treesize of output 9 [2021-12-19 13:14:07,928 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 13 treesize of output 9 [2021-12-19 13:14:07,973 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 19 treesize of output 7 [2021-12-19 13:14:07,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2021-12-19 13:14:08,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:14:08,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:14:08,033 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:14:08,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726834836] [2021-12-19 13:14:08,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726834836] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:14:08,033 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:14:08,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-19 13:14:08,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412450111] [2021-12-19 13:14:08,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:14:08,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-19 13:14:08,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:14:08,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-19 13:14:08,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-19 13:14:08,034 INFO L87 Difference]: Start difference. First operand 1658 states and 2277 transitions. Second operand has 9 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-19 13:14:11,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:14:11,181 INFO L93 Difference]: Finished difference Result 1658 states and 2275 transitions. [2021-12-19 13:14:11,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-19 13:14:11,182 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 81 [2021-12-19 13:14:11,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:14:11,184 INFO L225 Difference]: With dead ends: 1658 [2021-12-19 13:14:11,184 INFO L226 Difference]: Without dead ends: 1658 [2021-12-19 13:14:11,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-19 13:14:11,184 INFO L933 BasicCegarLoop]: 956 mSDtfsCounter, 19 mSDsluCounter, 3932 mSDsCounter, 0 mSdLazyCounter, 2858 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 4888 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-12-19 13:14:11,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 4888 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2858 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2021-12-19 13:14:11,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2021-12-19 13:14:11,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1658. [2021-12-19 13:14:11,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1209 states have (on average 1.8345740281224152) internal successors, (2218), 1621 states have internal predecessors, (2218), 28 states have call successors, (28), 15 states have call predecessors, (28), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2021-12-19 13:14:11,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2275 transitions. [2021-12-19 13:14:11,198 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2275 transitions. Word has length 81 [2021-12-19 13:14:11,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:14:11,198 INFO L470 AbstractCegarLoop]: Abstraction has 1658 states and 2275 transitions. [2021-12-19 13:14:11,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-19 13:14:11,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2275 transitions. [2021-12-19 13:14:11,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-19 13:14:11,199 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:14:11,199 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:14:11,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-19 13:14:11,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:14:11,409 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:14:11,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:14:11,410 INFO L85 PathProgramCache]: Analyzing trace with hash 540063607, now seen corresponding path program 1 times [2021-12-19 13:14:11,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:14:11,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133736838] [2021-12-19 13:14:11,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:14:11,411 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:14:11,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:14:11,412 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:14:11,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-19 13:14:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:14:11,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 13:14:11,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:14:11,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:14:11,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 13:14:11,795 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:14:11,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133736838] [2021-12-19 13:14:11,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [133736838] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 13:14:11,795 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 13:14:11,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-19 13:14:11,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606391924] [2021-12-19 13:14:11,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 13:14:11,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-19 13:14:11,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:14:11,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-19 13:14:11,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-19 13:14:11,796 INFO L87 Difference]: Start difference. First operand 1658 states and 2275 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-19 13:14:11,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:14:11,845 INFO L93 Difference]: Finished difference Result 1674 states and 2293 transitions. [2021-12-19 13:14:11,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-19 13:14:11,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 88 [2021-12-19 13:14:11,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:14:11,848 INFO L225 Difference]: With dead ends: 1674 [2021-12-19 13:14:11,848 INFO L226 Difference]: Without dead ends: 1668 [2021-12-19 13:14:11,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-19 13:14:11,848 INFO L933 BasicCegarLoop]: 964 mSDtfsCounter, 10 mSDsluCounter, 2876 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 3840 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-19 13:14:11,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 3840 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-19 13:14:11,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2021-12-19 13:14:11,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1668. [2021-12-19 13:14:11,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1668 states, 1217 states have (on average 1.8307313064913722) internal successors, (2228), 1631 states have internal predecessors, (2228), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2021-12-19 13:14:11,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 2287 transitions. [2021-12-19 13:14:11,863 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 2287 transitions. Word has length 88 [2021-12-19 13:14:11,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:14:11,863 INFO L470 AbstractCegarLoop]: Abstraction has 1668 states and 2287 transitions. [2021-12-19 13:14:11,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-19 13:14:11,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2287 transitions. [2021-12-19 13:14:11,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-12-19 13:14:11,864 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:14:11,864 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:14:11,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-12-19 13:14:12,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:14:12,074 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:14:12,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:14:12,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1380796229, now seen corresponding path program 1 times [2021-12-19 13:14:12,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:14:12,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831735024] [2021-12-19 13:14:12,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:14:12,075 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:14:12,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:14:12,076 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:14:12,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-19 13:14:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:14:12,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-19 13:14:12,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:14:12,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:14:12,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:14:12,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:14:12,619 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:14:12,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [831735024] [2021-12-19 13:14:12,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [831735024] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 13:14:12,619 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:14:12,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-19 13:14:12,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765019594] [2021-12-19 13:14:12,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:14:12,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-19 13:14:12,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:14:12,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-19 13:14:12,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-19 13:14:12,620 INFO L87 Difference]: Start difference. First operand 1668 states and 2287 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-19 13:14:12,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:14:12,793 INFO L93 Difference]: Finished difference Result 1694 states and 2317 transitions. [2021-12-19 13:14:12,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-19 13:14:12,794 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 89 [2021-12-19 13:14:12,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:14:12,796 INFO L225 Difference]: With dead ends: 1694 [2021-12-19 13:14:12,796 INFO L226 Difference]: Without dead ends: 1682 [2021-12-19 13:14:12,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2021-12-19 13:14:12,796 INFO L933 BasicCegarLoop]: 967 mSDtfsCounter, 42 mSDsluCounter, 5759 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 6726 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-19 13:14:12,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 6726 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-19 13:14:12,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2021-12-19 13:14:12,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1676. [2021-12-19 13:14:12,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1676 states, 1225 states have (on average 1.826938775510204) internal successors, (2238), 1639 states have internal predecessors, (2238), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2021-12-19 13:14:12,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 2297 transitions. [2021-12-19 13:14:12,810 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 2297 transitions. Word has length 89 [2021-12-19 13:14:12,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:14:12,810 INFO L470 AbstractCegarLoop]: Abstraction has 1676 states and 2297 transitions. [2021-12-19 13:14:12,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-19 13:14:12,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2297 transitions. [2021-12-19 13:14:12,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-19 13:14:12,811 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:14:12,811 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:14:12,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-12-19 13:14:13,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:14:13,021 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:14:13,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:14:13,022 INFO L85 PathProgramCache]: Analyzing trace with hash 180173559, now seen corresponding path program 2 times [2021-12-19 13:14:13,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:14:13,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1104439299] [2021-12-19 13:14:13,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 13:14:13,022 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:14:13,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:14:13,024 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:14:13,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-19 13:14:13,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 13:14:13,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 13:14:13,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-19 13:14:13,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:14:13,616 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:14:13,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:14:13,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:14:13,910 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:14:13,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1104439299] [2021-12-19 13:14:13,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1104439299] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 13:14:13,910 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:14:13,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-12-19 13:14:13,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620410133] [2021-12-19 13:14:13,910 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:14:13,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-19 13:14:13,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:14:13,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-19 13:14:13,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-19 13:14:13,911 INFO L87 Difference]: Start difference. First operand 1676 states and 2297 transitions. Second operand has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-19 13:14:14,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:14:14,386 INFO L93 Difference]: Finished difference Result 1730 states and 2365 transitions. [2021-12-19 13:14:14,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-19 13:14:14,387 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 92 [2021-12-19 13:14:14,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:14:14,389 INFO L225 Difference]: With dead ends: 1730 [2021-12-19 13:14:14,390 INFO L226 Difference]: Without dead ends: 1718 [2021-12-19 13:14:14,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=343, Invalid=649, Unknown=0, NotChecked=0, Total=992 [2021-12-19 13:14:14,390 INFO L933 BasicCegarLoop]: 973 mSDtfsCounter, 89 mSDsluCounter, 6763 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 7736 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-19 13:14:14,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 7736 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-19 13:14:14,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2021-12-19 13:14:14,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1694. [2021-12-19 13:14:14,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1694 states, 1243 states have (on average 1.819790828640386) internal successors, (2262), 1657 states have internal predecessors, (2262), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2021-12-19 13:14:14,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2321 transitions. [2021-12-19 13:14:14,418 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 2321 transitions. Word has length 92 [2021-12-19 13:14:14,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:14:14,419 INFO L470 AbstractCegarLoop]: Abstraction has 1694 states and 2321 transitions. [2021-12-19 13:14:14,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-19 13:14:14,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2321 transitions. [2021-12-19 13:14:14,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-12-19 13:14:14,419 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:14:14,420 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:14:14,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-12-19 13:14:14,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:14:14,631 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:14:14,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:14:14,631 INFO L85 PathProgramCache]: Analyzing trace with hash -231196617, now seen corresponding path program 3 times [2021-12-19 13:14:14,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:14:14,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1627975362] [2021-12-19 13:14:14,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-19 13:14:14,632 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:14:14,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:14:14,633 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:14:14,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-19 13:14:15,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-19 13:14:15,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 13:14:15,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-19 13:14:15,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:14:15,705 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:14:15,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:14:16,407 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:14:16,407 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:14:16,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1627975362] [2021-12-19 13:14:16,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1627975362] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 13:14:16,407 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:14:16,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2021-12-19 13:14:16,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498213718] [2021-12-19 13:14:16,408 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:14:16,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-19 13:14:16,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:14:16,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-19 13:14:16,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2021-12-19 13:14:16,409 INFO L87 Difference]: Start difference. First operand 1694 states and 2321 transitions. Second operand has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-19 13:14:18,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:14:18,808 INFO L93 Difference]: Finished difference Result 1802 states and 2469 transitions. [2021-12-19 13:14:18,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-12-19 13:14:18,808 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 98 [2021-12-19 13:14:18,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:14:18,811 INFO L225 Difference]: With dead ends: 1802 [2021-12-19 13:14:18,811 INFO L226 Difference]: Without dead ends: 1784 [2021-12-19 13:14:18,811 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=924, Invalid=1832, Unknown=0, NotChecked=0, Total=2756 [2021-12-19 13:14:18,812 INFO L933 BasicCegarLoop]: 985 mSDtfsCounter, 212 mSDsluCounter, 12711 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 13696 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-19 13:14:18,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 13696 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-19 13:14:18,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2021-12-19 13:14:18,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1730. [2021-12-19 13:14:18,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1730 states, 1279 states have (on average 1.8045347928068804) internal successors, (2308), 1693 states have internal predecessors, (2308), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2021-12-19 13:14:18,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 2367 transitions. [2021-12-19 13:14:18,826 INFO L78 Accepts]: Start accepts. Automaton has 1730 states and 2367 transitions. Word has length 98 [2021-12-19 13:14:18,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:14:18,826 INFO L470 AbstractCegarLoop]: Abstraction has 1730 states and 2367 transitions. [2021-12-19 13:14:18,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-19 13:14:18,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2367 transitions. [2021-12-19 13:14:18,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-12-19 13:14:18,827 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:14:18,827 INFO L514 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:14:18,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-12-19 13:14:19,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:14:19,044 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:14:19,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:14:19,045 INFO L85 PathProgramCache]: Analyzing trace with hash 922313399, now seen corresponding path program 4 times [2021-12-19 13:14:19,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:14:19,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935577429] [2021-12-19 13:14:19,045 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-19 13:14:19,046 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:14:19,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:14:19,060 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:14:19,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-19 13:14:19,399 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-19 13:14:19,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 13:14:19,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-19 13:14:19,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:14:19,938 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:14:19,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:14:21,496 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 13:14:21,496 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:14:21,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1935577429] [2021-12-19 13:14:21,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1935577429] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 13:14:21,497 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:14:21,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2021-12-19 13:14:21,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925973116] [2021-12-19 13:14:21,497 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:14:21,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-12-19 13:14:21,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:14:21,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-12-19 13:14:21,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2021-12-19 13:14:21,498 INFO L87 Difference]: Start difference. First operand 1730 states and 2367 transitions. Second operand has 52 states, 52 states have (on average 2.5384615384615383) internal successors, (132), 52 states have internal predecessors, (132), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-19 13:14:28,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:14:28,921 INFO L93 Difference]: Finished difference Result 1936 states and 2637 transitions. [2021-12-19 13:14:28,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-12-19 13:14:28,922 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.5384615384615383) internal successors, (132), 52 states have internal predecessors, (132), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 110 [2021-12-19 13:14:28,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:14:28,925 INFO L225 Difference]: With dead ends: 1936 [2021-12-19 13:14:28,925 INFO L226 Difference]: Without dead ends: 1924 [2021-12-19 13:14:28,927 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1902 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=4121, Invalid=9921, Unknown=0, NotChecked=0, Total=14042 [2021-12-19 13:14:28,928 INFO L933 BasicCegarLoop]: 1007 mSDtfsCounter, 428 mSDsluCounter, 24990 mSDsCounter, 0 mSdLazyCounter, 2484 mSolverCounterSat, 449 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 25997 SdHoareTripleChecker+Invalid, 2933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 449 IncrementalHoareTripleChecker+Valid, 2484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-19 13:14:28,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [428 Valid, 25997 Invalid, 2933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [449 Valid, 2484 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-12-19 13:14:28,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1924 states. [2021-12-19 13:14:28,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1924 to 1798. [2021-12-19 13:14:28,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 1347 states have (on average 1.78173719376392) internal successors, (2400), 1761 states have internal predecessors, (2400), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2021-12-19 13:14:28,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 2459 transitions. [2021-12-19 13:14:28,945 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 2459 transitions. Word has length 110 [2021-12-19 13:14:28,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:14:28,946 INFO L470 AbstractCegarLoop]: Abstraction has 1798 states and 2459 transitions. [2021-12-19 13:14:28,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.5384615384615383) internal successors, (132), 52 states have internal predecessors, (132), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-19 13:14:28,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2459 transitions. [2021-12-19 13:14:28,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-12-19 13:14:28,947 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:14:28,947 INFO L514 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:14:28,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-12-19 13:14:29,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:14:29,163 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:14:29,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:14:29,164 INFO L85 PathProgramCache]: Analyzing trace with hash 897981943, now seen corresponding path program 5 times [2021-12-19 13:14:29,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:14:29,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [446721552] [2021-12-19 13:14:29,164 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-19 13:14:29,165 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:14:29,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:14:29,166 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:14:29,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-19 13:14:30,454 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2021-12-19 13:14:30,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 13:14:30,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-19 13:14:30,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:14:30,516 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-12-19 13:14:30,699 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:14:30,699 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-12-19 13:14:30,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-19 13:14:30,790 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 13 [2021-12-19 13:14:32,608 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:14:32,608 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-19 13:14:32,655 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 16 [2021-12-19 13:14:32,683 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 13:14:32,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:14:32,921 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2663 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_2663) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2021-12-19 13:14:32,923 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:14:32,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [446721552] [2021-12-19 13:14:32,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [446721552] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:14:32,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1082203521] [2021-12-19 13:14:32,923 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-19 13:14:32,923 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 13:14:32,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 13:14:32,924 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 13:14:32,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2021-12-19 13:15:59,279 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2021-12-19 13:15:59,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 13:15:59,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-19 13:15:59,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:15:59,540 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-12-19 13:15:59,702 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:15:59,702 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-12-19 13:15:59,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-19 13:15:59,763 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 13 [2021-12-19 13:16:01,654 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:16:01,654 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-19 13:16:01,688 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 16 [2021-12-19 13:16:01,694 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 13:16:01,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:16:01,898 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3142 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3142) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2021-12-19 13:16:01,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1082203521] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:16:01,900 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:16:01,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2021-12-19 13:16:01,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889025215] [2021-12-19 13:16:01,900 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:16:01,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-19 13:16:01,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:16:01,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-19 13:16:01,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=191, Unknown=15, NotChecked=58, Total=306 [2021-12-19 13:16:01,901 INFO L87 Difference]: Start difference. First operand 1798 states and 2459 transitions. Second operand has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 13:16:06,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:16:06,274 INFO L93 Difference]: Finished difference Result 2915 states and 3931 transitions. [2021-12-19 13:16:06,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-19 13:16:06,274 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 132 [2021-12-19 13:16:06,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:16:06,278 INFO L225 Difference]: With dead ends: 2915 [2021-12-19 13:16:06,278 INFO L226 Difference]: Without dead ends: 2915 [2021-12-19 13:16:06,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 165 SyntacticMatches, 90 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=69, Invalid=338, Unknown=21, NotChecked=78, Total=506 [2021-12-19 13:16:06,279 INFO L933 BasicCegarLoop]: 806 mSDtfsCounter, 1422 mSDsluCounter, 6022 mSDsCounter, 0 mSdLazyCounter, 4030 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1427 SdHoareTripleChecker+Valid, 6828 SdHoareTripleChecker+Invalid, 8407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 4030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4355 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-12-19 13:16:06,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1427 Valid, 6828 Invalid, 8407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 4030 Invalid, 0 Unknown, 4355 Unchecked, 4.2s Time] [2021-12-19 13:16:06,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2021-12-19 13:16:06,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 1797. [2021-12-19 13:16:06,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1797 states, 1347 states have (on average 1.7802524127691166) internal successors, (2398), 1760 states have internal predecessors, (2398), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2021-12-19 13:16:06,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2457 transitions. [2021-12-19 13:16:06,301 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2457 transitions. Word has length 132 [2021-12-19 13:16:06,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:16:06,302 INFO L470 AbstractCegarLoop]: Abstraction has 1797 states and 2457 transitions. [2021-12-19 13:16:06,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 13:16:06,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2457 transitions. [2021-12-19 13:16:06,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-12-19 13:16:06,303 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:16:06,303 INFO L514 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:16:06,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2021-12-19 13:16:06,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2021-12-19 13:16:06,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:16:06,715 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:16:06,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:16:06,715 INFO L85 PathProgramCache]: Analyzing trace with hash 897981944, now seen corresponding path program 1 times [2021-12-19 13:16:06,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:16:06,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [386509306] [2021-12-19 13:16:06,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:16:06,716 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:16:06,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:16:06,717 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:16:06,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-12-19 13:16:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:16:07,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 120 conjunts are in the unsatisfiable core [2021-12-19 13:16:07,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:16:07,576 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-12-19 13:16:07,844 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-12-19 13:16:07,878 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:16:07,879 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-12-19 13:16:07,905 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 13 treesize of output 9 [2021-12-19 13:16:07,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-19 13:16:08,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2021-12-19 13:16:08,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-19 13:16:09,402 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:16:09,402 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-19 13:16:09,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-19 13:16:09,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-19 13:16:09,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-19 13:16:09,470 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 13:16:09,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:16:10,163 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3713 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3712 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3713) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3712) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_3713 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3713) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse1 (_ bv16 32)) (bvadd .cse1 (_ bv20 32)))))) is different from false [2021-12-19 13:16:10,168 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:16:10,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [386509306] [2021-12-19 13:16:10,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [386509306] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:16:10,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [639752949] [2021-12-19 13:16:10,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:16:10,168 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 13:16:10,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 13:16:10,169 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 13:16:10,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2021-12-19 13:18:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:18:54,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 118 conjunts are in the unsatisfiable core [2021-12-19 13:18:54,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:18:54,784 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-12-19 13:18:54,938 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-12-19 13:18:54,959 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:18:54,960 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-12-19 13:18:54,996 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 13 treesize of output 9 [2021-12-19 13:18:55,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-19 13:18:55,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-19 13:18:55,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-12-19 13:18:56,439 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:18:56,439 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-19 13:18:56,443 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 22 treesize of output 24 [2021-12-19 13:18:56,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-19 13:18:56,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-19 13:18:56,512 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 13:18:56,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:18:57,080 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_4283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4283) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse1 (_ bv16 32)) (bvadd .cse1 (_ bv20 32)))))) is different from false [2021-12-19 13:18:57,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [639752949] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:18:57,084 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:18:57,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 19 [2021-12-19 13:18:57,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481444057] [2021-12-19 13:18:57,084 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:18:57,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-19 13:18:57,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:18:57,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-19 13:18:57,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=391, Unknown=18, NotChecked=82, Total=552 [2021-12-19 13:18:57,088 INFO L87 Difference]: Start difference. First operand 1797 states and 2457 transitions. Second operand has 20 states, 17 states have (on average 8.647058823529411) internal successors, (147), 16 states have internal predecessors, (147), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-19 13:19:04,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:19:04,380 INFO L93 Difference]: Finished difference Result 2916 states and 3931 transitions. [2021-12-19 13:19:04,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-19 13:19:04,381 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.647058823529411) internal successors, (147), 16 states have internal predecessors, (147), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 132 [2021-12-19 13:19:04,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:19:04,384 INFO L225 Difference]: With dead ends: 2916 [2021-12-19 13:19:04,385 INFO L226 Difference]: Without dead ends: 2916 [2021-12-19 13:19:04,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 160 SyntacticMatches, 89 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=120, Invalid=731, Unknown=27, NotChecked=114, Total=992 [2021-12-19 13:19:04,386 INFO L933 BasicCegarLoop]: 805 mSDtfsCounter, 2570 mSDsluCounter, 5809 mSDsCounter, 0 mSdLazyCounter, 7194 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2575 SdHoareTripleChecker+Valid, 6614 SdHoareTripleChecker+Invalid, 10072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 7194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2840 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2021-12-19 13:19:04,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2575 Valid, 6614 Invalid, 10072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 7194 Invalid, 0 Unknown, 2840 Unchecked, 7.0s Time] [2021-12-19 13:19:04,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2021-12-19 13:19:04,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 1796. [2021-12-19 13:19:04,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1796 states, 1347 states have (on average 1.7787676317743133) internal successors, (2396), 1759 states have internal predecessors, (2396), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2021-12-19 13:19:04,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2455 transitions. [2021-12-19 13:19:04,404 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2455 transitions. Word has length 132 [2021-12-19 13:19:04,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:19:04,404 INFO L470 AbstractCegarLoop]: Abstraction has 1796 states and 2455 transitions. [2021-12-19 13:19:04,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.647058823529411) internal successors, (147), 16 states have internal predecessors, (147), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-19 13:19:04,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2455 transitions. [2021-12-19 13:19:04,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-19 13:19:04,405 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:19:04,405 INFO L514 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:19:04,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2021-12-19 13:19:04,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2021-12-19 13:19:04,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:19:04,819 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:19:04,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:19:04,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1570895146, now seen corresponding path program 1 times [2021-12-19 13:19:04,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:19:04,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1843280189] [2021-12-19 13:19:04,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:19:04,820 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:19:04,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:19:04,821 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:19:04,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-12-19 13:19:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:19:05,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-19 13:19:05,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:19:05,804 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-12-19 13:19:05,955 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:19:05,955 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-12-19 13:19:05,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-19 13:19:06,056 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 13 [2021-12-19 13:19:07,917 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:19:07,917 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-19 13:19:07,998 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:19:07,998 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-19 13:19:08,016 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 16 [2021-12-19 13:19:08,044 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 13:19:08,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:19:08,096 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_4724) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2021-12-19 13:19:08,104 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4724) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-19 13:19:08,306 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4770))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4724)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:19:08,308 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:19:08,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1843280189] [2021-12-19 13:19:08,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1843280189] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:19:08,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1695762161] [2021-12-19 13:19:08,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:19:08,308 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 13:19:08,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 13:19:08,312 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 13:19:08,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2021-12-19 13:19:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:19:11,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-19 13:19:11,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:19:11,607 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-12-19 13:19:11,770 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:19:11,771 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-12-19 13:19:11,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-19 13:19:11,830 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 13 [2021-12-19 13:19:13,591 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_48 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_48)) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| v_arrayElimCell_48)))) (exists ((v_ArrVal_5209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5209)))) is different from true [2021-12-19 13:19:13,678 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:19:13,678 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-19 13:19:13,729 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:19:13,730 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-19 13:19:13,758 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 16 [2021-12-19 13:19:13,763 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2021-12-19 13:19:13,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:19:13,819 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5210 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5210) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-19 13:19:14,023 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5256 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5210 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5256))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5210)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:19:14,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1695762161] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:19:14,025 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:19:14,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2021-12-19 13:19:14,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730889960] [2021-12-19 13:19:14,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:19:14,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-19 13:19:14,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:19:14,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-19 13:19:14,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=250, Unknown=22, NotChecked=222, Total=552 [2021-12-19 13:19:14,026 INFO L87 Difference]: Start difference. First operand 1796 states and 2455 transitions. Second operand has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-19 13:19:14,436 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4723 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_4723))) (exists ((v_arrayElimCell_48 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_48)) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| v_arrayElimCell_48)))) (exists ((v_ArrVal_5209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5209)))) is different from true [2021-12-19 13:19:19,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:19:19,469 INFO L93 Difference]: Finished difference Result 2913 states and 3927 transitions. [2021-12-19 13:19:19,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-19 13:19:19,470 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 135 [2021-12-19 13:19:19,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:19:19,473 INFO L225 Difference]: With dead ends: 2913 [2021-12-19 13:19:19,473 INFO L226 Difference]: Without dead ends: 2913 [2021-12-19 13:19:19,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 172 SyntacticMatches, 90 SemanticMatches, 28 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=87, Invalid=418, Unknown=29, NotChecked=336, Total=870 [2021-12-19 13:19:19,474 INFO L933 BasicCegarLoop]: 805 mSDtfsCounter, 1420 mSDsluCounter, 7216 mSDsCounter, 0 mSdLazyCounter, 4678 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1425 SdHoareTripleChecker+Valid, 8021 SdHoareTripleChecker+Invalid, 9091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 4678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4389 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2021-12-19 13:19:19,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1425 Valid, 8021 Invalid, 9091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 4678 Invalid, 0 Unknown, 4389 Unchecked, 5.2s Time] [2021-12-19 13:19:19,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2021-12-19 13:19:19,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 1795. [2021-12-19 13:19:19,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1347 states have (on average 1.77728285077951) internal successors, (2394), 1758 states have internal predecessors, (2394), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2021-12-19 13:19:19,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2453 transitions. [2021-12-19 13:19:19,493 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2453 transitions. Word has length 135 [2021-12-19 13:19:19,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:19:19,493 INFO L470 AbstractCegarLoop]: Abstraction has 1795 states and 2453 transitions. [2021-12-19 13:19:19,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-19 13:19:19,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2453 transitions. [2021-12-19 13:19:19,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-19 13:19:19,494 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:19:19,494 INFO L514 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:19:19,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2021-12-19 13:19:19,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2021-12-19 13:19:19,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-19 13:19:19,912 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:19:19,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:19:19,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1570895145, now seen corresponding path program 1 times [2021-12-19 13:19:19,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:19:19,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1653083433] [2021-12-19 13:19:19,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:19:19,913 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:19:19,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:19:19,914 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:19:19,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-12-19 13:19:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:19:20,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 123 conjunts are in the unsatisfiable core [2021-12-19 13:19:20,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:19:20,984 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-12-19 13:19:21,249 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-12-19 13:19:21,284 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:19:21,284 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-12-19 13:19:21,310 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 13 treesize of output 9 [2021-12-19 13:19:21,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-19 13:19:21,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2021-12-19 13:19:21,413 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-19 13:19:22,820 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:19:22,821 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-19 13:19:22,830 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 22 treesize of output 24 [2021-12-19 13:19:22,915 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:19:22,915 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-19 13:19:22,919 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 22 treesize of output 24 [2021-12-19 13:19:22,939 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 13 [2021-12-19 13:19:22,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-19 13:19:22,964 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 13:19:22,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:19:23,120 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5743 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5743) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-19 13:19:23,148 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5743 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_5743) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 13:19:23,740 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5743 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5834)) (.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5835) .cse0 v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5743) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5835) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32)))))) is different from false [2021-12-19 13:19:23,746 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:19:23,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1653083433] [2021-12-19 13:19:23,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1653083433] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:19:23,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2092799025] [2021-12-19 13:19:23,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:19:23,746 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 13:19:23,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 13:19:23,748 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 13:19:23,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2021-12-19 13:19:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:19:28,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 121 conjunts are in the unsatisfiable core [2021-12-19 13:19:28,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:19:28,143 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-12-19 13:19:28,311 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-12-19 13:19:28,330 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:19:28,330 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-12-19 13:19:28,365 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 13 treesize of output 9 [2021-12-19 13:19:28,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-19 13:19:28,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-19 13:19:28,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-12-19 13:19:29,692 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6319))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6320)))) is different from true [2021-12-19 13:19:29,727 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:19:29,727 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-19 13:19:29,730 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 22 treesize of output 24 [2021-12-19 13:19:29,839 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:19:29,839 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-19 13:19:29,842 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 22 treesize of output 24 [2021-12-19 13:19:29,861 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 19 treesize of output 7 [2021-12-19 13:19:29,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-19 13:19:29,866 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2021-12-19 13:19:29,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:19:29,908 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6321) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6322 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6321) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-19 13:19:29,926 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6321) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6322 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_6321) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_6322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 13:19:30,456 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6322 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6413)) (.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6414) .cse0 v_ArrVal_6321) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6414) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_6321) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32)))))) is different from false [2021-12-19 13:19:30,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2092799025] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:19:30,460 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:19:30,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2021-12-19 13:19:30,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344370371] [2021-12-19 13:19:30,460 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:19:30,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-19 13:19:30,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:19:30,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-19 13:19:30,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=473, Unknown=26, NotChecked=350, Total=930 [2021-12-19 13:19:30,461 INFO L87 Difference]: Start difference. First operand 1795 states and 2453 transitions. Second operand has 23 states, 20 states have (on average 7.85) internal successors, (157), 19 states have internal predecessors, (157), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-19 13:19:31,024 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5741 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5741))) (exists ((v_ArrVal_5740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5740))) (exists ((v_ArrVal_6319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6319))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6320)))) is different from true [2021-12-19 13:19:39,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:19:39,310 INFO L93 Difference]: Finished difference Result 2914 states and 3927 transitions. [2021-12-19 13:19:39,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-19 13:19:39,311 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.85) internal successors, (157), 19 states have internal predecessors, (157), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 135 [2021-12-19 13:19:39,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:19:39,314 INFO L225 Difference]: With dead ends: 2914 [2021-12-19 13:19:39,314 INFO L226 Difference]: Without dead ends: 2914 [2021-12-19 13:19:39,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 166 SyntacticMatches, 89 SemanticMatches, 39 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=152, Invalid=900, Unknown=36, NotChecked=552, Total=1640 [2021-12-19 13:19:39,315 INFO L933 BasicCegarLoop]: 804 mSDtfsCounter, 1979 mSDsluCounter, 7170 mSDsCounter, 0 mSdLazyCounter, 8916 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1984 SdHoareTripleChecker+Valid, 7974 SdHoareTripleChecker+Invalid, 13456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 8916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4502 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2021-12-19 13:19:39,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1984 Valid, 7974 Invalid, 13456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 8916 Invalid, 0 Unknown, 4502 Unchecked, 8.5s Time] [2021-12-19 13:19:39,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2021-12-19 13:19:39,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 1794. [2021-12-19 13:19:39,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1794 states, 1347 states have (on average 1.7757980697847067) internal successors, (2392), 1757 states have internal predecessors, (2392), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2021-12-19 13:19:39,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 2451 transitions. [2021-12-19 13:19:39,338 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 2451 transitions. Word has length 135 [2021-12-19 13:19:39,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:19:39,339 INFO L470 AbstractCegarLoop]: Abstraction has 1794 states and 2451 transitions. [2021-12-19 13:19:39,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.85) internal successors, (157), 19 states have internal predecessors, (157), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-19 13:19:39,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 2451 transitions. [2021-12-19 13:19:39,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-12-19 13:19:39,340 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:19:39,340 INFO L514 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:19:39,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2021-12-19 13:19:39,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2021-12-19 13:19:39,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:19:39,759 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:19:39,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:19:39,759 INFO L85 PathProgramCache]: Analyzing trace with hash -573302594, now seen corresponding path program 1 times [2021-12-19 13:19:39,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:19:39,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325374744] [2021-12-19 13:19:39,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:19:39,760 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:19:39,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:19:39,761 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:19:39,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2021-12-19 13:19:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:19:40,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-19 13:19:40,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:19:40,884 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-12-19 13:19:41,037 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:19:41,037 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-12-19 13:19:41,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-19 13:19:41,130 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 13 [2021-12-19 13:19:42,847 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:19:42,848 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-19 13:19:42,939 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:19:42,939 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-19 13:19:43,007 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:19:43,007 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-19 13:19:43,024 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 16 [2021-12-19 13:19:43,053 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 13:19:43,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:19:43,103 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_6870) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2021-12-19 13:19:43,111 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-19 13:19:43,123 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6869))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6870)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:19:43,132 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6869))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6870)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:19:43,328 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6916))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6869)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6870)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:19:43,330 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:19:43,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325374744] [2021-12-19 13:19:43,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325374744] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:19:43,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [303507879] [2021-12-19 13:19:43,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:19:43,330 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 13:19:43,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 13:19:43,331 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 13:19:43,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2021-12-19 13:19:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:19:47,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 70 conjunts are in the unsatisfiable core [2021-12-19 13:19:47,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:19:47,688 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-12-19 13:19:47,820 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:19:47,820 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-12-19 13:19:47,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-19 13:19:47,875 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 13 [2021-12-19 13:19:49,539 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:19:49,539 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-19 13:19:49,603 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:19:49,603 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-19 13:19:49,640 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:19:49,641 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-19 13:19:49,660 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 16 [2021-12-19 13:19:49,666 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 13:19:49,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:19:49,679 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7372 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7372) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2021-12-19 13:19:49,686 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7372 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7372) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-19 13:19:49,697 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7371 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7372 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7371))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7372)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:19:49,705 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7371 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7372 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7371))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7372)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:19:49,896 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7371 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7372 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7418 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_7418))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7371)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7372)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:19:49,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [303507879] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:19:49,898 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:19:49,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2021-12-19 13:19:49,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983197043] [2021-12-19 13:19:49,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:19:49,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-19 13:19:49,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:19:49,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-19 13:19:49,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=253, Unknown=25, NotChecked=410, Total=756 [2021-12-19 13:19:49,899 INFO L87 Difference]: Start difference. First operand 1794 states and 2451 transitions. Second operand has 16 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 13:19:55,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:19:55,205 INFO L93 Difference]: Finished difference Result 2911 states and 3923 transitions. [2021-12-19 13:19:55,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-19 13:19:55,206 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 138 [2021-12-19 13:19:55,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:19:55,208 INFO L225 Difference]: With dead ends: 2911 [2021-12-19 13:19:55,208 INFO L226 Difference]: Without dead ends: 2911 [2021-12-19 13:19:55,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 179 SyntacticMatches, 90 SemanticMatches, 31 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=95, Invalid=420, Unknown=31, NotChecked=510, Total=1056 [2021-12-19 13:19:55,209 INFO L933 BasicCegarLoop]: 802 mSDtfsCounter, 1416 mSDsluCounter, 7529 mSDsCounter, 0 mSdLazyCounter, 4821 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1421 SdHoareTripleChecker+Valid, 8331 SdHoareTripleChecker+Invalid, 9165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 4821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4320 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2021-12-19 13:19:55,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1421 Valid, 8331 Invalid, 9165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 4821 Invalid, 0 Unknown, 4320 Unchecked, 5.1s Time] [2021-12-19 13:19:55,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2021-12-19 13:19:55,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 1793. [2021-12-19 13:19:55,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1793 states, 1347 states have (on average 1.7743132887899036) internal successors, (2390), 1756 states have internal predecessors, (2390), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2021-12-19 13:19:55,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2449 transitions. [2021-12-19 13:19:55,223 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2449 transitions. Word has length 138 [2021-12-19 13:19:55,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:19:55,224 INFO L470 AbstractCegarLoop]: Abstraction has 1793 states and 2449 transitions. [2021-12-19 13:19:55,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 13:19:55,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2449 transitions. [2021-12-19 13:19:55,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-12-19 13:19:55,225 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:19:55,225 INFO L514 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:19:55,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2021-12-19 13:19:55,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2021-12-19 13:19:55,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 13:19:55,640 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:19:55,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:19:55,640 INFO L85 PathProgramCache]: Analyzing trace with hash -573302593, now seen corresponding path program 1 times [2021-12-19 13:19:55,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:19:55,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [701843967] [2021-12-19 13:19:55,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:19:55,641 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:19:55,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:19:55,643 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:19:55,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2021-12-19 13:19:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:19:56,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 126 conjunts are in the unsatisfiable core [2021-12-19 13:19:56,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:19:56,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-19 13:19:57,100 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-12-19 13:19:57,156 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:19:57,157 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-12-19 13:19:57,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-19 13:19:57,194 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 13 treesize of output 9 [2021-12-19 13:19:57,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2021-12-19 13:19:57,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-19 13:19:58,518 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_94 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_94) (_ bv44 32))) (exists ((v_ArrVal_7918 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_7918))) (exists ((v_ArrVal_7917 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_7917)))) is different from true [2021-12-19 13:19:58,556 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:19:58,557 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-19 13:19:58,561 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 22 treesize of output 24 [2021-12-19 13:19:58,642 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:19:58,643 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-19 13:19:58,646 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 22 treesize of output 24 [2021-12-19 13:19:58,722 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:19:58,722 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-19 13:19:58,725 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 22 treesize of output 24 [2021-12-19 13:19:58,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-19 13:19:58,749 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 13 [2021-12-19 13:19:58,771 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2021-12-19 13:19:58,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:19:58,914 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7921 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-19 13:19:58,935 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7921 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_7921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 13:19:58,969 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7921 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7919 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7919)) (.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7920) .cse0 v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7919 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7920) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32)))))) is different from false [2021-12-19 13:19:59,003 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7919 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7920) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7922)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7921 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7919 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_7919))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_7920) .cse4 v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_7921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))) is different from false [2021-12-19 13:19:59,601 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7919 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8013))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8014) .cse1 v_ArrVal_7920) (select (select (store .cse2 .cse1 v_ArrVal_7919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7922))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7921 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7919 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8013)) (.cse6 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_7919))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8014) .cse4 v_ArrVal_7920) .cse5 v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_7921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))))) is different from false [2021-12-19 13:19:59,609 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:19:59,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [701843967] [2021-12-19 13:19:59,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [701843967] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:19:59,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1551515023] [2021-12-19 13:19:59,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:19:59,609 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 13:19:59,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 13:19:59,610 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 13:19:59,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2021-12-19 13:22:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:22:52,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 124 conjunts are in the unsatisfiable core [2021-12-19 13:22:52,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:22:52,438 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-12-19 13:22:52,589 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-12-19 13:22:52,611 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:22:52,612 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-12-19 13:22:52,646 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-19 13:22:52,653 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 13 treesize of output 9 [2021-12-19 13:22:52,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-19 13:22:52,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-12-19 13:22:54,020 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:22:54,020 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-19 13:22:54,023 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 22 treesize of output 24 [2021-12-19 13:22:54,131 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:22:54,131 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-19 13:22:54,134 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 22 treesize of output 24 [2021-12-19 13:22:54,221 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:22:54,222 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-19 13:22:54,225 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 22 treesize of output 24 [2021-12-19 13:22:54,244 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 19 treesize of output 7 [2021-12-19 13:22:54,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-19 13:22:54,249 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 13:22:54,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:22:54,290 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8517 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32)))))) is different from false [2021-12-19 13:22:54,312 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8517 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))) is different from false [2021-12-19 13:22:54,344 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8516)) (.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8515) .cse0 v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8515) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32)))))) is different from false [2021-12-19 13:22:54,372 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8516))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8515) .cse1 v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse6 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_8515) (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_8516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_8518)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))) is different from false [2021-12-19 13:22:54,919 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8609 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8515 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8610 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8609))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8610) .cse1 v_ArrVal_8515) (select (select (store .cse2 .cse1 v_ArrVal_8516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8518))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8609 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8515 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8610 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8609)) (.cse6 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_8516))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8610) .cse4 v_ArrVal_8515) .cse5 v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_8517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))))) is different from false [2021-12-19 13:22:54,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1551515023] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:22:54,926 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:22:54,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2021-12-19 13:22:54,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866423014] [2021-12-19 13:22:54,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:22:54,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-19 13:22:54,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:22:54,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-19 13:22:54,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=563, Unknown=32, NotChecked=638, Total=1332 [2021-12-19 13:22:54,927 INFO L87 Difference]: Start difference. First operand 1793 states and 2449 transitions. Second operand has 25 states, 22 states have (on average 7.409090909090909) internal successors, (163), 21 states have internal predecessors, (163), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-19 13:22:55,500 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_94 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_94) (_ bv44 32))) (exists ((v_ArrVal_7918 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_7918))) (exists ((v_ArrVal_7917 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_7917))) (exists ((v_ArrVal_8513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_8513))) (exists ((v_ArrVal_8514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_8514)))) is different from true [2021-12-19 13:23:03,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:23:03,338 INFO L93 Difference]: Finished difference Result 2912 states and 3923 transitions. [2021-12-19 13:23:03,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-19 13:23:03,351 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.409090909090909) internal successors, (163), 21 states have internal predecessors, (163), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 138 [2021-12-19 13:23:03,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:23:03,354 INFO L225 Difference]: With dead ends: 2912 [2021-12-19 13:23:03,354 INFO L226 Difference]: Without dead ends: 2912 [2021-12-19 13:23:03,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 172 SyntacticMatches, 89 SemanticMatches, 47 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=187, Invalid=1148, Unknown=45, NotChecked=972, Total=2352 [2021-12-19 13:23:03,355 INFO L933 BasicCegarLoop]: 802 mSDtfsCounter, 2559 mSDsluCounter, 5140 mSDsCounter, 0 mSdLazyCounter, 8470 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2564 SdHoareTripleChecker+Valid, 5942 SdHoareTripleChecker+Invalid, 11120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 8470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2608 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2021-12-19 13:23:03,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2564 Valid, 5942 Invalid, 11120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 8470 Invalid, 0 Unknown, 2608 Unchecked, 8.0s Time] [2021-12-19 13:23:03,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2021-12-19 13:23:03,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 1792. [2021-12-19 13:23:03,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1347 states have (on average 1.7728285077951003) internal successors, (2388), 1755 states have internal predecessors, (2388), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2021-12-19 13:23:03,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2447 transitions. [2021-12-19 13:23:03,369 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2447 transitions. Word has length 138 [2021-12-19 13:23:03,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:23:03,369 INFO L470 AbstractCegarLoop]: Abstraction has 1792 states and 2447 transitions. [2021-12-19 13:23:03,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.409090909090909) internal successors, (163), 21 states have internal predecessors, (163), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-19 13:23:03,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2447 transitions. [2021-12-19 13:23:03,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-19 13:23:03,370 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:23:03,370 INFO L514 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:23:03,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2021-12-19 13:23:03,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2021-12-19 13:23:03,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-19 13:23:03,785 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:23:03,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:23:03,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1827699965, now seen corresponding path program 1 times [2021-12-19 13:23:03,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:23:03,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775203169] [2021-12-19 13:23:03,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:23:03,787 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:23:03,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:23:03,788 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:23:03,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2021-12-19 13:23:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:23:04,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 70 conjunts are in the unsatisfiable core [2021-12-19 13:23:04,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:23:04,952 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-12-19 13:23:05,093 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:23:05,093 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-12-19 13:23:05,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-19 13:23:05,186 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 13 [2021-12-19 13:23:06,876 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:23:06,877 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-19 13:23:06,964 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:23:06,964 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-19 13:23:07,026 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:23:07,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-19 13:23:07,096 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:23:07,097 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-19 13:23:07,116 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 16 [2021-12-19 13:23:07,155 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 13:23:07,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:23:07,254 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_9082) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-19 13:23:07,265 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9081))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:23:07,272 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9081))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:23:07,284 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9080))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9081)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:23:07,292 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9080))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9081)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:23:07,473 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9128 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9128))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9080)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9081)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:23:07,475 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:23:07,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775203169] [2021-12-19 13:23:07,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775203169] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:23:07,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [407368263] [2021-12-19 13:23:07,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:23:07,475 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 13:23:07,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 13:23:07,476 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 13:23:07,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2021-12-19 13:23:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:23:14,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 72 conjunts are in the unsatisfiable core [2021-12-19 13:23:14,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:23:14,378 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-12-19 13:23:14,511 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 13:23:14,511 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-12-19 13:23:14,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-19 13:23:14,561 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 13 [2021-12-19 13:23:16,163 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:23:16,163 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-19 13:23:16,224 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:23:16,225 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-19 13:23:16,257 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:23:16,257 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-19 13:23:16,293 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:23:16,294 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-19 13:23:16,310 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 16 [2021-12-19 13:23:16,315 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 13:23:16,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:23:16,376 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9599 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9599))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:23:16,385 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9599 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9599))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:23:16,397 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9598))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9599)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:23:16,405 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9598))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9599)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:23:16,596 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9646 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9646))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9598)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9599)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 13:23:16,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [407368263] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:23:16,598 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:23:16,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2021-12-19 13:23:16,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799860042] [2021-12-19 13:23:16,599 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:23:16,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-19 13:23:16,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:23:16,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-19 13:23:16,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=316, Unknown=30, NotChecked=506, Total=930 [2021-12-19 13:23:16,600 INFO L87 Difference]: Start difference. First operand 1792 states and 2447 transitions. Second operand has 17 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 13:23:21,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 13:23:21,781 INFO L93 Difference]: Finished difference Result 2909 states and 3919 transitions. [2021-12-19 13:23:21,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-19 13:23:21,781 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 141 [2021-12-19 13:23:21,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 13:23:21,783 INFO L225 Difference]: With dead ends: 2909 [2021-12-19 13:23:21,783 INFO L226 Difference]: Without dead ends: 2909 [2021-12-19 13:23:21,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 187 SyntacticMatches, 91 SemanticMatches, 34 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=105, Invalid=503, Unknown=36, NotChecked=616, Total=1260 [2021-12-19 13:23:21,784 INFO L933 BasicCegarLoop]: 803 mSDtfsCounter, 1410 mSDsluCounter, 7580 mSDsCounter, 0 mSdLazyCounter, 4903 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1415 SdHoareTripleChecker+Valid, 8383 SdHoareTripleChecker+Invalid, 8316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 4903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3386 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2021-12-19 13:23:21,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1415 Valid, 8383 Invalid, 8316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 4903 Invalid, 0 Unknown, 3386 Unchecked, 5.0s Time] [2021-12-19 13:23:21,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2021-12-19 13:23:21,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 1791. [2021-12-19 13:23:21,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1791 states, 1347 states have (on average 1.771343726800297) internal successors, (2386), 1754 states have internal predecessors, (2386), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2021-12-19 13:23:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2445 transitions. [2021-12-19 13:23:21,800 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2445 transitions. Word has length 141 [2021-12-19 13:23:21,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 13:23:21,800 INFO L470 AbstractCegarLoop]: Abstraction has 1791 states and 2445 transitions. [2021-12-19 13:23:21,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 13:23:21,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2445 transitions. [2021-12-19 13:23:21,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-19 13:23:21,801 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 13:23:21,801 INFO L514 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 13:23:21,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2021-12-19 13:23:22,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (40)] Forceful destruction successful, exit code 0 [2021-12-19 13:23:22,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-19 13:23:22,214 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 13:23:22,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 13:23:22,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1827699966, now seen corresponding path program 1 times [2021-12-19 13:23:22,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 13:23:22,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1224120673] [2021-12-19 13:23:22,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:23:22,216 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 13:23:22,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 13:23:22,217 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 13:23:22,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2021-12-19 13:23:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:23:23,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 129 conjunts are in the unsatisfiable core [2021-12-19 13:23:23,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:23:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-19 13:23:23,996 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-12-19 13:23:24,032 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:23:24,032 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-12-19 13:23:24,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-19 13:23:24,067 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 13 treesize of output 9 [2021-12-19 13:23:24,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2021-12-19 13:23:24,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-19 13:23:25,469 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:23:25,469 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-19 13:23:25,472 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 22 treesize of output 24 [2021-12-19 13:23:25,558 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:23:25,558 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-19 13:23:25,562 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 22 treesize of output 24 [2021-12-19 13:23:25,634 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:23:25,634 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-19 13:23:25,638 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 22 treesize of output 24 [2021-12-19 13:23:25,714 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:23:25,715 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-19 13:23:25,718 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 22 treesize of output 24 [2021-12-19 13:23:25,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-19 13:23:25,747 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 13 [2021-12-19 13:23:25,773 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 13:23:25,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:23:25,935 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-19 13:23:25,957 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_10166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 13:23:25,998 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10164) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10165)) (.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10164) .cse2 v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 13:23:26,105 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10165))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10164) .cse1 v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse6 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_10164) (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_10165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_10167)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))) is different from false [2021-12-19 13:23:26,179 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10162))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10163) .cse1 v_ArrVal_10164) (select (select (store .cse2 .cse1 v_ArrVal_10165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10167))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10162)) (.cse6 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_10165))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10163) .cse4 v_ArrVal_10164) .cse5 v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_10166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))))) is different from false [2021-12-19 13:23:26,952 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10162))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10165))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10163) .cse1 v_ArrVal_10164) .cse2 v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (let ((.cse10 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse10))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_10162))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse10))) (store (store (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_10163) .cse8 v_ArrVal_10164) (select (select (store .cse9 .cse8 v_ArrVal_10165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse10) v_ArrVal_10167)))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse10)))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))) is different from false [2021-12-19 13:23:29,226 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10259 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10259)) (.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_10162))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10165))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10258) .cse0 v_ArrVal_10163) .cse1 v_ArrVal_10164) .cse2 v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10259 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (let ((.cse11 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10259))) (let ((.cse8 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse11))) (let ((.cse10 (store .cse12 .cse8 v_ArrVal_10162))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse11))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10258) .cse8 v_ArrVal_10163) .cse9 v_ArrVal_10164) (select (select (store .cse10 .cse9 v_ArrVal_10165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse11) v_ArrVal_10167))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse11)))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32)))))) is different from false [2021-12-19 13:23:29,237 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 13:23:29,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1224120673] [2021-12-19 13:23:29,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1224120673] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:23:29,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1196312616] [2021-12-19 13:23:29,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 13:23:29,238 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 13:23:29,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 13:23:29,239 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 13:23:29,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process [2021-12-19 13:26:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 13:26:38,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 128 conjunts are in the unsatisfiable core [2021-12-19 13:26:38,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 13:26:38,160 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-12-19 13:26:38,831 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-12-19 13:26:38,918 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 13:26:38,919 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-12-19 13:26:39,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-19 13:26:39,081 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 13 treesize of output 9 [2021-12-19 13:26:39,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-19 13:26:39,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-12-19 13:26:44,489 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:26:44,489 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-19 13:26:44,498 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 22 treesize of output 24 [2021-12-19 13:26:44,915 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:26:44,916 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-19 13:26:44,925 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 22 treesize of output 24 [2021-12-19 13:26:45,222 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:26:45,222 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-19 13:26:45,231 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 22 treesize of output 24 [2021-12-19 13:26:45,522 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 13:26:45,523 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-19 13:26:45,533 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 22 treesize of output 24 [2021-12-19 13:26:45,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-19 13:26:45,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-19 13:26:45,614 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 13:26:45,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 13:26:45,711 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10779) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10779) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32)))))) is different from false [2021-12-19 13:26:45,754 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10779) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10779) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))) is different from false [2021-12-19 13:26:45,830 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10778) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10777) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10779) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10777)) (.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10778) .cse2 v_ArrVal_10779) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 13:26:45,959 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10778) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10777) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10779)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_10777))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_10778) .cse4 v_ArrVal_10779) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_10780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))) is different from false [2021-12-19 13:26:46,062 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10775 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10776)) (.cse2 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_10777))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10775) .cse0 v_ArrVal_10778) .cse1 v_ArrVal_10779) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_10777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10775 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (let ((.cse8 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10776))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10775) .cse6 v_ArrVal_10778) (select (select (store .cse7 .cse6 v_ArrVal_10777) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8) v_ArrVal_10779))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8)))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32)))))) is different from false [2021-12-19 13:26:47,315 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10775 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10776))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10775) .cse2 v_ArrVal_10778) (select (select (store .cse3 .cse2 v_ArrVal_10777) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10779)))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10775 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_10776))) (let ((.cse6 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (let ((.cse9 (store .cse10 .cse6 v_ArrVal_10777))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_10775) .cse6 v_ArrVal_10778) .cse7 v_ArrVal_10779) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse7 v_ArrVal_10780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))))))))))) is different from false [2021-12-19 13:26:51,038 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10872 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10871 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10775 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10872))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_10776))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10871) .cse1 v_ArrVal_10775) .cse2 v_ArrVal_10778) (select (select (store .cse3 .cse2 v_ArrVal_10777) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10779))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10872 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10871 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10775 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10872)) (.cse9 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse6 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))) (let ((.cse11 (store .cse12 .cse6 v_ArrVal_10776))) (let ((.cse7 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))) (let ((.cse10 (store .cse11 .cse7 v_ArrVal_10777))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10871) .cse6 v_ArrVal_10775) .cse7 v_ArrVal_10778) .cse8 v_ArrVal_10779) |c_ULTIMATE.start_main_~user~0#1.base|) .cse9) (_ bv24 32)) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_10780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))))))))))) is different from false [2021-12-19 13:26:51,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1196312616] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 13:26:51,055 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 13:26:51,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2021-12-19 13:26:51,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283470149] [2021-12-19 13:26:51,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 13:26:51,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-19 13:26:51,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 13:26:51,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-19 13:26:51,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=660, Unknown=37, NotChecked=910, Total=1722 [2021-12-19 13:26:51,057 INFO L87 Difference]: Start difference. First operand 1791 states and 2445 transitions. Second operand has 26 states, 23 states have (on average 7.173913043478261) internal successors, (165), 22 states have internal predecessors, (165), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Killed by 15