./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-2.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_SFH_test6-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1d2a98d270a821b4275b6b35f502458543f3a892fcdda158c69925a18d34f6cf --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-19 14:12:44,055 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-19 14:12:44,057 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-19 14:12:44,082 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-19 14:12:44,083 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-19 14:12:44,084 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-19 14:12:44,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-19 14:12:44,087 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-19 14:12:44,089 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-19 14:12:44,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-19 14:12:44,090 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-19 14:12:44,091 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-19 14:12:44,091 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-19 14:12:44,092 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-19 14:12:44,094 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-19 14:12:44,095 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-19 14:12:44,095 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-19 14:12:44,096 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-19 14:12:44,098 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-19 14:12:44,099 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-19 14:12:44,100 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-19 14:12:44,101 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-19 14:12:44,102 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-19 14:12:44,103 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-19 14:12:44,105 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-19 14:12:44,105 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-19 14:12:44,106 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-19 14:12:44,107 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-19 14:12:44,107 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-19 14:12:44,108 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-19 14:12:44,108 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-19 14:12:44,109 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-19 14:12:44,109 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-19 14:12:44,110 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-19 14:12:44,111 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-19 14:12:44,111 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-19 14:12:44,112 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-19 14:12:44,112 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-19 14:12:44,112 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-19 14:12:44,113 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-19 14:12:44,114 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-19 14:12:44,115 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-19 14:12:44,132 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-19 14:12:44,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-19 14:12:44,133 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-19 14:12:44,133 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-19 14:12:44,134 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-19 14:12:44,135 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-19 14:12:44,135 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-19 14:12:44,135 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-19 14:12:44,136 INFO L138 SettingsManager]: * Use SBE=true [2021-12-19 14:12:44,136 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-19 14:12:44,136 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-19 14:12:44,137 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-19 14:12:44,137 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-19 14:12:44,137 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-19 14:12:44,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-19 14:12:44,137 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-19 14:12:44,138 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-19 14:12:44,138 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-19 14:12:44,138 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-19 14:12:44,138 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-19 14:12:44,139 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-19 14:12:44,139 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-19 14:12:44,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-19 14:12:44,139 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-19 14:12:44,140 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-19 14:12:44,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-19 14:12:44,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-19 14:12:44,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-19 14:12:44,141 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-19 14:12:44,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-19 14:12:44,141 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-19 14:12:44,141 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 -> 1d2a98d270a821b4275b6b35f502458543f3a892fcdda158c69925a18d34f6cf [2021-12-19 14:12:44,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-19 14:12:44,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-19 14:12:44,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-19 14:12:44,394 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-19 14:12:44,394 INFO L275 PluginConnector]: CDTParser initialized [2021-12-19 14:12:44,395 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-2.i [2021-12-19 14:12:44,476 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fc0f5812/6e17809dc1324371b14199343af92fe4/FLAGe51133761 [2021-12-19 14:12:45,023 INFO L306 CDTParser]: Found 1 translation units. [2021-12-19 14:12:45,024 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-2.i [2021-12-19 14:12:45,054 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fc0f5812/6e17809dc1324371b14199343af92fe4/FLAGe51133761 [2021-12-19 14:12:45,300 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fc0f5812/6e17809dc1324371b14199343af92fe4 [2021-12-19 14:12:45,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-19 14:12:45,304 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-19 14:12:45,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-19 14:12:45,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-19 14:12:45,311 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-19 14:12:45,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:12:45" (1/1) ... [2021-12-19 14:12:45,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d94da26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:12:45, skipping insertion in model container [2021-12-19 14:12:45,314 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:12:45" (1/1) ... [2021-12-19 14:12:45,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-19 14:12:45,378 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 14:12:45,859 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_SFH_test6-2.i[44118,44131] [2021-12-19 14:12:45,871 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_SFH_test6-2.i[44660,44673] [2021-12-19 14:12:45,967 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_SFH_test6-2.i[56247,56260] [2021-12-19 14:12:45,969 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_SFH_test6-2.i[56368,56381] [2021-12-19 14:12:45,988 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 14:12:45,998 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 14:12:45,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@78848565 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:12:45, skipping insertion in model container [2021-12-19 14:12:45,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-19 14:12:45,999 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-19 14:12:46,001 INFO L158 Benchmark]: Toolchain (without parser) took 696.46ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 56.6MB in the beginning and 74.9MB in the end (delta: -18.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-19 14:12:46,002 INFO L158 Benchmark]: CDTParser took 0.59ms. Allocated memory is still 90.2MB. Free memory was 46.8MB in the beginning and 46.7MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-19 14:12:46,003 INFO L158 Benchmark]: CACSL2BoogieTranslator took 694.27ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 56.3MB in the beginning and 74.9MB in the end (delta: -18.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-19 14:12:46,004 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.59ms. Allocated memory is still 90.2MB. Free memory was 46.8MB in the beginning and 46.7MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 694.27ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 56.3MB in the beginning and 74.9MB in the end (delta: -18.6MB). Peak memory consumption was 10.5MB. 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_SFH_test6-2.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 1d2a98d270a821b4275b6b35f502458543f3a892fcdda158c69925a18d34f6cf --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-19 14:12:47,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-19 14:12:47,887 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-19 14:12:47,918 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-19 14:12:47,918 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-19 14:12:47,920 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-19 14:12:47,921 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-19 14:12:47,923 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-19 14:12:47,924 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-19 14:12:47,925 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-19 14:12:47,926 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-19 14:12:47,927 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-19 14:12:47,928 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-19 14:12:47,929 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-19 14:12:47,930 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-19 14:12:47,931 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-19 14:12:47,932 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-19 14:12:47,933 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-19 14:12:47,934 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-19 14:12:47,936 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-19 14:12:47,937 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-19 14:12:47,938 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-19 14:12:47,939 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-19 14:12:47,941 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-19 14:12:47,943 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-19 14:12:47,943 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-19 14:12:47,944 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-19 14:12:47,945 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-19 14:12:47,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-19 14:12:47,946 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-19 14:12:47,946 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-19 14:12:47,947 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-19 14:12:47,947 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-19 14:12:47,948 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-19 14:12:47,949 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-19 14:12:47,949 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-19 14:12:47,950 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-19 14:12:47,950 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-19 14:12:47,950 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-19 14:12:47,951 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-19 14:12:47,952 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-19 14:12:47,952 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-19 14:12:47,986 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-19 14:12:47,988 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-19 14:12:47,989 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-19 14:12:47,989 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-19 14:12:47,990 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-19 14:12:47,990 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-19 14:12:47,992 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-19 14:12:47,992 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-19 14:12:47,992 INFO L138 SettingsManager]: * Use SBE=true [2021-12-19 14:12:47,992 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-19 14:12:47,993 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-19 14:12:47,993 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-19 14:12:47,993 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-19 14:12:47,994 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-19 14:12:47,994 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-19 14:12:47,994 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-19 14:12:47,994 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-19 14:12:47,994 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-19 14:12:47,994 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-19 14:12:47,995 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-19 14:12:47,995 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-19 14:12:47,995 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-19 14:12:47,995 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-19 14:12:47,995 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-19 14:12:48,003 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-19 14:12:48,003 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-19 14:12:48,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-19 14:12:48,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-19 14:12:48,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-19 14:12:48,004 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-19 14:12:48,004 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-19 14:12:48,004 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-19 14:12:48,004 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-19 14:12:48,004 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-19 14:12:48,005 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 -> 1d2a98d270a821b4275b6b35f502458543f3a892fcdda158c69925a18d34f6cf [2021-12-19 14:12:48,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-19 14:12:48,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-19 14:12:48,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-19 14:12:48,382 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-19 14:12:48,383 INFO L275 PluginConnector]: CDTParser initialized [2021-12-19 14:12:48,385 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-2.i [2021-12-19 14:12:48,451 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2f71766f/ea8db320fb554d359170715b755e4232/FLAG085293bb8 [2021-12-19 14:12:49,057 INFO L306 CDTParser]: Found 1 translation units. [2021-12-19 14:12:49,058 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-2.i [2021-12-19 14:12:49,075 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2f71766f/ea8db320fb554d359170715b755e4232/FLAG085293bb8 [2021-12-19 14:12:49,325 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2f71766f/ea8db320fb554d359170715b755e4232 [2021-12-19 14:12:49,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-19 14:12:49,328 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-19 14:12:49,336 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-19 14:12:49,336 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-19 14:12:49,339 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-19 14:12:49,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:12:49" (1/1) ... [2021-12-19 14:12:49,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20896d75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:12:49, skipping insertion in model container [2021-12-19 14:12:49,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:12:49" (1/1) ... [2021-12-19 14:12:49,345 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-19 14:12:49,390 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 14:12:49,885 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_SFH_test6-2.i[44118,44131] [2021-12-19 14:12:49,898 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_SFH_test6-2.i[44660,44673] [2021-12-19 14:12:50,033 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_SFH_test6-2.i[56247,56260] [2021-12-19 14:12:50,040 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_SFH_test6-2.i[56368,56381] [2021-12-19 14:12:50,074 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 14:12:50,086 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-19 14:12:50,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 14:12:50,132 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_SFH_test6-2.i[44118,44131] [2021-12-19 14:12:50,134 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_SFH_test6-2.i[44660,44673] [2021-12-19 14:12:50,197 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_SFH_test6-2.i[56247,56260] [2021-12-19 14:12:50,205 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_SFH_test6-2.i[56368,56381] [2021-12-19 14:12:50,221 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 14:12:50,233 INFO L203 MainTranslator]: Completed pre-run [2021-12-19 14:12:50,262 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_SFH_test6-2.i[44118,44131] [2021-12-19 14:12:50,270 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_SFH_test6-2.i[44660,44673] [2021-12-19 14:12:50,323 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_SFH_test6-2.i[56247,56260] [2021-12-19 14:12:50,325 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_SFH_test6-2.i[56368,56381] [2021-12-19 14:12:50,334 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 14:12:50,400 INFO L208 MainTranslator]: Completed translation [2021-12-19 14:12:50,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:12:50 WrapperNode [2021-12-19 14:12:50,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-19 14:12:50,403 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-19 14:12:50,403 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-19 14:12:50,403 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-19 14:12:50,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:12:50" (1/1) ... [2021-12-19 14:12:50,470 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:12:50" (1/1) ... [2021-12-19 14:12:50,564 INFO L137 Inliner]: procedures = 285, calls = 347, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1204 [2021-12-19 14:12:50,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-19 14:12:50,566 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-19 14:12:50,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-19 14:12:50,566 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-19 14:12:50,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:12:50" (1/1) ... [2021-12-19 14:12:50,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:12:50" (1/1) ... [2021-12-19 14:12:50,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:12:50" (1/1) ... [2021-12-19 14:12:50,584 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:12:50" (1/1) ... [2021-12-19 14:12:50,626 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:12:50" (1/1) ... [2021-12-19 14:12:50,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:12:50" (1/1) ... [2021-12-19 14:12:50,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:12:50" (1/1) ... [2021-12-19 14:12:50,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-19 14:12:50,666 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-19 14:12:50,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-19 14:12:50,667 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-19 14:12:50,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:12:50" (1/1) ... [2021-12-19 14:12:50,676 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-19 14:12:50,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 14:12:50,701 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 14:12:50,712 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 14:12:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-12-19 14:12:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-19 14:12:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-19 14:12:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-12-19 14:12:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-19 14:12:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-19 14:12:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-19 14:12:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-19 14:12:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2021-12-19 14:12:50,753 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2021-12-19 14:12:50,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-19 14:12:50,754 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-19 14:12:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-19 14:12:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-19 14:12:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2021-12-19 14:12:50,754 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2021-12-19 14:12:50,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-19 14:12:50,755 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2021-12-19 14:12:50,756 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2021-12-19 14:12:50,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-19 14:12:50,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-19 14:12:51,057 INFO L236 CfgBuilder]: Building ICFG [2021-12-19 14:12:51,059 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-19 14:12:55,513 INFO L277 CfgBuilder]: Performing block encoding [2021-12-19 14:12:55,526 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-19 14:12:55,526 INFO L301 CfgBuilder]: Removed 72 assume(true) statements. [2021-12-19 14:12:55,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:12:55 BoogieIcfgContainer [2021-12-19 14:12:55,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-19 14:12:55,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-19 14:12:55,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-19 14:12:55,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-19 14:12:55,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 02:12:49" (1/3) ... [2021-12-19 14:12:55,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3172db2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:12:55, skipping insertion in model container [2021-12-19 14:12:55,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:12:50" (2/3) ... [2021-12-19 14:12:55,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3172db2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:12:55, skipping insertion in model container [2021-12-19 14:12:55,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:12:55" (3/3) ... [2021-12-19 14:12:55,537 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test6-2.i [2021-12-19 14:12:55,541 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-19 14:12:55,542 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 634 error locations. [2021-12-19 14:12:55,579 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-19 14:12:55,585 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 14:12:55,585 INFO L340 AbstractCegarLoop]: Starting to check reachability of 634 error locations. [2021-12-19 14:12:55,614 INFO L276 IsEmpty]: Start isEmpty. Operand has 1280 states, 626 states have (on average 2.2444089456869007) internal successors, (1405), 1260 states have internal predecessors, (1405), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2021-12-19 14:12:55,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-19 14:12:55,619 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:12:55,620 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-19 14:12:55,620 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:12:55,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:12:55,625 INFO L85 PathProgramCache]: Analyzing trace with hash 77521, now seen corresponding path program 1 times [2021-12-19 14:12:55,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:12:55,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [16571893] [2021-12-19 14:12:55,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:12:55,636 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:12:55,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:12:55,639 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 14:12:55,679 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 14:12:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:12:55,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-19 14:12:55,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:12:55,921 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 14:12:55,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:12:55,932 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:12:55,933 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:12:55,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [16571893] [2021-12-19 14:12:55,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [16571893] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:12:55,933 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:12:55,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-19 14:12:55,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383245429] [2021-12-19 14:12:55,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:12:55,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-19 14:12:55,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:12:55,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 14:12:55,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 14:12:55,973 INFO L87 Difference]: Start difference. First operand has 1280 states, 626 states have (on average 2.2444089456869007) internal successors, (1405), 1260 states have internal predecessors, (1405), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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 14:12:58,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:12:58,282 INFO L93 Difference]: Finished difference Result 1537 states and 1627 transitions. [2021-12-19 14:12:58,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 14:12:58,284 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 14:12:58,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:12:58,302 INFO L225 Difference]: With dead ends: 1537 [2021-12-19 14:12:58,303 INFO L226 Difference]: Without dead ends: 1535 [2021-12-19 14:12:58,304 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 14:12:58,308 INFO L933 BasicCegarLoop]: 911 mSDtfsCounter, 906 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-19 14:12:58,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [909 Valid, 1258 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-12-19 14:12:58,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2021-12-19 14:12:58,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1300. [2021-12-19 14:12:58,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 660 states have (on average 2.106060606060606) internal successors, (1390), 1281 states have internal predecessors, (1390), 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 14:12:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1420 transitions. [2021-12-19 14:12:58,419 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1420 transitions. Word has length 3 [2021-12-19 14:12:58,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:12:58,420 INFO L470 AbstractCegarLoop]: Abstraction has 1300 states and 1420 transitions. [2021-12-19 14:12:58,420 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 14:12:58,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1420 transitions. [2021-12-19 14:12:58,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-19 14:12:58,421 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:12:58,421 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-19 14:12:58,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-19 14:12:58,630 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 14:12:58,631 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:12:58,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:12:58,632 INFO L85 PathProgramCache]: Analyzing trace with hash 77522, now seen corresponding path program 1 times [2021-12-19 14:12:58,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:12:58,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352567962] [2021-12-19 14:12:58,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:12:58,633 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:12:58,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:12:58,634 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 14:12:58,637 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 14:12:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:12:58,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 14:12:58,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:12:58,782 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 14:12:58,798 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 14:12:58,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:12:58,799 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:12:58,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352567962] [2021-12-19 14:12:58,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352567962] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:12:58,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:12:58,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-19 14:12:58,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950411705] [2021-12-19 14:12:58,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:12:58,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-19 14:12:58,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:12:58,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 14:12:58,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 14:12:58,802 INFO L87 Difference]: Start difference. First operand 1300 states and 1420 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 14:13:01,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:01,942 INFO L93 Difference]: Finished difference Result 1891 states and 2058 transitions. [2021-12-19 14:13:01,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 14:13:01,943 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 14:13:01,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:01,950 INFO L225 Difference]: With dead ends: 1891 [2021-12-19 14:13:01,950 INFO L226 Difference]: Without dead ends: 1891 [2021-12-19 14:13:01,951 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 14:13:01,952 INFO L933 BasicCegarLoop]: 1055 mSDtfsCounter, 624 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2021-12-19 14:13:01,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [631 Valid, 1758 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2021-12-19 14:13:01,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2021-12-19 14:13:01,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1504. [2021-12-19 14:13:01,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 863 states have (on average 2.0880648899188876) internal successors, (1802), 1483 states have internal predecessors, (1802), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2021-12-19 14:13:01,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1836 transitions. [2021-12-19 14:13:01,987 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1836 transitions. Word has length 3 [2021-12-19 14:13:01,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:01,988 INFO L470 AbstractCegarLoop]: Abstraction has 1504 states and 1836 transitions. [2021-12-19 14:13:01,988 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 14:13:01,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1836 transitions. [2021-12-19 14:13:01,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-19 14:13:01,989 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:01,989 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 14:13:02,003 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 14:13:02,199 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 14:13:02,200 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:13:02,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:02,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1111693489, now seen corresponding path program 1 times [2021-12-19 14:13:02,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:02,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631994280] [2021-12-19 14:13:02,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:13:02,202 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:02,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:02,203 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 14:13:02,208 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 14:13:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:13:02,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 14:13:02,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:02,376 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 14:13:02,383 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 14:13:02,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 14:13:02,440 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 14:13:02,452 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 14:13:02,452 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 14:13:02,481 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 14:13:02,481 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:13:02,482 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:02,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631994280] [2021-12-19 14:13:02,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631994280] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:13:02,482 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:13:02,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 14:13:02,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134308552] [2021-12-19 14:13:02,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:13:02,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 14:13:02,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:02,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 14:13:02,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 14:13:02,484 INFO L87 Difference]: Start difference. First operand 1504 states and 1836 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 14:13:06,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:06,666 INFO L93 Difference]: Finished difference Result 2569 states and 2979 transitions. [2021-12-19 14:13:06,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 14:13:06,667 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 14:13:06,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:06,677 INFO L225 Difference]: With dead ends: 2569 [2021-12-19 14:13:06,677 INFO L226 Difference]: Without dead ends: 2569 [2021-12-19 14:13:06,677 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 14:13:06,679 INFO L933 BasicCegarLoop]: 718 mSDtfsCounter, 2002 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2008 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2021-12-19 14:13:06,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2008 Valid, 1477 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2021-12-19 14:13:06,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2569 states. [2021-12-19 14:13:06,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 1649. [2021-12-19 14:13:06,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1008 states have (on average 2.068452380952381) internal successors, (2085), 1628 states have internal predecessors, (2085), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2021-12-19 14:13:06,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2119 transitions. [2021-12-19 14:13:06,731 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2119 transitions. Word has length 8 [2021-12-19 14:13:06,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:06,731 INFO L470 AbstractCegarLoop]: Abstraction has 1649 states and 2119 transitions. [2021-12-19 14:13:06,732 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 14:13:06,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2119 transitions. [2021-12-19 14:13:06,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-19 14:13:06,732 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:06,732 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 14:13:06,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-19 14:13:06,942 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 14:13:06,943 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:13:06,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:06,944 INFO L85 PathProgramCache]: Analyzing trace with hash -102759776, now seen corresponding path program 1 times [2021-12-19 14:13:06,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:06,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168782969] [2021-12-19 14:13:06,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:13:06,945 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:06,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:06,946 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 14:13:06,947 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 14:13:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:13:07,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 14:13:07,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:07,094 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 14:13:07,117 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 14:13:07,117 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:13:07,118 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:07,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168782969] [2021-12-19 14:13:07,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168782969] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:13:07,118 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:13:07,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 14:13:07,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934919962] [2021-12-19 14:13:07,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:13:07,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 14:13:07,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:07,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 14:13:07,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 14:13:07,120 INFO L87 Difference]: Start difference. First operand 1649 states and 2119 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 14:13:10,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:10,240 INFO L93 Difference]: Finished difference Result 2811 states and 3512 transitions. [2021-12-19 14:13:10,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-19 14:13:10,242 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 14:13:10,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:10,251 INFO L225 Difference]: With dead ends: 2811 [2021-12-19 14:13:10,252 INFO L226 Difference]: Without dead ends: 2811 [2021-12-19 14:13:10,252 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 14:13:10,253 INFO L933 BasicCegarLoop]: 1321 mSDtfsCounter, 2333 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 1784 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2339 SdHoareTripleChecker+Valid, 2579 SdHoareTripleChecker+Invalid, 1841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2021-12-19 14:13:10,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2339 Valid, 2579 Invalid, 1841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1784 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2021-12-19 14:13:10,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2811 states. [2021-12-19 14:13:10,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2811 to 1604. [2021-12-19 14:13:10,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1008 states have (on average 2.009920634920635) internal successors, (2026), 1583 states have internal predecessors, (2026), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2021-12-19 14:13:10,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2060 transitions. [2021-12-19 14:13:10,293 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2060 transitions. Word has length 9 [2021-12-19 14:13:10,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:10,293 INFO L470 AbstractCegarLoop]: Abstraction has 1604 states and 2060 transitions. [2021-12-19 14:13:10,293 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 14:13:10,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2060 transitions. [2021-12-19 14:13:10,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-19 14:13:10,294 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:10,294 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 14:13:10,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-19 14:13:10,504 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 14:13:10,505 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:13:10,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:10,506 INFO L85 PathProgramCache]: Analyzing trace with hash -102759775, now seen corresponding path program 1 times [2021-12-19 14:13:10,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:10,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344814119] [2021-12-19 14:13:10,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:13:10,507 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:10,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:10,509 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 14:13:10,511 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 14:13:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:13:10,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 14:13:10,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:10,669 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 14:13:10,709 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 14:13:10,710 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:13:10,710 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:10,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344814119] [2021-12-19 14:13:10,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344814119] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:13:10,711 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:13:10,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 14:13:10,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484455811] [2021-12-19 14:13:10,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:13:10,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 14:13:10,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:10,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 14:13:10,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 14:13:10,713 INFO L87 Difference]: Start difference. First operand 1604 states and 2060 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 14:13:14,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:14,380 INFO L93 Difference]: Finished difference Result 2440 states and 3105 transitions. [2021-12-19 14:13:14,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 14:13:14,380 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 14:13:14,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:14,389 INFO L225 Difference]: With dead ends: 2440 [2021-12-19 14:13:14,389 INFO L226 Difference]: Without dead ends: 2440 [2021-12-19 14:13:14,389 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 14:13:14,390 INFO L933 BasicCegarLoop]: 1513 mSDtfsCounter, 1581 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1586 SdHoareTripleChecker+Valid, 2720 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-12-19 14:13:14,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1586 Valid, 2720 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1626 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2021-12-19 14:13:14,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2440 states. [2021-12-19 14:13:14,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2440 to 1594. [2021-12-19 14:13:14,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1594 states, 1008 states have (on average 1.9861111111111112) internal successors, (2002), 1573 states have internal predecessors, (2002), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2021-12-19 14:13:14,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 2036 transitions. [2021-12-19 14:13:14,425 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 2036 transitions. Word has length 9 [2021-12-19 14:13:14,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:14,425 INFO L470 AbstractCegarLoop]: Abstraction has 1594 states and 2036 transitions. [2021-12-19 14:13:14,426 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 14:13:14,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2036 transitions. [2021-12-19 14:13:14,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-19 14:13:14,426 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:14,426 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 14:13:14,438 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 14:13:14,636 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 14:13:14,636 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr516ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:13:14,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:14,637 INFO L85 PathProgramCache]: Analyzing trace with hash -856298529, now seen corresponding path program 1 times [2021-12-19 14:13:14,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:14,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165442394] [2021-12-19 14:13:14,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:13:14,637 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:14,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:14,639 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 14:13:14,640 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 14:13:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:13:14,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 14:13:14,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:14,857 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 14:13:14,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:13:14,857 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:14,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165442394] [2021-12-19 14:13:14,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [165442394] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:13:14,858 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:13:14,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 14:13:14,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836382669] [2021-12-19 14:13:14,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:13:14,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 14:13:14,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:14,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 14:13:14,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 14:13:14,859 INFO L87 Difference]: Start difference. First operand 1594 states and 2036 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 14:13:15,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:15,571 INFO L93 Difference]: Finished difference Result 2264 states and 2809 transitions. [2021-12-19 14:13:15,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-19 14:13:15,571 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 14:13:15,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:15,578 INFO L225 Difference]: With dead ends: 2264 [2021-12-19 14:13:15,578 INFO L226 Difference]: Without dead ends: 2264 [2021-12-19 14:13:15,578 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 14:13:15,579 INFO L933 BasicCegarLoop]: 1454 mSDtfsCounter, 748 mSDsluCounter, 2419 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 3873 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-19 14:13:15,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [759 Valid, 3873 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-19 14:13:15,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2021-12-19 14:13:15,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 1852. [2021-12-19 14:13:15,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1852 states, 1263 states have (on average 1.990498812351544) internal successors, (2514), 1828 states have internal predecessors, (2514), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2021-12-19 14:13:15,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 2554 transitions. [2021-12-19 14:13:15,614 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 2554 transitions. Word has length 11 [2021-12-19 14:13:15,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:15,615 INFO L470 AbstractCegarLoop]: Abstraction has 1852 states and 2554 transitions. [2021-12-19 14:13:15,615 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 14:13:15,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2554 transitions. [2021-12-19 14:13:15,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-19 14:13:15,616 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:15,616 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 14:13:15,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-19 14:13:15,825 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 14:13:15,826 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:13:15,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:15,826 INFO L85 PathProgramCache]: Analyzing trace with hash 2126591358, now seen corresponding path program 1 times [2021-12-19 14:13:15,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:15,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948286310] [2021-12-19 14:13:15,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:13:15,827 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:15,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:15,828 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 14:13:15,829 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 14:13:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:13:16,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 14:13:16,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:16,014 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 14:13:16,015 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 14:13:16,015 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 14:13:16,052 INFO L354 Elim1Store]: treesize reduction 166, result has 13.5 percent of original size [2021-12-19 14:13:16,053 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 14:13:16,098 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-12-19 14:13:16,098 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 14:13:16,121 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 14:13:16,121 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:13:16,121 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:16,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948286310] [2021-12-19 14:13:16,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948286310] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:13:16,122 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:13:16,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 14:13:16,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56715270] [2021-12-19 14:13:16,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:13:16,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 14:13:16,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:16,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 14:13:16,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 14:13:16,123 INFO L87 Difference]: Start difference. First operand 1852 states and 2554 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 14:13:17,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:17,360 INFO L93 Difference]: Finished difference Result 2000 states and 2409 transitions. [2021-12-19 14:13:17,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 14:13:17,362 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 14:13:17,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:17,367 INFO L225 Difference]: With dead ends: 2000 [2021-12-19 14:13:17,367 INFO L226 Difference]: Without dead ends: 2000 [2021-12-19 14:13:17,367 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 14:13:17,368 INFO L933 BasicCegarLoop]: 1391 mSDtfsCounter, 501 mSDsluCounter, 2482 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 3873 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-19 14:13:17,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [508 Valid, 3873 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-19 14:13:17,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2021-12-19 14:13:17,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1494. [2021-12-19 14:13:17,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 907 states have (on average 1.9757442116868797) internal successors, (1792), 1472 states have internal predecessors, (1792), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-19 14:13:17,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1828 transitions. [2021-12-19 14:13:17,393 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1828 transitions. Word has length 14 [2021-12-19 14:13:17,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:17,394 INFO L470 AbstractCegarLoop]: Abstraction has 1494 states and 1828 transitions. [2021-12-19 14:13:17,394 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 14:13:17,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1828 transitions. [2021-12-19 14:13:17,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-19 14:13:17,395 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:17,395 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 14:13:17,411 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 14:13:17,611 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 14:13:17,612 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:13:17,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:17,612 INFO L85 PathProgramCache]: Analyzing trace with hash 769788685, now seen corresponding path program 1 times [2021-12-19 14:13:17,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:17,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114148129] [2021-12-19 14:13:17,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:13:17,613 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:17,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:17,614 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 14:13:17,615 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 14:13:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:13:17,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 14:13:17,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:17,799 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 14:13:17,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:13:17,799 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:17,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114148129] [2021-12-19 14:13:17,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1114148129] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:13:17,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:13:17,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 14:13:17,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566938217] [2021-12-19 14:13:17,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:13:17,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-19 14:13:17,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:17,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 14:13:17,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 14:13:17,801 INFO L87 Difference]: Start difference. First operand 1494 states and 1828 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 14:13:17,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:17,821 INFO L93 Difference]: Finished difference Result 1434 states and 1742 transitions. [2021-12-19 14:13:17,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 14:13:17,821 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 14:13:17,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:17,825 INFO L225 Difference]: With dead ends: 1434 [2021-12-19 14:13:17,825 INFO L226 Difference]: Without dead ends: 1434 [2021-12-19 14:13:17,825 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 14:13:17,826 INFO L933 BasicCegarLoop]: 1239 mSDtfsCounter, 1165 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 1308 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 14:13:17,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1179 Valid, 1308 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-19 14:13:17,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2021-12-19 14:13:17,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1434. [2021-12-19 14:13:17,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 871 states have (on average 1.9586681974741675) internal successors, (1706), 1412 states have internal predecessors, (1706), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-19 14:13:17,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1742 transitions. [2021-12-19 14:13:17,860 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1742 transitions. Word has length 19 [2021-12-19 14:13:17,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:17,861 INFO L470 AbstractCegarLoop]: Abstraction has 1434 states and 1742 transitions. [2021-12-19 14:13:17,861 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 14:13:17,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1742 transitions. [2021-12-19 14:13:17,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-19 14:13:17,862 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:17,862 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 14:13:17,875 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 14:13:18,073 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 14:13:18,074 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:13:18,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:18,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1032548102, now seen corresponding path program 1 times [2021-12-19 14:13:18,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:18,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1188995679] [2021-12-19 14:13:18,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:13:18,075 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:18,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:18,076 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 14:13:18,078 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 14:13:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:13:18,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-19 14:13:18,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:18,277 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 14:13:18,277 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:13:18,278 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:18,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1188995679] [2021-12-19 14:13:18,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1188995679] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:13:18,278 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:13:18,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 14:13:18,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257767964] [2021-12-19 14:13:18,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:13:18,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 14:13:18,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:18,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 14:13:18,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 14:13:18,281 INFO L87 Difference]: Start difference. First operand 1434 states and 1742 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 14:13:18,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:18,340 INFO L93 Difference]: Finished difference Result 1406 states and 1686 transitions. [2021-12-19 14:13:18,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 14:13:18,340 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 14:13:18,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:18,345 INFO L225 Difference]: With dead ends: 1406 [2021-12-19 14:13:18,345 INFO L226 Difference]: Without dead ends: 1406 [2021-12-19 14:13:18,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 14:13:18,346 INFO L933 BasicCegarLoop]: 1194 mSDtfsCounter, 1136 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 2450 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 14:13:18,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1150 Valid, 2450 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-19 14:13:18,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2021-12-19 14:13:18,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1404. [2021-12-19 14:13:18,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 855 states have (on average 1.9274853801169591) internal successors, (1648), 1382 states have internal predecessors, (1648), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-19 14:13:18,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 1684 transitions. [2021-12-19 14:13:18,372 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 1684 transitions. Word has length 21 [2021-12-19 14:13:18,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:18,372 INFO L470 AbstractCegarLoop]: Abstraction has 1404 states and 1684 transitions. [2021-12-19 14:13:18,373 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 14:13:18,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1684 transitions. [2021-12-19 14:13:18,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-19 14:13:18,373 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:18,374 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 14:13:18,387 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 14:13:18,584 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 14:13:18,585 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:13:18,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:18,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1673308372, now seen corresponding path program 1 times [2021-12-19 14:13:18,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:18,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197633112] [2021-12-19 14:13:18,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:13:18,586 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:18,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:18,588 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 14:13:18,626 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 14:13:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:13:18,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 14:13:18,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:18,794 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 14:13:18,873 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 14:13:18,873 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:13:18,873 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:18,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197633112] [2021-12-19 14:13:18,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197633112] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:13:18,874 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:13:18,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 14:13:18,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312681345] [2021-12-19 14:13:18,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:13:18,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-19 14:13:18,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:18,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-19 14:13:18,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-19 14:13:18,875 INFO L87 Difference]: Start difference. First operand 1404 states and 1684 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 14:13:21,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:21,930 INFO L93 Difference]: Finished difference Result 2572 states and 3080 transitions. [2021-12-19 14:13:21,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-19 14:13:21,932 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 14:13:21,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:21,938 INFO L225 Difference]: With dead ends: 2572 [2021-12-19 14:13:21,938 INFO L226 Difference]: Without dead ends: 2572 [2021-12-19 14:13:21,938 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 14:13:21,939 INFO L933 BasicCegarLoop]: 1149 mSDtfsCounter, 2421 mSDsluCounter, 1588 mSDsCounter, 0 mSdLazyCounter, 2363 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2424 SdHoareTripleChecker+Valid, 2737 SdHoareTripleChecker+Invalid, 2382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2021-12-19 14:13:21,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2424 Valid, 2737 Invalid, 2382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2363 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2021-12-19 14:13:21,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2021-12-19 14:13:21,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 1400. [2021-12-19 14:13:21,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 855 states have (on average 1.9181286549707601) internal successors, (1640), 1378 states have internal predecessors, (1640), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-19 14:13:21,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1676 transitions. [2021-12-19 14:13:21,962 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1676 transitions. Word has length 35 [2021-12-19 14:13:21,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:21,963 INFO L470 AbstractCegarLoop]: Abstraction has 1400 states and 1676 transitions. [2021-12-19 14:13:21,963 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 14:13:21,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1676 transitions. [2021-12-19 14:13:21,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-19 14:13:21,964 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:21,964 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 14:13:21,975 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 14:13:22,174 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 14:13:22,175 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:13:22,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:22,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1673308373, now seen corresponding path program 1 times [2021-12-19 14:13:22,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:22,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237539128] [2021-12-19 14:13:22,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:13:22,176 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:22,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:22,178 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 14:13:22,180 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 14:13:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:13:22,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 14:13:22,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:22,366 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 14:13:22,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 14:13:22,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:13:22,598 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:22,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1237539128] [2021-12-19 14:13:22,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1237539128] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:13:22,598 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:13:22,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 14:13:22,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212740207] [2021-12-19 14:13:22,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:13:22,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-19 14:13:22,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:22,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-19 14:13:22,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-19 14:13:22,600 INFO L87 Difference]: Start difference. First operand 1400 states and 1676 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 14:13:26,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:26,318 INFO L93 Difference]: Finished difference Result 2214 states and 2659 transitions. [2021-12-19 14:13:26,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-19 14:13:26,319 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 14:13:26,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:26,325 INFO L225 Difference]: With dead ends: 2214 [2021-12-19 14:13:26,325 INFO L226 Difference]: Without dead ends: 2214 [2021-12-19 14:13:26,326 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 14:13:26,326 INFO L933 BasicCegarLoop]: 1548 mSDtfsCounter, 2194 mSDsluCounter, 1769 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2194 SdHoareTripleChecker+Valid, 3317 SdHoareTripleChecker+Invalid, 2164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-12-19 14:13:26,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2194 Valid, 3317 Invalid, 2164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2142 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2021-12-19 14:13:26,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2021-12-19 14:13:26,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 1396. [2021-12-19 14:13:26,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 855 states have (on average 1.9087719298245613) internal successors, (1632), 1374 states have internal predecessors, (1632), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-19 14:13:26,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 1668 transitions. [2021-12-19 14:13:26,350 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 1668 transitions. Word has length 35 [2021-12-19 14:13:26,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:26,350 INFO L470 AbstractCegarLoop]: Abstraction has 1396 states and 1668 transitions. [2021-12-19 14:13:26,350 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 14:13:26,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1668 transitions. [2021-12-19 14:13:26,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-19 14:13:26,352 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:26,352 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 14:13:26,367 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 14:13:26,563 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 14:13:26,563 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting alt_mallocErr0REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:13:26,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:26,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2063645645, now seen corresponding path program 1 times [2021-12-19 14:13:26,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:26,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474663452] [2021-12-19 14:13:26,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:13:26,565 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:26,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:26,566 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 14:13:26,569 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 14:13:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:13:26,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-19 14:13:26,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:26,921 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 14:13:26,921 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:13:26,921 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:26,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1474663452] [2021-12-19 14:13:26,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1474663452] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:13:26,922 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:13:26,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 14:13:26,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708440042] [2021-12-19 14:13:26,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:13:26,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 14:13:26,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:26,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 14:13:26,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 14:13:26,924 INFO L87 Difference]: Start difference. First operand 1396 states and 1668 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 14:13:26,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:26,962 INFO L93 Difference]: Finished difference Result 1384 states and 1648 transitions. [2021-12-19 14:13:26,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 14:13:26,963 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 14:13:26,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:26,967 INFO L225 Difference]: With dead ends: 1384 [2021-12-19 14:13:26,967 INFO L226 Difference]: Without dead ends: 1384 [2021-12-19 14:13:26,967 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 14:13:26,968 INFO L933 BasicCegarLoop]: 1188 mSDtfsCounter, 1112 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 2428 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 14:13:26,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1126 Valid, 2428 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-19 14:13:26,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2021-12-19 14:13:26,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384. [2021-12-19 14:13:26,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 843 states have (on average 1.9122182680901543) internal successors, (1612), 1362 states have internal predecessors, (1612), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-12-19 14:13:26,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1648 transitions. [2021-12-19 14:13:26,988 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1648 transitions. Word has length 54 [2021-12-19 14:13:26,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:26,989 INFO L470 AbstractCegarLoop]: Abstraction has 1384 states and 1648 transitions. [2021-12-19 14:13:26,989 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 14:13:26,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1648 transitions. [2021-12-19 14:13:26,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-19 14:13:26,990 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:26,991 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 14:13:27,003 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 14:13:27,203 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 14:13:27,203 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting alt_mallocErr0REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:13:27,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:27,203 INFO L85 PathProgramCache]: Analyzing trace with hash -202859289, now seen corresponding path program 1 times [2021-12-19 14:13:27,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:27,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136669259] [2021-12-19 14:13:27,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:13:27,204 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:27,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:27,205 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 14:13:27,206 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 14:13:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:13:27,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 14:13:27,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:27,579 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 14:13:27,579 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 14:13:27,619 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-19 14:13:27,619 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 14:13:27,961 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 14:13:27,962 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:13:27,962 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:27,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136669259] [2021-12-19 14:13:27,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136669259] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:13:27,962 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:13:27,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-19 14:13:27,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261200602] [2021-12-19 14:13:27,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:13:27,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 14:13:27,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:27,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 14:13:27,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 14:13:27,965 INFO L87 Difference]: Start difference. First operand 1384 states and 1648 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 14:13:31,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:31,405 INFO L93 Difference]: Finished difference Result 3213 states and 3778 transitions. [2021-12-19 14:13:31,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 14:13:31,406 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 14:13:31,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:31,414 INFO L225 Difference]: With dead ends: 3213 [2021-12-19 14:13:31,415 INFO L226 Difference]: Without dead ends: 3213 [2021-12-19 14:13:31,415 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 14:13:31,415 INFO L933 BasicCegarLoop]: 1287 mSDtfsCounter, 1759 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 2036 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1762 SdHoareTripleChecker+Valid, 2677 SdHoareTripleChecker+Invalid, 2041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-12-19 14:13:31,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1762 Valid, 2677 Invalid, 2041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2036 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2021-12-19 14:13:31,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3213 states. [2021-12-19 14:13:31,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3213 to 1839. [2021-12-19 14:13:31,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1839 states, 1282 states have (on average 1.8985959438377535) internal successors, (2434), 1804 states have internal predecessors, (2434), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2021-12-19 14:13:31,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2496 transitions. [2021-12-19 14:13:31,463 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2496 transitions. Word has length 62 [2021-12-19 14:13:31,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:31,464 INFO L470 AbstractCegarLoop]: Abstraction has 1839 states and 2496 transitions. [2021-12-19 14:13:31,464 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 14:13:31,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2496 transitions. [2021-12-19 14:13:31,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-19 14:13:31,468 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:31,468 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 14:13:31,485 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 14:13:31,682 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 14:13:31,682 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting alt_mallocErr1REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:13:31,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:31,683 INFO L85 PathProgramCache]: Analyzing trace with hash -202859288, now seen corresponding path program 1 times [2021-12-19 14:13:31,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:31,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295000664] [2021-12-19 14:13:31,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:13:31,684 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:31,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:31,685 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 14:13:31,688 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 14:13:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:13:32,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-19 14:13:32,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:32,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 14:13:32,106 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 14:13:32,175 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:13:32,175 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 14:13:32,892 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 14:13:32,892 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:13:32,892 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:32,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295000664] [2021-12-19 14:13:32,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295000664] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:13:32,893 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:13:32,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 14:13:32,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560466410] [2021-12-19 14:13:32,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:13:32,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-19 14:13:32,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:32,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-19 14:13:32,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-19 14:13:32,894 INFO L87 Difference]: Start difference. First operand 1839 states and 2496 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 14:13:36,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:36,915 INFO L93 Difference]: Finished difference Result 1845 states and 2503 transitions. [2021-12-19 14:13:36,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-19 14:13:36,915 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 14:13:36,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:36,921 INFO L225 Difference]: With dead ends: 1845 [2021-12-19 14:13:36,921 INFO L226 Difference]: Without dead ends: 1845 [2021-12-19 14:13:36,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-19 14:13:36,922 INFO L933 BasicCegarLoop]: 1170 mSDtfsCounter, 111 mSDsluCounter, 2223 mSDsCounter, 0 mSdLazyCounter, 2556 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 3393 SdHoareTripleChecker+Invalid, 2560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2021-12-19 14:13:36,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 3393 Invalid, 2560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2556 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2021-12-19 14:13:36,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2021-12-19 14:13:36,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1844. [2021-12-19 14:13:36,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1286 states have (on average 1.895800933125972) internal successors, (2438), 1808 states have internal predecessors, (2438), 32 states have call successors, (32), 9 states have call predecessors, (32), 7 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2021-12-19 14:13:36,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 2502 transitions. [2021-12-19 14:13:36,948 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 2502 transitions. Word has length 62 [2021-12-19 14:13:36,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:36,948 INFO L470 AbstractCegarLoop]: Abstraction has 1844 states and 2502 transitions. [2021-12-19 14:13:36,948 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 14:13:36,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2502 transitions. [2021-12-19 14:13:36,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-19 14:13:36,949 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:36,949 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 14:13:36,965 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 14:13:37,165 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 14:13:37,166 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:13:37,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:37,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1136013504, now seen corresponding path program 1 times [2021-12-19 14:13:37,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:37,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790893191] [2021-12-19 14:13:37,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:13:37,167 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:37,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:37,168 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 14:13:37,174 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 14:13:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:13:37,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 14:13:37,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:37,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:13:37,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:13:37,551 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:37,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790893191] [2021-12-19 14:13:37,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790893191] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:13:37,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:13:37,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-19 14:13:37,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017957251] [2021-12-19 14:13:37,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:13:37,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-19 14:13:37,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:37,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-19 14:13:37,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-19 14:13:37,553 INFO L87 Difference]: Start difference. First operand 1844 states and 2502 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 14:13:37,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:37,669 INFO L93 Difference]: Finished difference Result 1870 states and 2529 transitions. [2021-12-19 14:13:37,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-19 14:13:37,679 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 14:13:37,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:37,683 INFO L225 Difference]: With dead ends: 1870 [2021-12-19 14:13:37,684 INFO L226 Difference]: Without dead ends: 1870 [2021-12-19 14:13:37,684 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 14:13:37,684 INFO L933 BasicCegarLoop]: 1185 mSDtfsCounter, 19 mSDsluCounter, 4733 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 5918 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 14:13:37,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 5918 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-19 14:13:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2021-12-19 14:13:37,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1868. [2021-12-19 14:13:37,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1868 states, 1304 states have (on average 1.8872699386503067) internal successors, (2461), 1828 states have internal predecessors, (2461), 34 states have call successors, (34), 13 states have call predecessors, (34), 11 states have return successors, (34), 30 states have call predecessors, (34), 34 states have call successors, (34) [2021-12-19 14:13:37,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 2529 transitions. [2021-12-19 14:13:37,717 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 2529 transitions. Word has length 68 [2021-12-19 14:13:37,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:37,717 INFO L470 AbstractCegarLoop]: Abstraction has 1868 states and 2529 transitions. [2021-12-19 14:13:37,717 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 14:13:37,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2529 transitions. [2021-12-19 14:13:37,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-19 14:13:37,718 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:37,718 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 14:13:37,738 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 14:13:37,933 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 14:13:37,933 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:13:37,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:37,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1078181117, now seen corresponding path program 1 times [2021-12-19 14:13:37,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:37,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664485140] [2021-12-19 14:13:37,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:13:37,934 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:37,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:37,935 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 14:13:37,937 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 14:13:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:13:38,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-19 14:13:38,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:38,385 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 14:13:38,386 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:13:38,386 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:38,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664485140] [2021-12-19 14:13:38,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664485140] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:13:38,386 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:13:38,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-19 14:13:38,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526184627] [2021-12-19 14:13:38,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:13:38,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-19 14:13:38,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:38,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-19 14:13:38,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-19 14:13:38,387 INFO L87 Difference]: Start difference. First operand 1868 states and 2529 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 14:13:38,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:38,564 INFO L93 Difference]: Finished difference Result 1880 states and 2543 transitions. [2021-12-19 14:13:38,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-19 14:13:38,564 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 14:13:38,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:38,569 INFO L225 Difference]: With dead ends: 1880 [2021-12-19 14:13:38,569 INFO L226 Difference]: Without dead ends: 1880 [2021-12-19 14:13:38,570 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 14:13:38,570 INFO L933 BasicCegarLoop]: 1185 mSDtfsCounter, 23 mSDsluCounter, 3450 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 4635 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-19 14:13:38,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 4635 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-19 14:13:38,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2021-12-19 14:13:38,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1871. [2021-12-19 14:13:38,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1871 states, 1306 states have (on average 1.8859111791730474) internal successors, (2463), 1830 states have internal predecessors, (2463), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2021-12-19 14:13:38,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2532 transitions. [2021-12-19 14:13:38,601 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2532 transitions. Word has length 68 [2021-12-19 14:13:38,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:38,601 INFO L470 AbstractCegarLoop]: Abstraction has 1871 states and 2532 transitions. [2021-12-19 14:13:38,601 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 14:13:38,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2532 transitions. [2021-12-19 14:13:38,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-19 14:13:38,602 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:38,602 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 14:13:38,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-19 14:13:38,816 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 14:13:38,816 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:13:38,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:38,816 INFO L85 PathProgramCache]: Analyzing trace with hash 396897840, now seen corresponding path program 1 times [2021-12-19 14:13:38,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:38,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770392119] [2021-12-19 14:13:38,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:13:38,817 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:38,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:38,818 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 14:13:38,819 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 14:13:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:13:39,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 14:13:39,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:39,223 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 14:13:39,406 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-19 14:13:39,406 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 14:13:39,418 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 14:13:39,418 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:13:39,418 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:39,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770392119] [2021-12-19 14:13:39,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [770392119] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:13:39,418 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:13:39,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-19 14:13:39,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193278367] [2021-12-19 14:13:39,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:13:39,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-19 14:13:39,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:39,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-19 14:13:39,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-19 14:13:39,420 INFO L87 Difference]: Start difference. First operand 1871 states and 2532 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 14:13:43,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:43,457 INFO L93 Difference]: Finished difference Result 3195 states and 4242 transitions. [2021-12-19 14:13:43,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-19 14:13:43,459 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 14:13:43,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:43,466 INFO L225 Difference]: With dead ends: 3195 [2021-12-19 14:13:43,466 INFO L226 Difference]: Without dead ends: 3195 [2021-12-19 14:13:43,466 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 14:13:43,467 INFO L933 BasicCegarLoop]: 1114 mSDtfsCounter, 1622 mSDsluCounter, 2883 mSDsCounter, 0 mSdLazyCounter, 2727 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1628 SdHoareTripleChecker+Valid, 3997 SdHoareTripleChecker+Invalid, 3589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 841 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2021-12-19 14:13:43,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1628 Valid, 3997 Invalid, 3589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2727 Invalid, 0 Unknown, 841 Unchecked, 3.9s Time] [2021-12-19 14:13:43,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3195 states. [2021-12-19 14:13:43,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3195 to 1870. [2021-12-19 14:13:43,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1870 states, 1306 states have (on average 1.8843797856049005) internal successors, (2461), 1829 states have internal predecessors, (2461), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2021-12-19 14:13:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2530 transitions. [2021-12-19 14:13:43,503 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2530 transitions. Word has length 73 [2021-12-19 14:13:43,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:43,504 INFO L470 AbstractCegarLoop]: Abstraction has 1870 states and 2530 transitions. [2021-12-19 14:13:43,504 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 14:13:43,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2530 transitions. [2021-12-19 14:13:43,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-19 14:13:43,505 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:43,505 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 14:13:43,526 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 14:13:43,720 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 14:13:43,720 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:13:43,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:43,721 INFO L85 PathProgramCache]: Analyzing trace with hash 396897841, now seen corresponding path program 1 times [2021-12-19 14:13:43,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:43,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954103064] [2021-12-19 14:13:43,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:13:43,721 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:43,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:43,722 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 14:13:43,723 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 14:13:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:13:44,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-19 14:13:44,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:44,139 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 14:13:44,145 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 14:13:46,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 14:13:46,643 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 14:13:46,665 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 14:13:46,665 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 14:13:46,686 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 14:13:46,686 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:13:46,686 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:46,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954103064] [2021-12-19 14:13:46,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954103064] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:13:46,687 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:13:46,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-19 14:13:46,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854562515] [2021-12-19 14:13:46,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:13:46,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-19 14:13:46,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:46,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-19 14:13:46,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=29, Unknown=1, NotChecked=0, Total=42 [2021-12-19 14:13:46,690 INFO L87 Difference]: Start difference. First operand 1870 states and 2530 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 14:13:52,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:52,953 INFO L93 Difference]: Finished difference Result 3266 states and 4367 transitions. [2021-12-19 14:13:52,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-19 14:13:52,954 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 14:13:52,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:52,960 INFO L225 Difference]: With dead ends: 3266 [2021-12-19 14:13:52,960 INFO L226 Difference]: Without dead ends: 3266 [2021-12-19 14:13:52,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=17, Invalid=38, Unknown=1, NotChecked=0, Total=56 [2021-12-19 14:13:52,961 INFO L933 BasicCegarLoop]: 1320 mSDtfsCounter, 2395 mSDsluCounter, 2520 mSDsCounter, 0 mSdLazyCounter, 3940 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2401 SdHoareTripleChecker+Valid, 3840 SdHoareTripleChecker+Invalid, 5284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1312 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2021-12-19 14:13:52,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2401 Valid, 3840 Invalid, 5284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 3940 Invalid, 0 Unknown, 1312 Unchecked, 6.1s Time] [2021-12-19 14:13:52,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2021-12-19 14:13:53,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 1866. [2021-12-19 14:13:53,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1310 states have (on average 1.869465648854962) internal successors, (2449), 1825 states have internal predecessors, (2449), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2021-12-19 14:13:53,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2518 transitions. [2021-12-19 14:13:53,016 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 2518 transitions. Word has length 73 [2021-12-19 14:13:53,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:53,017 INFO L470 AbstractCegarLoop]: Abstraction has 1866 states and 2518 transitions. [2021-12-19 14:13:53,017 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 14:13:53,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2518 transitions. [2021-12-19 14:13:53,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-19 14:13:53,018 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:53,018 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 14:13:53,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2021-12-19 14:13:53,237 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 14:13:53,238 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:13:53,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:53,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1622258381, now seen corresponding path program 1 times [2021-12-19 14:13:53,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:53,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204466208] [2021-12-19 14:13:53,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:13:53,239 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:53,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:53,241 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 14:13:53,244 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 14:13:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:13:53,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 14:13:53,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:53,624 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 14:13:53,640 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 14:13:53,661 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 14:13:53,691 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 14:13:53,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:13:53,691 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:53,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204466208] [2021-12-19 14:13:53,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204466208] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:13:53,691 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:13:53,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-19 14:13:53,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008227760] [2021-12-19 14:13:53,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:13:53,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-19 14:13:53,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:53,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-19 14:13:53,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-19 14:13:53,693 INFO L87 Difference]: Start difference. First operand 1866 states and 2518 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 14:13:57,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:57,223 INFO L93 Difference]: Finished difference Result 1881 states and 2534 transitions. [2021-12-19 14:13:57,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-19 14:13:57,223 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 14:13:57,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:57,227 INFO L225 Difference]: With dead ends: 1881 [2021-12-19 14:13:57,227 INFO L226 Difference]: Without dead ends: 1881 [2021-12-19 14:13:57,227 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 14:13:57,228 INFO L933 BasicCegarLoop]: 1171 mSDtfsCounter, 23 mSDsluCounter, 3760 mSDsCounter, 0 mSdLazyCounter, 3317 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4931 SdHoareTripleChecker+Invalid, 3319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-12-19 14:13:57,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 4931 Invalid, 3319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3317 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2021-12-19 14:13:57,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2021-12-19 14:13:57,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1880. [2021-12-19 14:13:57,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1322 states have (on average 1.8645990922844176) internal successors, (2465), 1837 states have internal predecessors, (2465), 34 states have call successors, (34), 15 states have call predecessors, (34), 14 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2021-12-19 14:13:57,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2534 transitions. [2021-12-19 14:13:57,255 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2534 transitions. Word has length 80 [2021-12-19 14:13:57,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:57,256 INFO L470 AbstractCegarLoop]: Abstraction has 1880 states and 2534 transitions. [2021-12-19 14:13:57,256 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 14:13:57,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2534 transitions. [2021-12-19 14:13:57,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-12-19 14:13:57,257 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:57,257 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 14:13:57,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2021-12-19 14:13:57,472 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 14:13:57,472 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:13:57,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:57,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1249597809, now seen corresponding path program 1 times [2021-12-19 14:13:57,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:57,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364058174] [2021-12-19 14:13:57,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:13:57,474 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:57,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:57,475 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 14:13:57,502 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 14:13:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:13:57,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-19 14:13:57,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:57,886 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 14:13:57,925 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 14:13:57,936 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 14:13:57,978 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 14:13:57,983 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 14:13:58,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:13:58,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:13:58,051 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:58,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364058174] [2021-12-19 14:13:58,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364058174] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:13:58,052 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:13:58,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-19 14:13:58,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223921484] [2021-12-19 14:13:58,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:13:58,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-19 14:13:58,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:58,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-19 14:13:58,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-19 14:13:58,054 INFO L87 Difference]: Start difference. First operand 1880 states and 2534 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 14:14:03,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:14:03,274 INFO L93 Difference]: Finished difference Result 1880 states and 2532 transitions. [2021-12-19 14:14:03,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-19 14:14:03,275 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 14:14:03,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:14:03,279 INFO L225 Difference]: With dead ends: 1880 [2021-12-19 14:14:03,279 INFO L226 Difference]: Without dead ends: 1880 [2021-12-19 14:14:03,280 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 14:14:03,280 INFO L933 BasicCegarLoop]: 1166 mSDtfsCounter, 19 mSDsluCounter, 4791 mSDsCounter, 0 mSdLazyCounter, 3469 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 5957 SdHoareTripleChecker+Invalid, 3470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2021-12-19 14:14:03,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 5957 Invalid, 3470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3469 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2021-12-19 14:14:03,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2021-12-19 14:14:03,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1880. [2021-12-19 14:14:03,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1322 states have (on average 1.8630862329803328) internal successors, (2463), 1837 states have internal predecessors, (2463), 34 states have call successors, (34), 15 states have call predecessors, (34), 14 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2021-12-19 14:14:03,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2532 transitions. [2021-12-19 14:14:03,319 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2532 transitions. Word has length 81 [2021-12-19 14:14:03,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:14:03,319 INFO L470 AbstractCegarLoop]: Abstraction has 1880 states and 2532 transitions. [2021-12-19 14:14:03,320 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 14:14:03,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2532 transitions. [2021-12-19 14:14:03,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-19 14:14:03,321 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:14:03,321 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 14:14:03,342 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 14:14:03,535 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 14:14:03,535 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:14:03,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:14:03,536 INFO L85 PathProgramCache]: Analyzing trace with hash -63374884, now seen corresponding path program 1 times [2021-12-19 14:14:03,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:14:03,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [921586132] [2021-12-19 14:14:03,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:14:03,536 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:14:03,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:14:03,538 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 14:14:03,542 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 14:14:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:14:03,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 14:14:03,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:14:04,076 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 14:14:04,076 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:14:04,076 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:14:04,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [921586132] [2021-12-19 14:14:04,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [921586132] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:14:04,077 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:14:04,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-19 14:14:04,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797112448] [2021-12-19 14:14:04,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:14:04,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-19 14:14:04,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:14:04,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-19 14:14:04,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-19 14:14:04,078 INFO L87 Difference]: Start difference. First operand 1880 states and 2532 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 14:14:04,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:14:04,132 INFO L93 Difference]: Finished difference Result 1896 states and 2550 transitions. [2021-12-19 14:14:04,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-19 14:14:04,134 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 14:14:04,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:14:04,138 INFO L225 Difference]: With dead ends: 1896 [2021-12-19 14:14:04,138 INFO L226 Difference]: Without dead ends: 1890 [2021-12-19 14:14:04,138 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 14:14:04,139 INFO L933 BasicCegarLoop]: 1174 mSDtfsCounter, 13 mSDsluCounter, 2340 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3514 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-19 14:14:04,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 3514 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-19 14:14:04,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2021-12-19 14:14:04,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1890. [2021-12-19 14:14:04,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1330 states have (on average 1.8593984962406016) internal successors, (2473), 1847 states have internal predecessors, (2473), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 14:14:04,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2544 transitions. [2021-12-19 14:14:04,172 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2544 transitions. Word has length 88 [2021-12-19 14:14:04,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:14:04,173 INFO L470 AbstractCegarLoop]: Abstraction has 1890 states and 2544 transitions. [2021-12-19 14:14:04,173 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 14:14:04,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2544 transitions. [2021-12-19 14:14:04,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-12-19 14:14:04,174 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:14:04,174 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 14:14:04,194 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 14:14:04,388 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 14:14:04,388 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:14:04,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:14:04,389 INFO L85 PathProgramCache]: Analyzing trace with hash -407790698, now seen corresponding path program 1 times [2021-12-19 14:14:04,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:14:04,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [626316466] [2021-12-19 14:14:04,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:14:04,390 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:14:04,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:14:04,391 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 14:14:04,393 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 14:14:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:14:04,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-19 14:14:04,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:14:04,892 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 14:14:04,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:14:05,102 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 14:14:05,103 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:14:05,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [626316466] [2021-12-19 14:14:05,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [626316466] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 14:14:05,103 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 14:14:05,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-19 14:14:05,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516883987] [2021-12-19 14:14:05,103 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 14:14:05,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-19 14:14:05,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:14:05,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-19 14:14:05,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-19 14:14:05,104 INFO L87 Difference]: Start difference. First operand 1890 states and 2544 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 14:14:05,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:14:05,297 INFO L93 Difference]: Finished difference Result 1916 states and 2574 transitions. [2021-12-19 14:14:05,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-19 14:14:05,298 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 14:14:05,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:14:05,302 INFO L225 Difference]: With dead ends: 1916 [2021-12-19 14:14:05,302 INFO L226 Difference]: Without dead ends: 1904 [2021-12-19 14:14:05,303 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 14:14:05,303 INFO L933 BasicCegarLoop]: 1177 mSDtfsCounter, 48 mSDsluCounter, 5851 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 7028 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-19 14:14:05,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 7028 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-19 14:14:05,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2021-12-19 14:14:05,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1898. [2021-12-19 14:14:05,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1338 states have (on average 1.8557548579970105) internal successors, (2483), 1855 states have internal predecessors, (2483), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 14:14:05,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2554 transitions. [2021-12-19 14:14:05,325 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2554 transitions. Word has length 89 [2021-12-19 14:14:05,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:14:05,325 INFO L470 AbstractCegarLoop]: Abstraction has 1898 states and 2554 transitions. [2021-12-19 14:14:05,325 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 14:14:05,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2554 transitions. [2021-12-19 14:14:05,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-19 14:14:05,326 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:14:05,327 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 14:14:05,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2021-12-19 14:14:05,542 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 14:14:05,543 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:14:05,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:14:05,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1714460764, now seen corresponding path program 2 times [2021-12-19 14:14:05,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:14:05,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [805456288] [2021-12-19 14:14:05,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 14:14:05,545 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:14:05,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:14:05,546 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 14:14:05,548 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 14:14:06,081 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 14:14:06,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 14:14:06,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-19 14:14:06,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:14:06,272 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 14:14:06,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:14:06,576 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 14:14:06,577 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:14:06,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [805456288] [2021-12-19 14:14:06,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [805456288] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 14:14:06,577 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 14:14:06,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-12-19 14:14:06,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231529464] [2021-12-19 14:14:06,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 14:14:06,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-19 14:14:06,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:14:06,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-19 14:14:06,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-19 14:14:06,579 INFO L87 Difference]: Start difference. First operand 1898 states and 2554 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 14:14:07,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:14:07,174 INFO L93 Difference]: Finished difference Result 1952 states and 2622 transitions. [2021-12-19 14:14:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-19 14:14:07,175 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 14:14:07,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:14:07,180 INFO L225 Difference]: With dead ends: 1952 [2021-12-19 14:14:07,180 INFO L226 Difference]: Without dead ends: 1940 [2021-12-19 14:14:07,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=343, Invalid=649, Unknown=0, NotChecked=0, Total=992 [2021-12-19 14:14:07,181 INFO L933 BasicCegarLoop]: 1183 mSDtfsCounter, 78 mSDsluCounter, 8233 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 9416 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-19 14:14:07,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 9416 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-19 14:14:07,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2021-12-19 14:14:07,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1916. [2021-12-19 14:14:07,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1916 states, 1356 states have (on average 1.84882005899705) internal successors, (2507), 1873 states have internal predecessors, (2507), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 14:14:07,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 2578 transitions. [2021-12-19 14:14:07,206 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 2578 transitions. Word has length 92 [2021-12-19 14:14:07,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:14:07,206 INFO L470 AbstractCegarLoop]: Abstraction has 1916 states and 2578 transitions. [2021-12-19 14:14:07,206 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 14:14:07,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2578 transitions. [2021-12-19 14:14:07,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-12-19 14:14:07,207 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:14:07,208 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 14:14:07,227 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 14:14:07,428 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 14:14:07,428 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:14:07,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:14:07,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1774326244, now seen corresponding path program 3 times [2021-12-19 14:14:07,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:14:07,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1233416996] [2021-12-19 14:14:07,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-19 14:14:07,430 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:14:07,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:14:07,431 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 14:14:07,433 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 14:14:08,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-19 14:14:08,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 14:14:08,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-19 14:14:08,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:14:08,894 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 14:14:08,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:14:09,727 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 14:14:09,727 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:14:09,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1233416996] [2021-12-19 14:14:09,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1233416996] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 14:14:09,728 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 14:14:09,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2021-12-19 14:14:09,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431272225] [2021-12-19 14:14:09,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 14:14:09,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-19 14:14:09,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:14:09,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-19 14:14:09,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2021-12-19 14:14:09,730 INFO L87 Difference]: Start difference. First operand 1916 states and 2578 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 14:14:12,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:14:12,727 INFO L93 Difference]: Finished difference Result 2024 states and 2726 transitions. [2021-12-19 14:14:12,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-12-19 14:14:12,728 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 14:14:12,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:14:12,732 INFO L225 Difference]: With dead ends: 2024 [2021-12-19 14:14:12,732 INFO L226 Difference]: Without dead ends: 2006 [2021-12-19 14:14:12,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=924, Invalid=1832, Unknown=0, NotChecked=0, Total=2756 [2021-12-19 14:14:12,734 INFO L933 BasicCegarLoop]: 1195 mSDtfsCounter, 215 mSDsluCounter, 15439 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 16634 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-19 14:14:12,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 16634 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-19 14:14:12,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2021-12-19 14:14:12,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 1952. [2021-12-19 14:14:12,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1392 states have (on average 1.834051724137931) internal successors, (2553), 1909 states have internal predecessors, (2553), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 14:14:12,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2624 transitions. [2021-12-19 14:14:12,760 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2624 transitions. Word has length 98 [2021-12-19 14:14:12,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:14:12,760 INFO L470 AbstractCegarLoop]: Abstraction has 1952 states and 2624 transitions. [2021-12-19 14:14:12,760 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 14:14:12,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2624 transitions. [2021-12-19 14:14:12,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-12-19 14:14:12,761 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:14:12,761 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 14:14:12,783 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 14:14:12,981 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 14:14:12,981 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:14:12,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:14:12,981 INFO L85 PathProgramCache]: Analyzing trace with hash -824268388, now seen corresponding path program 4 times [2021-12-19 14:14:12,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:14:12,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510888692] [2021-12-19 14:14:12,982 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-19 14:14:12,982 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:14:12,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:14:12,984 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 14:14:12,986 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 14:14:13,433 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-19 14:14:13,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 14:14:13,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-19 14:14:13,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:14:14,129 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 14:14:14,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:14:15,929 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 14:14:15,930 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:14:15,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510888692] [2021-12-19 14:14:15,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510888692] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 14:14:15,930 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 14:14:15,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2021-12-19 14:14:15,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561918086] [2021-12-19 14:14:15,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 14:14:15,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-12-19 14:14:15,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:14:15,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-12-19 14:14:15,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2021-12-19 14:14:15,933 INFO L87 Difference]: Start difference. First operand 1952 states and 2624 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 14:14:26,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:14:26,349 INFO L93 Difference]: Finished difference Result 2158 states and 2894 transitions. [2021-12-19 14:14:26,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-12-19 14:14:26,350 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 14:14:26,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:14:26,353 INFO L225 Difference]: With dead ends: 2158 [2021-12-19 14:14:26,353 INFO L226 Difference]: Without dead ends: 2146 [2021-12-19 14:14:26,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1902 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=4121, Invalid=9921, Unknown=0, NotChecked=0, Total=14042 [2021-12-19 14:14:26,356 INFO L933 BasicCegarLoop]: 1217 mSDtfsCounter, 497 mSDsluCounter, 33741 mSDsCounter, 0 mSdLazyCounter, 2545 mSolverCounterSat, 465 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 34958 SdHoareTripleChecker+Invalid, 3010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 465 IncrementalHoareTripleChecker+Valid, 2545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-12-19 14:14:26,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [497 Valid, 34958 Invalid, 3010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [465 Valid, 2545 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2021-12-19 14:14:26,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2021-12-19 14:14:26,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 2020. [2021-12-19 14:14:26,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2020 states, 1460 states have (on average 1.8116438356164384) internal successors, (2645), 1977 states have internal predecessors, (2645), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 14:14:26,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 2716 transitions. [2021-12-19 14:14:26,397 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 2716 transitions. Word has length 110 [2021-12-19 14:14:26,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:14:26,397 INFO L470 AbstractCegarLoop]: Abstraction has 2020 states and 2716 transitions. [2021-12-19 14:14:26,398 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 14:14:26,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 2716 transitions. [2021-12-19 14:14:26,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-12-19 14:14:26,399 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:14:26,399 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 14:14:26,416 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 14:14:26,616 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 14:14:26,617 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:14:26,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:14:26,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1958349148, now seen corresponding path program 5 times [2021-12-19 14:14:26,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:14:26,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997857696] [2021-12-19 14:14:26,618 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-19 14:14:26,618 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:14:26,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:14:26,619 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 14:14:26,620 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 14:14:28,144 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2021-12-19 14:14:28,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 14:14:28,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-19 14:14:28,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:14:28,208 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 14:14:28,394 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 14:14:28,394 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 14:14:28,433 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 14:14:28,545 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 14:14:31,271 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:14:31,272 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 14:14:31,354 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 14:14:31,398 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 14:14:31,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:14:31,801 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:14:31,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997857696] [2021-12-19 14:14:31,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997857696] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:14:31,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [593964463] [2021-12-19 14:14:31,802 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-19 14:14:31,802 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 14:14:31,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 14:14:31,807 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 14:14:31,830 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 14:16:04,740 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2021-12-19 14:16:04,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 14:16:05,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-19 14:16:05,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:16:05,059 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 14:16:05,253 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 14:16:05,255 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 14:16:05,269 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 14:16:05,322 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 14:16:07,769 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:16:07,769 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 14:16:07,819 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 14:16:07,827 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 14:16:07,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:16:08,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [593964463] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:16:08,185 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 14:16:08,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2021-12-19 14:16:08,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17403708] [2021-12-19 14:16:08,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 14:16:08,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-19 14:16:08,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:16:08,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-19 14:16:08,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=215, Unknown=16, NotChecked=0, Total=272 [2021-12-19 14:16:08,186 INFO L87 Difference]: Start difference. First operand 2020 states and 2716 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 14:16:13,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:16:13,556 INFO L93 Difference]: Finished difference Result 3339 states and 4420 transitions. [2021-12-19 14:16:13,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-19 14:16:13,557 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 14:16:13,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:16:13,560 INFO L225 Difference]: With dead ends: 3339 [2021-12-19 14:16:13,560 INFO L226 Difference]: Without dead ends: 3339 [2021-12-19 14:16:13,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 165 SyntacticMatches, 91 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=68, Invalid=372, Unknown=22, NotChecked=0, Total=462 [2021-12-19 14:16:13,560 INFO L933 BasicCegarLoop]: 1111 mSDtfsCounter, 1608 mSDsluCounter, 6787 mSDsCounter, 0 mSdLazyCounter, 4574 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1613 SdHoareTripleChecker+Valid, 7898 SdHoareTripleChecker+Invalid, 7963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 4574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3365 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2021-12-19 14:16:13,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1613 Valid, 7898 Invalid, 7963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 4574 Invalid, 0 Unknown, 3365 Unchecked, 5.1s Time] [2021-12-19 14:16:13,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2021-12-19 14:16:13,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 2019. [2021-12-19 14:16:13,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2019 states, 1460 states have (on average 1.8102739726027397) internal successors, (2643), 1976 states have internal predecessors, (2643), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 14:16:13,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 2714 transitions. [2021-12-19 14:16:13,589 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 2714 transitions. Word has length 132 [2021-12-19 14:16:13,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:16:13,589 INFO L470 AbstractCegarLoop]: Abstraction has 2019 states and 2714 transitions. [2021-12-19 14:16:13,589 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 14:16:13,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 2714 transitions. [2021-12-19 14:16:13,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-12-19 14:16:13,591 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:16:13,591 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 14:16:13,636 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 14:16:13,824 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 14:16:14,007 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 14:16:14,008 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:16:14,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:16:14,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1958349149, now seen corresponding path program 1 times [2021-12-19 14:16:14,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:16:14,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656189595] [2021-12-19 14:16:14,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:16:14,009 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:16:14,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:16:14,010 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 14:16:14,011 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 14:16:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:16:14,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 120 conjunts are in the unsatisfiable core [2021-12-19 14:16:14,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:16:14,944 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 14:16:15,244 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 14:16:15,280 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 14:16:15,281 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 14:16:15,308 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 14:16:15,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 14:16:15,412 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 14:16:15,416 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 14:16:16,955 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_32 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_32) (_ bv44 32))) (exists ((v_ArrVal_3620 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_3620))) (exists ((v_ArrVal_3621 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_3621)))) is different from true [2021-12-19 14:16:17,016 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:16:17,016 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 14:16:17,024 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 14:16:17,066 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 14:16:17,071 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 14:16:17,101 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 14:16:17,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:16:18,037 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3712 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3712) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse0 (_ bv16 32)) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3713 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3712 (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~mem73#1.base| v_ArrVal_3712) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3713) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-19 14:16:18,045 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:16:18,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656189595] [2021-12-19 14:16:18,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656189595] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:16:18,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [294646617] [2021-12-19 14:16:18,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:16:18,046 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 14:16:18,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 14:16:18,047 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 14:16:18,048 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 14:19:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:19:05,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 118 conjunts are in the unsatisfiable core [2021-12-19 14:19:05,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:19:05,123 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 14:19:05,297 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 14:19:05,320 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 14:19:05,320 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 14:19:05,359 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 14:19:05,364 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 14:19:05,511 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 14:19:05,516 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 14:19:07,085 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_32 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_32) (_ bv44 32))) (exists ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_4191))) (exists ((v_ArrVal_4192 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_4192)))) is different from true [2021-12-19 14:19:07,137 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:19:07,138 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 14:19:07,143 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 14:19:07,219 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 14:19:07,223 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 14:19:07,229 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 14:19:07,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:19:07,929 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4284) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse0 (_ bv16 32)) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_4283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4284 (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~mem73#1.base| v_ArrVal_4284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-19 14:19:07,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [294646617] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:19:07,934 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 14:19:07,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2021-12-19 14:19:07,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771970491] [2021-12-19 14:19:07,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 14:19:07,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-19 14:19:07,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:19:07,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-19 14:19:07,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=369, Unknown=5, NotChecked=164, Total=600 [2021-12-19 14:19:07,935 INFO L87 Difference]: Start difference. First operand 2019 states and 2714 transitions. Second operand has 21 states, 18 states have (on average 8.38888888888889) internal successors, (151), 17 states have internal predecessors, (151), 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 14:19:08,626 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_32 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_32) (_ bv44 32))) (exists ((v_ArrVal_3620 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_3620))) (exists ((v_ArrVal_4191 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_4191))) (exists ((v_ArrVal_4192 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_4192))) (exists ((v_ArrVal_3621 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_3621)))) is different from true [2021-12-19 14:19:22,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:19:22,155 INFO L93 Difference]: Finished difference Result 3340 states and 4420 transitions. [2021-12-19 14:19:22,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-19 14:19:22,155 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.38888888888889) internal successors, (151), 17 states have internal predecessors, (151), 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 132 [2021-12-19 14:19:22,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:19:22,159 INFO L225 Difference]: With dead ends: 3340 [2021-12-19 14:19:22,159 INFO L226 Difference]: Without dead ends: 3340 [2021-12-19 14:19:22,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 160 SyntacticMatches, 89 SemanticMatches, 31 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=117, Invalid=653, Unknown=6, NotChecked=280, Total=1056 [2021-12-19 14:19:22,160 INFO L933 BasicCegarLoop]: 1114 mSDtfsCounter, 2953 mSDsluCounter, 8781 mSDsCounter, 0 mSdLazyCounter, 12895 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2958 SdHoareTripleChecker+Valid, 9895 SdHoareTripleChecker+Invalid, 18114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 12895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5181 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2021-12-19 14:19:22,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2958 Valid, 9895 Invalid, 18114 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [38 Valid, 12895 Invalid, 0 Unknown, 5181 Unchecked, 13.8s Time] [2021-12-19 14:19:22,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3340 states. [2021-12-19 14:19:22,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3340 to 2018. [2021-12-19 14:19:22,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2018 states, 1460 states have (on average 1.808904109589041) internal successors, (2641), 1975 states have internal predecessors, (2641), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 14:19:22,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2018 states to 2018 states and 2712 transitions. [2021-12-19 14:19:22,202 INFO L78 Accepts]: Start accepts. Automaton has 2018 states and 2712 transitions. Word has length 132 [2021-12-19 14:19:22,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:19:22,203 INFO L470 AbstractCegarLoop]: Abstraction has 2018 states and 2712 transitions. [2021-12-19 14:19:22,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.38888888888889) internal successors, (151), 17 states have internal predecessors, (151), 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 14:19:22,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 2712 transitions. [2021-12-19 14:19:22,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-19 14:19:22,204 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:19:22,204 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 14:19:22,255 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 14:19:22,446 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 14:19:22,618 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 14:19:22,618 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:19:22,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:19:22,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1655953071, now seen corresponding path program 1 times [2021-12-19 14:19:22,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:19:22,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707209369] [2021-12-19 14:19:22,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:19:22,620 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:19:22,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:19:22,621 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 14:19:22,623 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 14:19:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:19:23,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-19 14:19:23,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:19:23,793 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 14:19:23,972 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 14:19:23,972 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 14:19:24,014 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 14:19:24,098 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 14:19:26,160 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:19:26,161 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 14:19:26,243 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:19:26,243 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 14:19:26,269 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 14:19:26,298 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 14:19:26,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:19:26,424 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 14:19:26,638 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 14:19:26,640 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:19:26,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707209369] [2021-12-19 14:19:26,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [707209369] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:19:26,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [577488690] [2021-12-19 14:19:26,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:19:26,641 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 14:19:26,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 14:19:26,642 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 14:19:26,643 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 14:19:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:19:31,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-19 14:19:31,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:19:31,263 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 14:19:31,444 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 14:19:31,444 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 14:19:31,457 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 14:19:31,510 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 14:19:33,599 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:19:33,599 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 14:19:33,656 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:19:33,656 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 14:19:33,675 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 14:19:33,682 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 14:19:33,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:19:33,696 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5210 (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_5210) |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 14:19:33,705 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 14:19:33,928 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 14:19:33,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [577488690] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:19:33,930 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 14:19:33,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2021-12-19 14:19:33,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864672043] [2021-12-19 14:19:33,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 14:19:33,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-19 14:19:33,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:19:33,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-19 14:19:33,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=248, Unknown=22, NotChecked=180, Total=506 [2021-12-19 14:19:33,932 INFO L87 Difference]: Start difference. First operand 2018 states and 2712 transitions. Second operand has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 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 14:19:39,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:19:39,235 INFO L93 Difference]: Finished difference Result 3337 states and 4416 transitions. [2021-12-19 14:19:39,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-19 14:19:39,235 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 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 135 [2021-12-19 14:19:39,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:19:39,239 INFO L225 Difference]: With dead ends: 3337 [2021-12-19 14:19:39,239 INFO L226 Difference]: Without dead ends: 3337 [2021-12-19 14:19:39,239 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 172 SyntacticMatches, 90 SemanticMatches, 26 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=83, Invalid=415, Unknown=28, NotChecked=230, Total=756 [2021-12-19 14:19:39,240 INFO L933 BasicCegarLoop]: 1112 mSDtfsCounter, 1606 mSDsluCounter, 6547 mSDsCounter, 0 mSdLazyCounter, 4282 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1611 SdHoareTripleChecker+Valid, 7659 SdHoareTripleChecker+Invalid, 8834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 4282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4527 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2021-12-19 14:19:39,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1611 Valid, 7659 Invalid, 8834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 4282 Invalid, 0 Unknown, 4527 Unchecked, 5.1s Time] [2021-12-19 14:19:39,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3337 states. [2021-12-19 14:19:39,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3337 to 2017. [2021-12-19 14:19:39,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2017 states, 1460 states have (on average 1.8075342465753426) internal successors, (2639), 1974 states have internal predecessors, (2639), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 14:19:39,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 2710 transitions. [2021-12-19 14:19:39,273 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 2710 transitions. Word has length 135 [2021-12-19 14:19:39,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:19:39,274 INFO L470 AbstractCegarLoop]: Abstraction has 2017 states and 2710 transitions. [2021-12-19 14:19:39,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 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 14:19:39,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2710 transitions. [2021-12-19 14:19:39,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-19 14:19:39,275 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:19:39,275 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 14:19:39,306 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 14:19:39,517 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 14:19:39,700 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 14:19:39,700 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:19:39,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:19:39,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1655953070, now seen corresponding path program 1 times [2021-12-19 14:19:39,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:19:39,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860886875] [2021-12-19 14:19:39,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:19:39,702 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:19:39,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:19:39,703 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 14:19:39,704 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 14:19:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:19:40,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 123 conjunts are in the unsatisfiable core [2021-12-19 14:19:40,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:19:40,793 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 14:19:41,107 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 14:19:41,142 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 14:19:41,142 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 14:19:41,169 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 14:19:41,174 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 14:19:41,270 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 14:19:41,273 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 14:19:42,876 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_5740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5740))) (exists ((v_ArrVal_5741 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5741)))) is different from true [2021-12-19 14:19:42,917 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:19:42,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 46 treesize of output 45 [2021-12-19 14:19:42,921 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 14:19:43,023 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:19:43,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, 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 14:19:43,027 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 14:19:43,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 14:19:43,059 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 14:19:43,092 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 14:19:43,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:19:43,253 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 14:19:43,277 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 14:19:43,952 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_5835)) (.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_5834) .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_5834) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5835) |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 14:19:43,969 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:19:43,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860886875] [2021-12-19 14:19:43,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860886875] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:19:43,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [684857845] [2021-12-19 14:19:43,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:19:43,969 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 14:19:43,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 14:19:43,972 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 14:19:43,975 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 14:19:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:19:48,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 121 conjunts are in the unsatisfiable core [2021-12-19 14:19:48,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:19:49,007 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 14:19:49,177 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 14:19:49,198 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 14:19:49,199 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 14:19:49,235 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 14:19:49,240 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 14:19:49,360 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 14:19:49,363 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 14:19:50,955 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |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$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6320)))) is different from true [2021-12-19 14:19:50,998 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:19:50,999 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 14:19:51,004 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 14:19:51,139 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:19:51,139 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 14:19:51,157 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 14:19:51,189 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 14:19:51,192 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 14:19:51,197 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 14:19:51,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:19:51,248 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 14:19:51,280 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 14:19:52,002 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_6414)) (.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_6413) .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_6413) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6414) |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 14:19:52,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [684857845] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:19:52,013 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 14:19:52,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2021-12-19 14:19:52,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097176359] [2021-12-19 14:19:52,014 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 14:19:52,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-19 14:19:52,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:19:52,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-19 14:19:52,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=449, Unknown=9, NotChecked=392, Total=930 [2021-12-19 14:19:52,015 INFO L87 Difference]: Start difference. First operand 2017 states and 2710 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 14:19:52,819 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |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_5740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5740))) (exists ((v_ArrVal_5741 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5741))) (exists ((v_ArrVal_6320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6320)))) is different from true [2021-12-19 14:20:06,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:20:06,389 INFO L93 Difference]: Finished difference Result 3338 states and 4416 transitions. [2021-12-19 14:20:06,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-19 14:20:06,389 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 14:20:06,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:20:06,392 INFO L225 Difference]: With dead ends: 3338 [2021-12-19 14:20:06,393 INFO L226 Difference]: Without dead ends: 3338 [2021-12-19 14:20:06,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 166 SyntacticMatches, 89 SemanticMatches, 39 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=151, Invalid=866, Unknown=11, NotChecked=612, Total=1640 [2021-12-19 14:20:06,394 INFO L933 BasicCegarLoop]: 1111 mSDtfsCounter, 2166 mSDsluCounter, 8552 mSDsCounter, 0 mSdLazyCounter, 12489 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2171 SdHoareTripleChecker+Valid, 9663 SdHoareTripleChecker+Invalid, 17972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 12489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5443 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2021-12-19 14:20:06,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2171 Valid, 9663 Invalid, 17972 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [40 Valid, 12489 Invalid, 0 Unknown, 5443 Unchecked, 13.9s Time] [2021-12-19 14:20:06,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2021-12-19 14:20:06,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2016. [2021-12-19 14:20:06,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2016 states, 1460 states have (on average 1.8061643835616439) internal successors, (2637), 1973 states have internal predecessors, (2637), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 14:20:06,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 2016 states and 2708 transitions. [2021-12-19 14:20:06,420 INFO L78 Accepts]: Start accepts. Automaton has 2016 states and 2708 transitions. Word has length 135 [2021-12-19 14:20:06,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:20:06,420 INFO L470 AbstractCegarLoop]: Abstraction has 2016 states and 2708 transitions. [2021-12-19 14:20:06,420 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 14:20:06,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 2708 transitions. [2021-12-19 14:20:06,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-12-19 14:20:06,421 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:20:06,421 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 14:20:06,443 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 14:20:06,669 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 14:20:06,843 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 14:20:06,844 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:20:06,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:20:06,844 INFO L85 PathProgramCache]: Analyzing trace with hash -503241629, now seen corresponding path program 1 times [2021-12-19 14:20:06,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:20:06,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [625907615] [2021-12-19 14:20:06,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:20:06,845 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:20:06,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:20:06,848 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 14:20:06,850 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 14:20:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:20:08,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-19 14:20:08,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:20:08,196 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 14:20:08,351 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 14:20:08,352 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 14:20:08,373 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 14:20:08,455 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 14:20:10,479 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:20:10,480 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 14:20:10,584 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:20:10,584 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 14:20:10,656 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:20:10,657 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 14:20:10,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2021-12-19 14:20:10,708 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 14:20:10,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:20:10,807 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 14:20:10,820 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 14:20:10,830 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 14:20:11,065 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 14:20:11,067 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:20:11,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [625907615] [2021-12-19 14:20:11,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [625907615] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:20:11,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [823979536] [2021-12-19 14:20:11,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:20:11,067 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 14:20:11,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 14:20:11,068 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 14:20:11,069 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 14:20:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:20:17,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 70 conjunts are in the unsatisfiable core [2021-12-19 14:20:17,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:20:17,083 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 14:20:17,252 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 14:20:17,253 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 14:20:17,264 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 14:20:17,328 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 14:20:19,292 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:20:19,293 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 14:20:19,363 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:20:19,363 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 14:20:19,403 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:20:19,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-19 14:20:19,421 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 14:20:19,428 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 14:20:19,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:20:19,490 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7371 (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_7371))) (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 14:20:19,499 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7371 (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_7371))) (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 14:20:19,709 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7371 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7418 (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_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_6870)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:20:19,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [823979536] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:20:19,711 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 14:20:19,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2021-12-19 14:20:19,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627654061] [2021-12-19 14:20:19,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 14:20:19,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-19 14:20:19,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:20:19,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-19 14:20:19,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=281, Unknown=24, NotChecked=280, Total=650 [2021-12-19 14:20:19,712 INFO L87 Difference]: Start difference. First operand 2016 states and 2708 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 14:20:26,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:20:26,244 INFO L93 Difference]: Finished difference Result 3335 states and 4412 transitions. [2021-12-19 14:20:26,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-19 14:20:26,244 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 14:20:26,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:20:26,248 INFO L225 Difference]: With dead ends: 3335 [2021-12-19 14:20:26,248 INFO L226 Difference]: Without dead ends: 3335 [2021-12-19 14:20:26,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 180 SyntacticMatches, 91 SemanticMatches, 29 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=92, Invalid=458, Unknown=30, NotChecked=350, Total=930 [2021-12-19 14:20:26,249 INFO L933 BasicCegarLoop]: 1111 mSDtfsCounter, 1604 mSDsluCounter, 9815 mSDsCounter, 0 mSdLazyCounter, 5522 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1609 SdHoareTripleChecker+Valid, 10926 SdHoareTripleChecker+Invalid, 10797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 5522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5248 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2021-12-19 14:20:26,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1609 Valid, 10926 Invalid, 10797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 5522 Invalid, 0 Unknown, 5248 Unchecked, 6.3s Time] [2021-12-19 14:20:26,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2021-12-19 14:20:26,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 2015. [2021-12-19 14:20:26,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2015 states, 1460 states have (on average 1.8047945205479452) internal successors, (2635), 1972 states have internal predecessors, (2635), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 14:20:26,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 2706 transitions. [2021-12-19 14:20:26,284 INFO L78 Accepts]: Start accepts. Automaton has 2015 states and 2706 transitions. Word has length 138 [2021-12-19 14:20:26,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:20:26,285 INFO L470 AbstractCegarLoop]: Abstraction has 2015 states and 2706 transitions. [2021-12-19 14:20:26,285 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 14:20:26,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 2706 transitions. [2021-12-19 14:20:26,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-12-19 14:20:26,286 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:20:26,286 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 14:20:26,315 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 14:20:26,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Ended with exit code 0 [2021-12-19 14:20:26,707 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 14:20:26,708 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:20:26,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:20:26,708 INFO L85 PathProgramCache]: Analyzing trace with hash -503241628, now seen corresponding path program 1 times [2021-12-19 14:20:26,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:20:26,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904404787] [2021-12-19 14:20:26,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:20:26,709 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:20:26,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:20:26,710 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 14:20:26,711 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 14:20:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:20:28,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 126 conjunts are in the unsatisfiable core [2021-12-19 14:20:28,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:20:28,037 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 14:20:28,329 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 14:20:28,375 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 14:20:28,375 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 14:20:28,410 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 14:20:28,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 14:20:28,553 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 14:20:28,557 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 14:20:30,094 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:20:30,094 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 14:20:30,099 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 14:20:30,191 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:20:30,191 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 14:20:30,196 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 14:20:30,281 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:20:30,281 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 14:20:30,287 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 14:20:30,311 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 14:20:30,314 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 14:20:30,339 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 14:20:30,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:20:30,506 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 14:20:30,529 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 14:20:30,571 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 14:20:30,611 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 14:20:31,428 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_8014))) (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_8013) .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_8014)) (.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_8013) .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 14:20:31,435 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:20:31,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904404787] [2021-12-19 14:20:31,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904404787] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:20:31,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [497648839] [2021-12-19 14:20:31,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:20:31,435 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 14:20:31,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 14:20:31,436 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 14:20:31,437 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 14:23:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:23:16,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 124 conjunts are in the unsatisfiable core [2021-12-19 14:23:16,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:23:16,926 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 14:23:17,105 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 14:23:17,130 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 14:23:17,130 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 14:23:17,170 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 14:23:17,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-19 14:23:17,298 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 14:23:17,302 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 14:23:18,509 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_8514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_8514))) (exists ((v_ArrVal_8513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_8513)))) is different from true [2021-12-19 14:23:18,543 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:23:18,544 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 14:23:18,547 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 14:23:18,656 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:23:18,656 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 14:23:18,659 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 14:23:18,744 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:23:18,745 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 14:23:18,749 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 14:23:18,772 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 14:23:18,774 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 14:23:18,778 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 14:23:18,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:23:18,820 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 14:23:18,842 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 14:23:18,878 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 14:23:18,907 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 14:23:19,546 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_8610))) (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_8609) .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_8610)) (.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_8609) .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 14:23:19,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [497648839] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:23:19,554 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 14:23:19,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2021-12-19 14:23:19,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233429483] [2021-12-19 14:23:19,554 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 14:23:19,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-19 14:23:19,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:23:19,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-19 14:23:19,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=563, Unknown=32, NotChecked=638, Total=1332 [2021-12-19 14:23:19,555 INFO L87 Difference]: Start difference. First operand 2015 states and 2706 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 14:23:20,187 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_7917 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_7917))) (exists ((v_ArrVal_7918 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_7918))) (exists ((v_arrayElimCell_94 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_94) (_ bv44 32))) (exists ((v_ArrVal_8514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_8514))) (exists ((v_ArrVal_8513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_8513)))) is different from true [2021-12-19 14:23:31,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:23:31,339 INFO L93 Difference]: Finished difference Result 3336 states and 4412 transitions. [2021-12-19 14:23:31,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-19 14:23:31,340 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 14:23:31,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:23:31,343 INFO L225 Difference]: With dead ends: 3336 [2021-12-19 14:23:31,343 INFO L226 Difference]: Without dead ends: 3336 [2021-12-19 14:23:31,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 172 SyntacticMatches, 89 SemanticMatches, 47 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=187, Invalid=1148, Unknown=45, NotChecked=972, Total=2352 [2021-12-19 14:23:31,344 INFO L933 BasicCegarLoop]: 1111 mSDtfsCounter, 2881 mSDsluCounter, 7028 mSDsCounter, 0 mSdLazyCounter, 10949 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2886 SdHoareTripleChecker+Valid, 8139 SdHoareTripleChecker+Invalid, 15388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 10949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4402 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2021-12-19 14:23:31,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2886 Valid, 8139 Invalid, 15388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 10949 Invalid, 0 Unknown, 4402 Unchecked, 11.3s Time] [2021-12-19 14:23:31,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3336 states. [2021-12-19 14:23:31,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3336 to 2014. [2021-12-19 14:23:31,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2014 states, 1460 states have (on average 1.8034246575342465) internal successors, (2633), 1971 states have internal predecessors, (2633), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 14:23:31,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 2704 transitions. [2021-12-19 14:23:31,366 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 2704 transitions. Word has length 138 [2021-12-19 14:23:31,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:23:31,366 INFO L470 AbstractCegarLoop]: Abstraction has 2014 states and 2704 transitions. [2021-12-19 14:23:31,366 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 14:23:31,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 2704 transitions. [2021-12-19 14:23:31,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-19 14:23:31,367 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:23:31,367 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 14:23:31,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Ended with exit code 0 [2021-12-19 14:23:31,636 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 14:23:31,780 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 14:23:31,781 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:23:31,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:23:31,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1659802424, now seen corresponding path program 1 times [2021-12-19 14:23:31,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:23:31,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [570990394] [2021-12-19 14:23:31,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:23:31,782 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:23:31,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:23:31,784 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 14:23:31,787 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 14:23:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:23:33,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 70 conjunts are in the unsatisfiable core [2021-12-19 14:23:33,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:23:33,059 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 14:23:33,214 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 14:23:33,215 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 14:23:33,237 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 14:23:33,326 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 14:23:35,102 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:23:35,102 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 14:23:35,201 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:23:35,202 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 14:23:35,267 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:23:35,267 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 14:23:35,333 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:23:35,333 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 14:23:35,348 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 14:23:35,379 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 14:23:35,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:23:35,439 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_9082) |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 14:23:35,446 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 14:23:35,459 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 14:23:35,467 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 14:23:35,479 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 14:23:35,489 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 14:23:35,684 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 14:23:35,685 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:23:35,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [570990394] [2021-12-19 14:23:35,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [570990394] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:23:35,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2023409023] [2021-12-19 14:23:35,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:23:35,686 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 14:23:35,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 14:23:35,687 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 14:23:35,688 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 14:23:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:23:44,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 72 conjunts are in the unsatisfiable core [2021-12-19 14:23:44,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:23:44,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 14:23:44,526 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 14:23:44,527 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 14:23:44,539 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 14:23:44,586 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 14:23:46,479 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:23:46,480 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 14:23:46,548 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:23:46,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 14:23:46,588 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:23:46,588 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 14:23:46,627 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:23:46,628 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 14:23:46,653 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 14:23:46,659 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 14:23:46,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:23:46,673 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_9600) |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 14:23:46,681 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9600 (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_9600) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-19 14:23:46,692 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9600 (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_9600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:23:46,709 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9600 (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_9600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:23:46,724 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9600 (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_9600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:23:46,733 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9600 (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_9600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:23:46,950 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9646 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9600 (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_9600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:23:46,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2023409023] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:23:46,952 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 14:23:46,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2021-12-19 14:23:46,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251684688] [2021-12-19 14:23:46,953 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 14:23:46,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-19 14:23:46,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:23:46,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-19 14:23:46,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=287, Unknown=30, NotChecked=658, Total=1056 [2021-12-19 14:23:46,954 INFO L87 Difference]: Start difference. First operand 2014 states and 2704 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 14:23:52,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:23:52,385 INFO L93 Difference]: Finished difference Result 3333 states and 4408 transitions. [2021-12-19 14:23:52,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-19 14:23:52,385 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 14:23:52,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:23:52,388 INFO L225 Difference]: With dead ends: 3333 [2021-12-19 14:23:52,388 INFO L226 Difference]: Without dead ends: 3333 [2021-12-19 14:23:52,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 186 SyntacticMatches, 90 SemanticMatches, 36 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=108, Invalid=464, Unknown=36, NotChecked=798, Total=1406 [2021-12-19 14:23:52,389 INFO L933 BasicCegarLoop]: 1110 mSDtfsCounter, 1601 mSDsluCounter, 7717 mSDsCounter, 0 mSdLazyCounter, 4597 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1606 SdHoareTripleChecker+Valid, 8827 SdHoareTripleChecker+Invalid, 10095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5470 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2021-12-19 14:23:52,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1606 Valid, 8827 Invalid, 10095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4597 Invalid, 0 Unknown, 5470 Unchecked, 5.2s Time] [2021-12-19 14:23:52,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3333 states. [2021-12-19 14:23:52,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3333 to 2013. [2021-12-19 14:23:52,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2013 states, 1460 states have (on average 1.8020547945205478) internal successors, (2631), 1970 states have internal predecessors, (2631), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2021-12-19 14:23:52,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 2013 states and 2702 transitions. [2021-12-19 14:23:52,415 INFO L78 Accepts]: Start accepts. Automaton has 2013 states and 2702 transitions. Word has length 141 [2021-12-19 14:23:52,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:23:52,416 INFO L470 AbstractCegarLoop]: Abstraction has 2013 states and 2702 transitions. [2021-12-19 14:23:52,416 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 14:23:52,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2013 states and 2702 transitions. [2021-12-19 14:23:52,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-19 14:23:52,417 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:23:52,417 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 14:23:52,443 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 14:23:52,661 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 14:23:52,839 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 14:23:52,840 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 630 more)] === [2021-12-19 14:23:52,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:23:52,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1659802425, now seen corresponding path program 1 times [2021-12-19 14:23:52,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:23:52,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011805520] [2021-12-19 14:23:52,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:23:52,841 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:23:52,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:23:52,842 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 14:23:52,845 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 14:23:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:23:54,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 129 conjunts are in the unsatisfiable core [2021-12-19 14:23:54,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:23:54,423 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 14:23:54,697 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 14:23:54,735 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 14:23:54,735 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 14:23:54,760 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 14:23:54,766 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 14:23:54,866 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 14:23:54,869 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 14:23:56,248 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_10160 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_10160))) (exists ((v_ArrVal_10161 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_10161))) (exists ((v_arrayElimCell_134 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_134) (_ bv44 32)))) is different from true [2021-12-19 14:23:56,290 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:23:56,290 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 14:23:56,293 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 14:23:56,388 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:23:56,388 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 14:23:56,394 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 14:23:56,471 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:23:56,471 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 14:23:56,475 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 14:23:56,564 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:23:56,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 14:23:56,569 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 14:23:56,594 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 14:23:56,597 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 14:23:56,631 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 14:23:56,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:23:56,835 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 14:23:56,862 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 14:23:56,906 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 14:23:56,978 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 14:23:57,064 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 14:23:57,930 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 14:24:00,918 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))) (v_ArrVal_10258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10259 (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_10258))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_10162))) (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_10259) .cse1 v_ArrVal_10163) .cse2 v_ArrVal_10164) (select (select (store .cse3 .cse2 v_ArrVal_10165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10167))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (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))) (v_ArrVal_10258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10259 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10258)) (.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_10162))) (let ((.cse7 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))) (let ((.cse10 (store .cse11 .cse7 v_ArrVal_10165))) (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_10259) .cse6 v_ArrVal_10163) .cse7 v_ArrVal_10164) .cse8 v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse9) (_ bv24 32)) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_10166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))))))))))) is different from false [2021-12-19 14:24:00,937 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:24:00,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011805520] [2021-12-19 14:24:00,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1011805520] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:24:00,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [508206916] [2021-12-19 14:24:00,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:24:00,938 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 14:24:00,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 14:24:00,939 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 14:24:00,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process Killed by 15