./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c 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/ldv-memsafety/memleaks_test22_2-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 beb004be26a355c223f1a45515f5377c37b18fc46f09e77727f89b964ae9789d --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:55:56,266 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:55:56,268 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:55:56,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:55:56,299 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:55:56,300 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:55:56,301 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:55:56,302 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:55:56,304 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:55:56,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:55:56,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:55:56,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:55:56,306 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:55:56,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:55:56,320 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:55:56,321 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:55:56,322 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:55:56,322 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:55:56,323 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:55:56,325 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:55:56,326 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:55:56,329 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:55:56,330 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:55:56,330 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:55:56,331 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:55:56,333 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:55:56,333 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:55:56,333 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:55:56,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:55:56,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:55:56,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:55:56,335 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:55:56,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:55:56,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:55:56,336 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:55:56,337 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:55:56,337 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:55:56,338 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:55:56,338 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:55:56,338 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:55:56,339 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:55:56,344 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:55:56,344 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 18:55:56,361 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:55:56,361 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:55:56,361 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:55:56,362 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:55:56,362 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:55:56,362 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:55:56,363 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:55:56,363 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:55:56,363 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:55:56,363 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:55:56,363 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:55:56,364 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:55:56,364 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:55:56,364 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:55:56,364 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:55:56,364 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:55:56,364 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:55:56,364 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:55:56,365 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:55:56,365 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:55:56,365 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:55:56,365 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:55:56,365 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:55:56,365 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:55:56,365 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:55:56,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:55:56,366 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:55:56,366 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:55:56,366 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 18:55:56,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 18:55:56,366 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 -> beb004be26a355c223f1a45515f5377c37b18fc46f09e77727f89b964ae9789d [2022-07-12 18:55:56,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:55:56,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:55:56,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:55:56,557 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:55:56,557 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:55:56,558 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2022-07-12 18:55:56,610 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4671619f0/9084a713e5f442bb97bb6d7b9913af54/FLAG7e304bced [2022-07-12 18:55:56,977 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:55:56,978 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2022-07-12 18:55:56,990 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4671619f0/9084a713e5f442bb97bb6d7b9913af54/FLAG7e304bced [2022-07-12 18:55:57,357 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4671619f0/9084a713e5f442bb97bb6d7b9913af54 [2022-07-12 18:55:57,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:55:57,359 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:55:57,360 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:55:57,360 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:55:57,362 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:55:57,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:55:57" (1/1) ... [2022-07-12 18:55:57,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@845692c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:55:57, skipping insertion in model container [2022-07-12 18:55:57,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:55:57" (1/1) ... [2022-07-12 18:55:57,368 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:55:57,394 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:55:57,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:55:57,682 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-07-12 18:55:57,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@15d976cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:55:57, skipping insertion in model container [2022-07-12 18:55:57,683 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:55:57,683 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-12 18:55:57,685 INFO L158 Benchmark]: Toolchain (without parser) took 324.51ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 60.3MB in the beginning and 85.3MB in the end (delta: -25.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 18:55:57,686 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 92.3MB. Free memory is still 49.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:55:57,686 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.77ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 60.1MB in the beginning and 85.3MB in the end (delta: -25.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 18:55:57,688 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 92.3MB. Free memory is still 49.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.77ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 60.1MB in the beginning and 85.3MB in the end (delta: -25.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types of different sizes 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/ldv-memsafety/memleaks_test22_2-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 beb004be26a355c223f1a45515f5377c37b18fc46f09e77727f89b964ae9789d --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:55:59,390 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:55:59,392 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:55:59,432 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:55:59,432 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:55:59,433 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:55:59,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:55:59,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:55:59,439 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:55:59,443 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:55:59,444 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:55:59,447 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:55:59,448 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:55:59,449 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:55:59,450 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:55:59,452 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:55:59,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:55:59,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:55:59,455 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:55:59,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:55:59,460 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:55:59,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:55:59,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:55:59,463 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:55:59,464 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:55:59,469 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:55:59,469 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:55:59,470 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:55:59,470 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:55:59,470 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:55:59,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:55:59,471 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:55:59,473 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:55:59,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:55:59,474 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:55:59,475 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:55:59,475 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:55:59,475 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:55:59,475 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:55:59,475 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:55:59,476 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:55:59,477 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:55:59,483 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-12 18:55:59,500 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:55:59,501 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:55:59,501 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:55:59,501 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:55:59,502 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:55:59,502 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:55:59,502 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:55:59,502 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:55:59,503 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:55:59,503 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:55:59,503 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:55:59,504 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:55:59,504 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:55:59,504 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:55:59,504 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:55:59,504 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:55:59,504 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:55:59,505 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:55:59,505 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:55:59,505 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:55:59,505 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 18:55:59,505 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 18:55:59,505 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:55:59,505 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:55:59,506 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:55:59,506 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:55:59,506 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:55:59,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:55:59,506 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:55:59,506 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:55:59,507 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 18:55:59,507 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 18:55:59,507 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 18:55:59,507 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 -> beb004be26a355c223f1a45515f5377c37b18fc46f09e77727f89b964ae9789d [2022-07-12 18:55:59,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:55:59,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:55:59,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:55:59,751 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:55:59,751 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:55:59,752 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2022-07-12 18:55:59,790 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ab243b36/d08ea11eb6984776994c973e8d23fbfa/FLAG1b421fc37 [2022-07-12 18:56:00,196 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:56:00,197 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2022-07-12 18:56:00,213 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ab243b36/d08ea11eb6984776994c973e8d23fbfa/FLAG1b421fc37 [2022-07-12 18:56:00,534 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ab243b36/d08ea11eb6984776994c973e8d23fbfa [2022-07-12 18:56:00,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:56:00,538 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:56:00,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:56:00,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:56:00,543 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:56:00,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:56:00" (1/1) ... [2022-07-12 18:56:00,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eebbc32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:00, skipping insertion in model container [2022-07-12 18:56:00,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:56:00" (1/1) ... [2022-07-12 18:56:00,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:56:00,586 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:56:00,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:56:00,890 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-12 18:56:00,903 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:56:00,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:56:00,956 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:56:00,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:56:01,018 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:56:01,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:01 WrapperNode [2022-07-12 18:56:01,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:56:01,022 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:56:01,022 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:56:01,023 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:56:01,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:01" (1/1) ... [2022-07-12 18:56:01,044 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:01" (1/1) ... [2022-07-12 18:56:01,068 INFO L137 Inliner]: procedures = 165, calls = 71, calls flagged for inlining = 23, calls inlined = 17, statements flattened = 120 [2022-07-12 18:56:01,069 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:56:01,069 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:56:01,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:56:01,070 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:56:01,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:01" (1/1) ... [2022-07-12 18:56:01,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:01" (1/1) ... [2022-07-12 18:56:01,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:01" (1/1) ... [2022-07-12 18:56:01,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:01" (1/1) ... [2022-07-12 18:56:01,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:01" (1/1) ... [2022-07-12 18:56:01,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:01" (1/1) ... [2022-07-12 18:56:01,107 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:01" (1/1) ... [2022-07-12 18:56:01,113 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:56:01,120 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:56:01,120 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:56:01,120 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:56:01,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:01" (1/1) ... [2022-07-12 18:56:01,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:56:01,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:56:01,145 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) [2022-07-12 18:56:01,165 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 [2022-07-12 18:56:01,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 18:56:01,177 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-07-12 18:56:01,177 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-07-12 18:56:01,177 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 18:56:01,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 18:56:01,178 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2022-07-12 18:56:01,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2022-07-12 18:56:01,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:56:01,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 18:56:01,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 18:56:01,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 18:56:01,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 18:56:01,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:56:01,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 18:56:01,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:56:01,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:56:01,282 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:56:01,283 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:56:01,609 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:56:01,614 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:56:01,614 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 18:56:01,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:56:01 BoogieIcfgContainer [2022-07-12 18:56:01,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:56:01,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:56:01,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:56:01,620 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:56:01,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:56:00" (1/3) ... [2022-07-12 18:56:01,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27225c56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:56:01, skipping insertion in model container [2022-07-12 18:56:01,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:01" (2/3) ... [2022-07-12 18:56:01,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27225c56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:56:01, skipping insertion in model container [2022-07-12 18:56:01,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:56:01" (3/3) ... [2022-07-12 18:56:01,622 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2-2.i [2022-07-12 18:56:01,631 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:56:01,633 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2022-07-12 18:56:01,665 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:56:01,670 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4505a1c3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1341d1b1 [2022-07-12 18:56:01,671 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-07-12 18:56:01,675 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 83 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:56:01,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:56:01,682 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:01,683 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:01,683 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:01,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:01,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1790059245, now seen corresponding path program 1 times [2022-07-12 18:56:01,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:01,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281335897] [2022-07-12 18:56:01,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:01,696 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:01,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:01,699 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) [2022-07-12 18:56:01,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 18:56:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:01,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 18:56:01,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:01,832 INFO L390 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 [2022-07-12 18:56:01,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:01,878 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:01,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:01,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281335897] [2022-07-12 18:56:01,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281335897] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:01,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:01,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:56:01,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974075454] [2022-07-12 18:56:01,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:01,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:56:01,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:01,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:56:01,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:56:01,930 INFO L87 Difference]: Start difference. First operand has 90 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 83 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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) [2022-07-12 18:56:02,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:02,214 INFO L93 Difference]: Finished difference Result 153 states and 173 transitions. [2022-07-12 18:56:02,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:56:02,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2022-07-12 18:56:02,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:02,230 INFO L225 Difference]: With dead ends: 153 [2022-07-12 18:56:02,231 INFO L226 Difference]: Without dead ends: 151 [2022-07-12 18:56:02,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:56:02,234 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 94 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:02,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 373 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:56:02,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-12 18:56:02,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 93. [2022-07-12 18:56:02,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 85 states have internal predecessors, (94), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-12 18:56:02,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2022-07-12 18:56:02,262 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 10 [2022-07-12 18:56:02,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:02,262 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2022-07-12 18:56:02,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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) [2022-07-12 18:56:02,263 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2022-07-12 18:56:02,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:56:02,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:02,263 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:02,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:02,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:02,470 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:02,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:02,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1761430094, now seen corresponding path program 1 times [2022-07-12 18:56:02,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:02,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [618952427] [2022-07-12 18:56:02,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:02,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:02,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:02,473 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) [2022-07-12 18:56:02,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 18:56:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:02,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 18:56:02,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:02,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:02,555 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:02,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:02,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [618952427] [2022-07-12 18:56:02,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [618952427] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:02,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:02,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:56:02,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481102465] [2022-07-12 18:56:02,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:02,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:56:02,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:02,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:56:02,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:56:02,558 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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) [2022-07-12 18:56:02,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:02,577 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-07-12 18:56:02,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:56:02,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 10 [2022-07-12 18:56:02,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:02,579 INFO L225 Difference]: With dead ends: 110 [2022-07-12 18:56:02,579 INFO L226 Difference]: Without dead ends: 110 [2022-07-12 18:56:02,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:56:02,581 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 17 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:02,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 385 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:56:02,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-12 18:56:02,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 91. [2022-07-12 18:56:02,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 59 states have (on average 1.5423728813559323) internal successors, (91), 83 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-12 18:56:02,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2022-07-12 18:56:02,589 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 10 [2022-07-12 18:56:02,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:02,589 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2022-07-12 18:56:02,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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) [2022-07-12 18:56:02,589 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2022-07-12 18:56:02,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 18:56:02,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:02,590 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:02,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:02,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:02,797 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:02,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:02,798 INFO L85 PathProgramCache]: Analyzing trace with hash 342738302, now seen corresponding path program 1 times [2022-07-12 18:56:02,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:02,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860845314] [2022-07-12 18:56:02,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:02,799 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:02,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:02,800 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) [2022-07-12 18:56:02,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 18:56:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:02,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 18:56:02,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:02,858 INFO L390 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 [2022-07-12 18:56:02,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:02,918 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:02,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:02,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860845314] [2022-07-12 18:56:02,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860845314] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:02,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:02,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:56:02,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242074411] [2022-07-12 18:56:02,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:02,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:56:02,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:02,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:56:02,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:56:02,920 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (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) [2022-07-12 18:56:03,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:03,200 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2022-07-12 18:56:03,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:56:03,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (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 11 [2022-07-12 18:56:03,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:03,202 INFO L225 Difference]: With dead ends: 128 [2022-07-12 18:56:03,202 INFO L226 Difference]: Without dead ends: 128 [2022-07-12 18:56:03,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:56:03,205 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 69 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:03,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 465 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:56:03,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-12 18:56:03,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 90. [2022-07-12 18:56:03,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 82 states have internal predecessors, (90), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-12 18:56:03,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2022-07-12 18:56:03,223 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 11 [2022-07-12 18:56:03,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:03,223 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2022-07-12 18:56:03,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (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) [2022-07-12 18:56:03,225 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2022-07-12 18:56:03,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 18:56:03,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:03,225 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:03,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-12 18:56:03,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:03,456 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:03,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:03,457 INFO L85 PathProgramCache]: Analyzing trace with hash 2034926041, now seen corresponding path program 1 times [2022-07-12 18:56:03,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:03,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [820457954] [2022-07-12 18:56:03,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:03,458 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:03,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:03,472 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) [2022-07-12 18:56:03,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 18:56:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:03,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:56:03,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:03,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:03,536 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:03,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:03,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [820457954] [2022-07-12 18:56:03,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [820457954] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:03,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:03,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:56:03,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392894616] [2022-07-12 18:56:03,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:03,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:56:03,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:03,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:56:03,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:56:03,538 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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) [2022-07-12 18:56:03,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:03,554 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2022-07-12 18:56:03,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:56:03,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 12 [2022-07-12 18:56:03,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:03,555 INFO L225 Difference]: With dead ends: 109 [2022-07-12 18:56:03,555 INFO L226 Difference]: Without dead ends: 109 [2022-07-12 18:56:03,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:56:03,556 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 33 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:03,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 409 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:56:03,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-12 18:56:03,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2022-07-12 18:56:03,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.5084745762711864) internal successors, (89), 82 states have internal predecessors, (89), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-12 18:56:03,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2022-07-12 18:56:03,562 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 12 [2022-07-12 18:56:03,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:03,562 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2022-07-12 18:56:03,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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) [2022-07-12 18:56:03,563 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2022-07-12 18:56:03,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 18:56:03,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:03,563 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:03,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:03,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:03,771 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:03,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:03,771 INFO L85 PathProgramCache]: Analyzing trace with hash -517230920, now seen corresponding path program 1 times [2022-07-12 18:56:03,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:03,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225162450] [2022-07-12 18:56:03,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:03,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:03,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:03,776 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) [2022-07-12 18:56:03,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 18:56:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:03,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 18:56:03,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:03,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:03,891 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:03,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:03,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225162450] [2022-07-12 18:56:03,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225162450] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:03,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:03,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:56:03,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358856323] [2022-07-12 18:56:03,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:03,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:56:03,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:03,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:56:03,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:56:03,893 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2022-07-12 18:56:03,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:03,924 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2022-07-12 18:56:03,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:56:03,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 12 [2022-07-12 18:56:03,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:03,925 INFO L225 Difference]: With dead ends: 106 [2022-07-12 18:56:03,925 INFO L226 Difference]: Without dead ends: 106 [2022-07-12 18:56:03,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:56:03,926 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 15 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:03,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 281 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:56:03,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-12 18:56:03,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 92. [2022-07-12 18:56:03,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 84 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-12 18:56:03,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2022-07-12 18:56:03,936 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 12 [2022-07-12 18:56:03,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:03,936 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2022-07-12 18:56:03,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2022-07-12 18:56:03,937 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2022-07-12 18:56:03,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:56:03,943 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:03,943 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:03,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-12 18:56:04,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:04,150 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:04,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:04,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1400250303, now seen corresponding path program 1 times [2022-07-12 18:56:04,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:04,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [36764724] [2022-07-12 18:56:04,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:04,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:04,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:04,157 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) [2022-07-12 18:56:04,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 18:56:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:04,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 18:56:04,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:04,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:04,251 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:04,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:04,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [36764724] [2022-07-12 18:56:04,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [36764724] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:04,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:04,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:56:04,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868599091] [2022-07-12 18:56:04,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:04,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:56:04,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:04,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:56:04,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:56:04,254 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2022-07-12 18:56:04,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:04,272 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2022-07-12 18:56:04,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:56:04,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 16 [2022-07-12 18:56:04,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:04,273 INFO L225 Difference]: With dead ends: 100 [2022-07-12 18:56:04,273 INFO L226 Difference]: Without dead ends: 100 [2022-07-12 18:56:04,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:56:04,277 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 31 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:04,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 200 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:56:04,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-12 18:56:04,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2022-07-12 18:56:04,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 85 states have internal predecessors, (92), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-12 18:56:04,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2022-07-12 18:56:04,298 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 16 [2022-07-12 18:56:04,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:04,298 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2022-07-12 18:56:04,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2022-07-12 18:56:04,299 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-07-12 18:56:04,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 18:56:04,299 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:04,299 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:04,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-12 18:56:04,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:04,507 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:04,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:04,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1200886583, now seen corresponding path program 1 times [2022-07-12 18:56:04,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:04,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [106812296] [2022-07-12 18:56:04,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:04,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:04,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:04,513 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) [2022-07-12 18:56:04,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 18:56:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:04,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 18:56:04,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:04,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:04,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:04,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:04,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [106812296] [2022-07-12 18:56:04,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [106812296] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:04,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:04,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:56:04,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251884477] [2022-07-12 18:56:04,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:04,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:56:04,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:04,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:56:04,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:56:04,615 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:04,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:04,659 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2022-07-12 18:56:04,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:56:04,660 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-12 18:56:04,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:04,661 INFO L225 Difference]: With dead ends: 106 [2022-07-12 18:56:04,661 INFO L226 Difference]: Without dead ends: 106 [2022-07-12 18:56:04,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:56:04,662 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 14 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:04,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 448 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:56:04,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-12 18:56:04,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2022-07-12 18:56:04,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 67 states have (on average 1.4477611940298507) internal successors, (97), 91 states have internal predecessors, (97), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-12 18:56:04,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2022-07-12 18:56:04,667 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 17 [2022-07-12 18:56:04,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:04,668 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2022-07-12 18:56:04,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:04,668 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2022-07-12 18:56:04,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 18:56:04,668 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:04,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:04,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:04,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:04,875 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:04,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:04,876 INFO L85 PathProgramCache]: Analyzing trace with hash -517345560, now seen corresponding path program 1 times [2022-07-12 18:56:04,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:04,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595547176] [2022-07-12 18:56:04,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:04,877 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:04,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:04,891 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) [2022-07-12 18:56:04,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-12 18:56:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:04,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:56:04,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:04,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:04,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:56:05,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:05,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:05,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595547176] [2022-07-12 18:56:05,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595547176] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:56:05,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:56:05,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-12 18:56:05,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561130448] [2022-07-12 18:56:05,028 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:56:05,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:56:05,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:05,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:56:05,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:56:05,029 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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) [2022-07-12 18:56:05,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:05,083 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2022-07-12 18:56:05,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:56:05,084 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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 17 [2022-07-12 18:56:05,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:05,084 INFO L225 Difference]: With dead ends: 107 [2022-07-12 18:56:05,084 INFO L226 Difference]: Without dead ends: 107 [2022-07-12 18:56:05,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:56:05,085 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 62 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:05,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 465 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:56:05,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-12 18:56:05,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2022-07-12 18:56:05,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 94 states have internal predecessors, (100), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-12 18:56:05,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2022-07-12 18:56:05,089 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 17 [2022-07-12 18:56:05,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:05,089 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2022-07-12 18:56:05,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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) [2022-07-12 18:56:05,089 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2022-07-12 18:56:05,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 18:56:05,090 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:05,090 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:05,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:05,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:05,297 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:05,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:05,297 INFO L85 PathProgramCache]: Analyzing trace with hash -613690879, now seen corresponding path program 2 times [2022-07-12 18:56:05,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:05,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067689094] [2022-07-12 18:56:05,297 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:56:05,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:05,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:05,299 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) [2022-07-12 18:56:05,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-12 18:56:05,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 18:56:05,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:56:05,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 18:56:05,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:05,381 INFO L390 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 [2022-07-12 18:56:05,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 18:56:05,435 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:05,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:05,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1067689094] [2022-07-12 18:56:05,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1067689094] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:05,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:05,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:56:05,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485559230] [2022-07-12 18:56:05,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:05,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:56:05,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:05,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:56:05,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:56:05,437 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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) [2022-07-12 18:56:05,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:05,691 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions. [2022-07-12 18:56:05,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:56:05,691 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 20 [2022-07-12 18:56:05,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:05,692 INFO L225 Difference]: With dead ends: 136 [2022-07-12 18:56:05,692 INFO L226 Difference]: Without dead ends: 136 [2022-07-12 18:56:05,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:56:05,693 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 91 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:05,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 511 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:56:05,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-12 18:56:05,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 103. [2022-07-12 18:56:05,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 93 states have internal predecessors, (99), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-12 18:56:05,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2022-07-12 18:56:05,697 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 20 [2022-07-12 18:56:05,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:05,697 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2022-07-12 18:56:05,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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) [2022-07-12 18:56:05,697 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2022-07-12 18:56:05,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 18:56:05,698 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:05,698 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:05,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-07-12 18:56:05,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:05,905 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:05,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:05,905 INFO L85 PathProgramCache]: Analyzing trace with hash -613690878, now seen corresponding path program 1 times [2022-07-12 18:56:05,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:05,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196179305] [2022-07-12 18:56:05,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:05,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:05,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:05,919 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) [2022-07-12 18:56:05,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-12 18:56:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:06,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 18:56:06,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:06,118 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:06,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:56:06,243 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:06,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:06,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196179305] [2022-07-12 18:56:06,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [196179305] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:56:06,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:56:06,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-12 18:56:06,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365869943] [2022-07-12 18:56:06,243 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:56:06,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 18:56:06,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:06,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 18:56:06,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:56:06,244 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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) [2022-07-12 18:56:06,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:06,416 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2022-07-12 18:56:06,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:56:06,416 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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 20 [2022-07-12 18:56:06,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:06,417 INFO L225 Difference]: With dead ends: 112 [2022-07-12 18:56:06,417 INFO L226 Difference]: Without dead ends: 112 [2022-07-12 18:56:06,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:56:06,418 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 30 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:06,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 918 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:56:06,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-12 18:56:06,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2022-07-12 18:56:06,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 76 states have (on average 1.381578947368421) internal successors, (105), 99 states have internal predecessors, (105), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-12 18:56:06,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2022-07-12 18:56:06,420 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 20 [2022-07-12 18:56:06,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:06,420 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2022-07-12 18:56:06,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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) [2022-07-12 18:56:06,421 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2022-07-12 18:56:06,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 18:56:06,421 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:06,421 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:06,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:06,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:06,622 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:06,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:06,622 INFO L85 PathProgramCache]: Analyzing trace with hash -694582635, now seen corresponding path program 1 times [2022-07-12 18:56:06,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:06,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093520851] [2022-07-12 18:56:06,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:06,622 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:06,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:06,630 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) [2022-07-12 18:56:06,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-12 18:56:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:06,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:56:06,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:06,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 18:56:06,712 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:06,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:06,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093520851] [2022-07-12 18:56:06,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093520851] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:06,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:06,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:56:06,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611684275] [2022-07-12 18:56:06,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:06,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:56:06,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:06,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:56:06,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:56:06,714 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 18:56:06,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:06,810 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2022-07-12 18:56:06,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:56:06,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-07-12 18:56:06,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:06,812 INFO L225 Difference]: With dead ends: 115 [2022-07-12 18:56:06,812 INFO L226 Difference]: Without dead ends: 99 [2022-07-12 18:56:06,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:56:06,812 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 31 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:06,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 182 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:56:06,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-12 18:56:06,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2022-07-12 18:56:06,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 88 states have internal predecessors, (94), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:56:06,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2022-07-12 18:56:06,815 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 25 [2022-07-12 18:56:06,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:06,815 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2022-07-12 18:56:06,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 18:56:06,815 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2022-07-12 18:56:06,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 18:56:06,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:06,815 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:06,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-07-12 18:56:07,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:07,016 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:07,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:07,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1800263842, now seen corresponding path program 2 times [2022-07-12 18:56:07,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:07,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [916266441] [2022-07-12 18:56:07,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:56:07,017 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:07,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:07,019 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) [2022-07-12 18:56:07,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-12 18:56:07,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 18:56:07,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:56:07,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 18:56:07,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:07,090 INFO L390 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 [2022-07-12 18:56:07,216 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-12 18:56:07,216 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:07,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:07,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [916266441] [2022-07-12 18:56:07,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [916266441] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:07,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:07,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:56:07,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660972523] [2022-07-12 18:56:07,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:07,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:56:07,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:07,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:56:07,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:56:07,218 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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) [2022-07-12 18:56:07,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:07,601 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-07-12 18:56:07,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:56:07,602 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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 26 [2022-07-12 18:56:07,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:07,603 INFO L225 Difference]: With dead ends: 135 [2022-07-12 18:56:07,603 INFO L226 Difference]: Without dead ends: 135 [2022-07-12 18:56:07,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:56:07,603 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 97 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:07,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 590 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:56:07,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-12 18:56:07,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 94. [2022-07-12 18:56:07,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 87 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:56:07,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2022-07-12 18:56:07,607 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 26 [2022-07-12 18:56:07,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:07,607 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2022-07-12 18:56:07,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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) [2022-07-12 18:56:07,608 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2022-07-12 18:56:07,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 18:56:07,610 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:07,610 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:07,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:07,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:07,818 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:07,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:07,818 INFO L85 PathProgramCache]: Analyzing trace with hash -819776159, now seen corresponding path program 1 times [2022-07-12 18:56:07,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:07,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815630443] [2022-07-12 18:56:07,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:07,819 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:07,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:07,833 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) [2022-07-12 18:56:07,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-12 18:56:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:07,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 18:56:07,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:08,121 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:08,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:56:08,469 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:08,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:08,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815630443] [2022-07-12 18:56:08,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815630443] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:56:08,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:56:08,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-12 18:56:08,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930669879] [2022-07-12 18:56:08,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:56:08,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-12 18:56:08,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:08,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-12 18:56:08,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2022-07-12 18:56:08,471 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 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) [2022-07-12 18:56:08,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:08,774 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2022-07-12 18:56:08,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 18:56:08,775 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 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 28 [2022-07-12 18:56:08,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:08,775 INFO L225 Difference]: With dead ends: 100 [2022-07-12 18:56:08,775 INFO L226 Difference]: Without dead ends: 100 [2022-07-12 18:56:08,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=278, Invalid=652, Unknown=0, NotChecked=0, Total=930 [2022-07-12 18:56:08,776 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 29 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:08,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1126 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:56:08,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-12 18:56:08,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-07-12 18:56:08,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.375) internal successors, (99), 93 states have internal predecessors, (99), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:56:08,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2022-07-12 18:56:08,779 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 28 [2022-07-12 18:56:08,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:08,779 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2022-07-12 18:56:08,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 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) [2022-07-12 18:56:08,779 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2022-07-12 18:56:08,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 18:56:08,779 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:08,779 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:08,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:08,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:08,980 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:08,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:08,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1570464767, now seen corresponding path program 2 times [2022-07-12 18:56:08,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:08,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179646014] [2022-07-12 18:56:08,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:56:08,981 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:08,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:08,982 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) [2022-07-12 18:56:08,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-12 18:56:09,078 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 18:56:09,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:56:09,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 18:56:09,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:09,127 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:09,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:09,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:09,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179646014] [2022-07-12 18:56:09,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179646014] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:09,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:09,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:56:09,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812834107] [2022-07-12 18:56:09,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:09,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:56:09,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:09,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:56:09,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:56:09,130 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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) [2022-07-12 18:56:09,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:09,154 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2022-07-12 18:56:09,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:56:09,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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 34 [2022-07-12 18:56:09,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:09,157 INFO L225 Difference]: With dead ends: 100 [2022-07-12 18:56:09,157 INFO L226 Difference]: Without dead ends: 100 [2022-07-12 18:56:09,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:56:09,158 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 49 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:09,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 365 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:56:09,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-12 18:56:09,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-07-12 18:56:09,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 93 states have internal predecessors, (98), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:56:09,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2022-07-12 18:56:09,161 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 34 [2022-07-12 18:56:09,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:09,162 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2022-07-12 18:56:09,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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) [2022-07-12 18:56:09,162 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2022-07-12 18:56:09,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 18:56:09,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:09,163 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:09,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:09,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:09,370 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:09,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:09,370 INFO L85 PathProgramCache]: Analyzing trace with hash -234355352, now seen corresponding path program 1 times [2022-07-12 18:56:09,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:09,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703332187] [2022-07-12 18:56:09,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:09,371 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:09,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:09,382 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) [2022-07-12 18:56:09,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-12 18:56:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:09,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 18:56:09,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:09,515 INFO L390 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 [2022-07-12 18:56:09,590 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:09,591 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:09,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:09,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703332187] [2022-07-12 18:56:09,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703332187] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:09,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:09,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:56:09,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727574915] [2022-07-12 18:56:09,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:09,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:56:09,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:09,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:56:09,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:56:09,593 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:09,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:09,811 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2022-07-12 18:56:09,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:56:09,811 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-07-12 18:56:09,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:09,812 INFO L225 Difference]: With dead ends: 98 [2022-07-12 18:56:09,812 INFO L226 Difference]: Without dead ends: 98 [2022-07-12 18:56:09,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:56:09,813 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 74 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:09,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 378 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:56:09,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-12 18:56:09,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-12 18:56:09,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 91 states have internal predecessors, (96), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:56:09,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2022-07-12 18:56:09,815 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 36 [2022-07-12 18:56:09,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:09,815 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2022-07-12 18:56:09,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:09,815 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2022-07-12 18:56:09,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 18:56:09,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:09,815 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:09,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:10,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:10,024 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:10,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:10,025 INFO L85 PathProgramCache]: Analyzing trace with hash -234355351, now seen corresponding path program 1 times [2022-07-12 18:56:10,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:10,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704435394] [2022-07-12 18:56:10,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:10,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:10,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:10,026 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) [2022-07-12 18:56:10,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-12 18:56:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:10,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 18:56:10,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:10,181 INFO L390 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 [2022-07-12 18:56:10,339 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:10,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:10,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:10,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704435394] [2022-07-12 18:56:10,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1704435394] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:10,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:10,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 18:56:10,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034582138] [2022-07-12 18:56:10,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:10,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:56:10,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:10,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:56:10,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:56:10,341 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:10,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:10,587 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2022-07-12 18:56:10,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:56:10,588 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-07-12 18:56:10,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:10,588 INFO L225 Difference]: With dead ends: 96 [2022-07-12 18:56:10,588 INFO L226 Difference]: Without dead ends: 96 [2022-07-12 18:56:10,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:56:10,589 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 78 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:10,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 460 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:56:10,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-12 18:56:10,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-07-12 18:56:10,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 89 states have internal predecessors, (94), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:56:10,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2022-07-12 18:56:10,591 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 36 [2022-07-12 18:56:10,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:10,591 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2022-07-12 18:56:10,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 18:56:10,591 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2022-07-12 18:56:10,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 18:56:10,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:10,592 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:10,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:10,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:10,792 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:10,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:10,793 INFO L85 PathProgramCache]: Analyzing trace with hash -285061459, now seen corresponding path program 1 times [2022-07-12 18:56:10,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:10,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [401270416] [2022-07-12 18:56:10,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:10,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:10,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:10,794 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) [2022-07-12 18:56:10,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-12 18:56:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:10,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:56:10,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:10,955 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:10,955 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:10,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:10,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [401270416] [2022-07-12 18:56:10,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [401270416] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:10,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:10,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:56:10,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8745063] [2022-07-12 18:56:10,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:10,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:56:10,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:10,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:56:10,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:56:10,957 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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) [2022-07-12 18:56:10,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:10,993 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-07-12 18:56:10,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:56:10,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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 36 [2022-07-12 18:56:10,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:10,994 INFO L225 Difference]: With dead ends: 96 [2022-07-12 18:56:10,994 INFO L226 Difference]: Without dead ends: 96 [2022-07-12 18:56:10,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:56:10,995 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 69 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:10,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 390 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:56:10,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-12 18:56:10,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-07-12 18:56:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 88 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:56:10,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2022-07-12 18:56:10,997 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 36 [2022-07-12 18:56:10,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:10,997 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2022-07-12 18:56:10,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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) [2022-07-12 18:56:10,997 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2022-07-12 18:56:10,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 18:56:10,998 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:10,998 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:11,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:11,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:11,199 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:11,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:11,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1910239882, now seen corresponding path program 1 times [2022-07-12 18:56:11,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:11,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659792982] [2022-07-12 18:56:11,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:11,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:11,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:11,202 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) [2022-07-12 18:56:11,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-12 18:56:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:11,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 18:56:11,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:11,419 INFO L390 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 [2022-07-12 18:56:11,508 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:11,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:11,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:11,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659792982] [2022-07-12 18:56:11,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659792982] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:11,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:11,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:56:11,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092390796] [2022-07-12 18:56:11,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:11,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:56:11,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:11,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:56:11,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:56:11,510 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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) [2022-07-12 18:56:11,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:11,684 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2022-07-12 18:56:11,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:56:11,684 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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 44 [2022-07-12 18:56:11,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:11,685 INFO L225 Difference]: With dead ends: 97 [2022-07-12 18:56:11,685 INFO L226 Difference]: Without dead ends: 97 [2022-07-12 18:56:11,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:56:11,685 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 61 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:11,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 366 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 21 Unchecked, 0.1s Time] [2022-07-12 18:56:11,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-12 18:56:11,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2022-07-12 18:56:11,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 86 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:56:11,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2022-07-12 18:56:11,687 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 44 [2022-07-12 18:56:11,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:11,688 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2022-07-12 18:56:11,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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) [2022-07-12 18:56:11,688 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2022-07-12 18:56:11,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 18:56:11,688 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:11,688 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:11,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:11,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:11,899 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:11,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:11,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1910239883, now seen corresponding path program 1 times [2022-07-12 18:56:11,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:11,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391717699] [2022-07-12 18:56:11,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:11,899 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:11,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:11,904 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) [2022-07-12 18:56:11,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-12 18:56:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:12,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-12 18:56:12,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:12,077 INFO L390 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 [2022-07-12 18:56:12,272 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:12,272 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:12,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:12,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391717699] [2022-07-12 18:56:12,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391717699] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:12,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:12,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 18:56:12,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635470118] [2022-07-12 18:56:12,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:12,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:56:12,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:12,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:56:12,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:56:12,273 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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) [2022-07-12 18:56:12,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:12,453 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2022-07-12 18:56:12,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:56:12,453 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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 44 [2022-07-12 18:56:12,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:12,454 INFO L225 Difference]: With dead ends: 99 [2022-07-12 18:56:12,454 INFO L226 Difference]: Without dead ends: 99 [2022-07-12 18:56:12,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:56:12,454 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 64 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:12,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 349 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 130 Invalid, 0 Unknown, 17 Unchecked, 0.1s Time] [2022-07-12 18:56:12,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-12 18:56:12,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2022-07-12 18:56:12,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 84 states have internal predecessors, (89), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:56:12,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2022-07-12 18:56:12,457 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 44 [2022-07-12 18:56:12,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:12,457 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2022-07-12 18:56:12,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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) [2022-07-12 18:56:12,457 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2022-07-12 18:56:12,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 18:56:12,457 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:12,457 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:12,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:12,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:12,658 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:12,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:12,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1609523877, now seen corresponding path program 1 times [2022-07-12 18:56:12,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:12,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548531717] [2022-07-12 18:56:12,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:12,659 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:12,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:12,660 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) [2022-07-12 18:56:12,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-12 18:56:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:12,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:56:12,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:12,892 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:12,892 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:12,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:12,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548531717] [2022-07-12 18:56:12,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548531717] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:12,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:12,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:56:12,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156969428] [2022-07-12 18:56:12,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:12,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:56:12,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:12,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:56:12,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:56:12,894 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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) [2022-07-12 18:56:12,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:12,929 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-07-12 18:56:12,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:56:12,930 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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 49 [2022-07-12 18:56:12,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:12,930 INFO L225 Difference]: With dead ends: 92 [2022-07-12 18:56:12,930 INFO L226 Difference]: Without dead ends: 92 [2022-07-12 18:56:12,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:56:12,931 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 36 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:12,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 388 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:56:12,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-12 18:56:12,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-07-12 18:56:12,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 84 states have internal predecessors, (88), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:56:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2022-07-12 18:56:12,933 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 49 [2022-07-12 18:56:12,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:12,933 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2022-07-12 18:56:12,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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) [2022-07-12 18:56:12,933 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2022-07-12 18:56:12,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 18:56:12,933 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:12,933 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:12,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2022-07-12 18:56:13,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:13,134 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:13,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:13,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1068375809, now seen corresponding path program 1 times [2022-07-12 18:56:13,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:13,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307016477] [2022-07-12 18:56:13,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:13,135 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:13,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:13,136 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) [2022-07-12 18:56:13,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-12 18:56:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:13,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-12 18:56:13,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:13,366 INFO L390 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 [2022-07-12 18:56:13,513 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:13,513 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:13,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:13,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307016477] [2022-07-12 18:56:13,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307016477] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:13,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:13,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 18:56:13,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833896266] [2022-07-12 18:56:13,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:13,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 18:56:13,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:13,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 18:56:13,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:56:13,515 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:56:13,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:13,768 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2022-07-12 18:56:13,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:56:13,769 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (3), 3 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 55 [2022-07-12 18:56:13,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:13,769 INFO L225 Difference]: With dead ends: 122 [2022-07-12 18:56:13,769 INFO L226 Difference]: Without dead ends: 122 [2022-07-12 18:56:13,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-07-12 18:56:13,770 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 174 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:13,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 312 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 194 Invalid, 0 Unknown, 19 Unchecked, 0.2s Time] [2022-07-12 18:56:13,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-12 18:56:13,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 107. [2022-07-12 18:56:13,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 86 states have (on average 1.2209302325581395) internal successors, (105), 98 states have internal predecessors, (105), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 18:56:13,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2022-07-12 18:56:13,773 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 55 [2022-07-12 18:56:13,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:13,773 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2022-07-12 18:56:13,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:56:13,773 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2022-07-12 18:56:13,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 18:56:13,774 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:13,774 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:13,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:13,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:13,974 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_kobject_putErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:13,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:13,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1068375808, now seen corresponding path program 1 times [2022-07-12 18:56:13,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:13,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166162604] [2022-07-12 18:56:13,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:13,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:13,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:13,976 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) [2022-07-12 18:56:13,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-12 18:56:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:14,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 18:56:14,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:14,200 INFO L390 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 [2022-07-12 18:56:14,429 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:14,429 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:14,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:14,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166162604] [2022-07-12 18:56:14,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166162604] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:14,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:14,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 18:56:14,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084985093] [2022-07-12 18:56:14,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:14,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:56:14,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:14,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:56:14,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:56:14,430 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:56:14,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:14,701 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2022-07-12 18:56:14,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 18:56:14,701 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (3), 3 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 55 [2022-07-12 18:56:14,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:14,702 INFO L225 Difference]: With dead ends: 109 [2022-07-12 18:56:14,702 INFO L226 Difference]: Without dead ends: 109 [2022-07-12 18:56:14,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-07-12 18:56:14,703 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 152 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:14,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 377 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 205 Invalid, 0 Unknown, 8 Unchecked, 0.2s Time] [2022-07-12 18:56:14,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-12 18:56:14,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2022-07-12 18:56:14,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 86 states have (on average 1.1744186046511629) internal successors, (101), 96 states have internal predecessors, (101), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 18:56:14,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2022-07-12 18:56:14,705 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 55 [2022-07-12 18:56:14,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:14,705 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2022-07-12 18:56:14,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:56:14,705 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2022-07-12 18:56:14,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-12 18:56:14,706 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:14,706 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:14,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-07-12 18:56:14,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:14,915 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:14,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:14,915 INFO L85 PathProgramCache]: Analyzing trace with hash 7191578, now seen corresponding path program 1 times [2022-07-12 18:56:14,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:14,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378289661] [2022-07-12 18:56:14,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:14,916 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:14,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:14,919 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) [2022-07-12 18:56:14,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-12 18:56:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:15,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:56:15,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:15,213 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:15,213 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:15,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:15,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378289661] [2022-07-12 18:56:15,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1378289661] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:15,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:15,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 18:56:15,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990809341] [2022-07-12 18:56:15,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:15,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:56:15,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:15,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:56:15,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:56:15,215 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 18:56:15,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:15,281 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-07-12 18:56:15,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:56:15,282 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 60 [2022-07-12 18:56:15,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:15,282 INFO L225 Difference]: With dead ends: 109 [2022-07-12 18:56:15,282 INFO L226 Difference]: Without dead ends: 105 [2022-07-12 18:56:15,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:56:15,283 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 62 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:15,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 445 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:56:15,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-12 18:56:15,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-07-12 18:56:15,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 86 states have (on average 1.1511627906976745) internal successors, (99), 96 states have internal predecessors, (99), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 18:56:15,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2022-07-12 18:56:15,285 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 60 [2022-07-12 18:56:15,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:15,285 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2022-07-12 18:56:15,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 18:56:15,285 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2022-07-12 18:56:15,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-12 18:56:15,286 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:15,286 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:15,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:15,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:15,495 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:15,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:15,496 INFO L85 PathProgramCache]: Analyzing trace with hash 392980163, now seen corresponding path program 1 times [2022-07-12 18:56:15,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:15,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [570563899] [2022-07-12 18:56:15,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:15,496 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:15,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:15,497 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) [2022-07-12 18:56:15,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-12 18:56:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:15,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 18:56:15,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:15,747 INFO L390 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 [2022-07-12 18:56:15,874 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:15,874 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:15,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:15,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [570563899] [2022-07-12 18:56:15,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [570563899] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:15,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:15,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 18:56:15,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799863793] [2022-07-12 18:56:15,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:15,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:56:15,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:15,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:56:15,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:56:15,875 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:56:16,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:16,122 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2022-07-12 18:56:16,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:56:16,123 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (3), 3 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 61 [2022-07-12 18:56:16,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:16,123 INFO L225 Difference]: With dead ends: 112 [2022-07-12 18:56:16,124 INFO L226 Difference]: Without dead ends: 112 [2022-07-12 18:56:16,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-07-12 18:56:16,124 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 110 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:16,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 326 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 204 Invalid, 0 Unknown, 19 Unchecked, 0.2s Time] [2022-07-12 18:56:16,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-12 18:56:16,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 105. [2022-07-12 18:56:16,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.1494252873563218) internal successors, (100), 96 states have internal predecessors, (100), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 18:56:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2022-07-12 18:56:16,128 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 61 [2022-07-12 18:56:16,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:16,129 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2022-07-12 18:56:16,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:56:16,130 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2022-07-12 18:56:16,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-12 18:56:16,130 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:16,130 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:16,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:16,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:16,341 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:16,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:16,341 INFO L85 PathProgramCache]: Analyzing trace with hash 392980164, now seen corresponding path program 1 times [2022-07-12 18:56:16,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:16,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868011692] [2022-07-12 18:56:16,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:16,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:16,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:16,344 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) [2022-07-12 18:56:16,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-12 18:56:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:16,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-12 18:56:16,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:16,612 INFO L390 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 [2022-07-12 18:56:16,865 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:16,866 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:16,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:16,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868011692] [2022-07-12 18:56:16,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868011692] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:16,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:16,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 18:56:16,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911121497] [2022-07-12 18:56:16,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:16,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 18:56:16,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:16,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 18:56:16,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:56:16,867 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:56:17,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:17,204 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2022-07-12 18:56:17,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:56:17,204 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (3), 3 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 61 [2022-07-12 18:56:17,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:17,205 INFO L225 Difference]: With dead ends: 103 [2022-07-12 18:56:17,205 INFO L226 Difference]: Without dead ends: 103 [2022-07-12 18:56:17,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:56:17,205 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 146 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:17,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 377 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 259 Invalid, 0 Unknown, 8 Unchecked, 0.2s Time] [2022-07-12 18:56:17,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-12 18:56:17,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-07-12 18:56:17,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.1149425287356323) internal successors, (97), 94 states have internal predecessors, (97), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 18:56:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2022-07-12 18:56:17,208 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 61 [2022-07-12 18:56:17,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:17,208 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2022-07-12 18:56:17,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:56:17,208 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2022-07-12 18:56:17,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-12 18:56:17,208 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:17,209 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:17,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:17,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:17,409 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:17,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:17,409 INFO L85 PathProgramCache]: Analyzing trace with hash -808735445, now seen corresponding path program 1 times [2022-07-12 18:56:17,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:17,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845808390] [2022-07-12 18:56:17,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:17,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:17,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:17,415 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) [2022-07-12 18:56:17,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-12 18:56:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:17,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-12 18:56:17,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:18,003 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:18,003 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:18,003 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:18,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845808390] [2022-07-12 18:56:18,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845808390] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:18,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:18,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 18:56:18,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461608451] [2022-07-12 18:56:18,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:18,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 18:56:18,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:18,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 18:56:18,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:56:18,004 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:56:18,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:18,275 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2022-07-12 18:56:18,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:56:18,276 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (3), 3 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 64 [2022-07-12 18:56:18,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:18,276 INFO L225 Difference]: With dead ends: 102 [2022-07-12 18:56:18,276 INFO L226 Difference]: Without dead ends: 102 [2022-07-12 18:56:18,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-07-12 18:56:18,277 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 157 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:18,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 383 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 185 Invalid, 0 Unknown, 7 Unchecked, 0.2s Time] [2022-07-12 18:56:18,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-12 18:56:18,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-12 18:56:18,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 87 states have (on average 1.103448275862069) internal successors, (96), 93 states have internal predecessors, (96), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 18:56:18,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2022-07-12 18:56:18,279 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 64 [2022-07-12 18:56:18,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:18,279 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2022-07-12 18:56:18,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:56:18,280 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2022-07-12 18:56:18,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-12 18:56:18,280 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:18,280 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:18,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:18,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:18,481 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:18,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:18,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1477848750, now seen corresponding path program 1 times [2022-07-12 18:56:18,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:18,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044525100] [2022-07-12 18:56:18,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:18,481 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:18,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:18,482 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:18,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-12 18:56:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:18,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 18:56:18,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:18,795 INFO L390 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 [2022-07-12 18:56:18,930 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:18,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:56:19,047 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:19,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:19,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1044525100] [2022-07-12 18:56:19,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1044525100] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:56:19,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:56:19,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2022-07-12 18:56:19,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678321428] [2022-07-12 18:56:19,047 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:56:19,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 18:56:19,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:19,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 18:56:19,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:56:19,049 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 18:56:19,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:19,306 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2022-07-12 18:56:19,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 18:56:19,307 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 68 [2022-07-12 18:56:19,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:19,307 INFO L225 Difference]: With dead ends: 128 [2022-07-12 18:56:19,307 INFO L226 Difference]: Without dead ends: 128 [2022-07-12 18:56:19,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 120 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-07-12 18:56:19,308 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 152 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:19,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 385 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 234 Invalid, 0 Unknown, 52 Unchecked, 0.2s Time] [2022-07-12 18:56:19,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-12 18:56:19,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 115. [2022-07-12 18:56:19,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 98 states have (on average 1.1020408163265305) internal successors, (108), 104 states have internal predecessors, (108), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-12 18:56:19,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2022-07-12 18:56:19,311 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 68 [2022-07-12 18:56:19,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:19,311 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2022-07-12 18:56:19,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 18:56:19,311 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2022-07-12 18:56:19,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-12 18:56:19,311 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:19,311 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:19,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2022-07-12 18:56:19,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:19,516 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:19,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:19,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1729031655, now seen corresponding path program 1 times [2022-07-12 18:56:19,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:19,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230551606] [2022-07-12 18:56:19,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:19,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:19,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:19,518 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) [2022-07-12 18:56:19,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-12 18:56:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:19,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-12 18:56:19,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:19,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:19,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:19,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:19,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:19,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:19,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:19,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 38 [2022-07-12 18:56:23,901 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2206 (_ BitVec 8)) (v_ArrVal_2208 (_ BitVec 8))) (= (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2206) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2208)) |c_#memory_int|)) is different from true [2022-07-12 18:56:23,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:23,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:23,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:23,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2022-07-12 18:56:24,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:24,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:24,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:24,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:24,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:24,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:24,175 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:56:24,178 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:56:24,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 69 [2022-07-12 18:56:24,312 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:56:24,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 23 [2022-07-12 18:56:24,468 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:24,468 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:24,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:24,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230551606] [2022-07-12 18:56:24,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230551606] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:24,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:24,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-07-12 18:56:24,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250487346] [2022-07-12 18:56:24,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:24,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 18:56:24,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:24,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 18:56:24,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=591, Unknown=2, NotChecked=48, Total=702 [2022-07-12 18:56:24,469 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 24 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:56:25,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:25,132 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-07-12 18:56:25,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 18:56:25,133 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 24 states have internal predecessors, (47), 3 states have call successors, (3), 3 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 67 [2022-07-12 18:56:25,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:25,133 INFO L225 Difference]: With dead ends: 100 [2022-07-12 18:56:25,133 INFO L226 Difference]: Without dead ends: 100 [2022-07-12 18:56:25,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=134, Invalid=1128, Unknown=2, NotChecked=68, Total=1332 [2022-07-12 18:56:25,134 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 35 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 324 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:25,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 934 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 253 Invalid, 0 Unknown, 324 Unchecked, 0.3s Time] [2022-07-12 18:56:25,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-12 18:56:25,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2022-07-12 18:56:25,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 87 states have internal predecessors, (90), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:56:25,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2022-07-12 18:56:25,136 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 67 [2022-07-12 18:56:25,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:25,136 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2022-07-12 18:56:25,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 24 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 18:56:25,136 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2022-07-12 18:56:25,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-12 18:56:25,137 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:25,137 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:25,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:25,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:25,350 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:25,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:25,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1342862122, now seen corresponding path program 1 times [2022-07-12 18:56:25,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:25,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107899891] [2022-07-12 18:56:25,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:25,351 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:25,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:25,352 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:25,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-12 18:56:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:25,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 18:56:25,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:25,713 INFO L390 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 [2022-07-12 18:56:25,857 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:25,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:56:25,984 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:56:25,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:25,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107899891] [2022-07-12 18:56:25,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1107899891] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:56:25,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:56:25,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2022-07-12 18:56:25,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595266818] [2022-07-12 18:56:25,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:56:25,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 18:56:25,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:25,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 18:56:25,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:56:25,986 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 18:56:26,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:26,285 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2022-07-12 18:56:26,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 18:56:26,286 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 74 [2022-07-12 18:56:26,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:26,286 INFO L225 Difference]: With dead ends: 102 [2022-07-12 18:56:26,286 INFO L226 Difference]: Without dead ends: 102 [2022-07-12 18:56:26,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 132 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2022-07-12 18:56:26,287 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 68 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:56:26,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 414 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 241 Invalid, 0 Unknown, 47 Unchecked, 0.2s Time] [2022-07-12 18:56:26,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-12 18:56:26,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 95. [2022-07-12 18:56:26,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 83 states have (on average 1.072289156626506) internal successors, (89), 86 states have internal predecessors, (89), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:56:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2022-07-12 18:56:26,289 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 74 [2022-07-12 18:56:26,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:26,289 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2022-07-12 18:56:26,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 18:56:26,289 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2022-07-12 18:56:26,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-12 18:56:26,289 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:26,289 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:26,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:26,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:26,500 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:56:26,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:26,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1943196067, now seen corresponding path program 1 times [2022-07-12 18:56:26,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:26,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1869497257] [2022-07-12 18:56:26,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:26,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:26,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:26,502 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) [2022-07-12 18:56:26,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-12 18:56:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:26,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 114 conjunts are in the unsatisfiable core [2022-07-12 18:56:26,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:27,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:27,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:27,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:27,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:27,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:27,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:27,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:27,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:27,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:27,059 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:56:27,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:56:27,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2022-07-12 18:56:31,549 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2561 (_ BitVec 8)) (v_ArrVal_2564 (_ BitVec 8))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2561) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2564)))) is different from true [2022-07-12 18:56:31,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:31,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:31,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:31,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:31,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:31,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:31,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:31,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:31,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:31,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:31,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:31,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:31,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:31,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:31,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:31,572 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:56:31,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 71 [2022-07-12 18:56:31,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:31,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:31,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:31,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:31,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:31,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:31,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:31,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:31,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:31,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:56:31,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:31,860 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:56:31,860 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:56:31,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:31,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:31,862 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:56:31,867 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:56:31,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 193 treesize of output 165 [2022-07-12 18:56:32,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:32,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:32,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:32,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:32,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:32,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:56:32,329 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:56:32,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 249 treesize of output 137 [2022-07-12 18:56:36,900 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-07-12 18:56:36,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:56:59,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:59,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1869497257] [2022-07-12 18:56:59,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1869497257] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:56:59,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [284340819] [2022-07-12 18:56:59,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:59,911 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 18:56:59,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 18:56:59,922 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) [2022-07-12 18:56:59,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-07-12 18:57:01,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:01,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 131 conjunts are in the unsatisfiable core [2022-07-12 18:57:01,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:02,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:02,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:02,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:02,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:02,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:02,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:02,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:02,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:02,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:02,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:57:02,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:57:02,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2022-07-12 18:57:05,369 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2765 (_ BitVec 8)) (v_ArrVal_2561 (_ BitVec 8))) (= (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2561) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2765)) |c_#memory_int|)) is different from true [2022-07-12 18:57:05,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,394 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:57:05,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 71 [2022-07-12 18:57:05,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,500 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:57:05,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,501 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:57:05,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:57:05,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,503 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:57:05,515 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:57:05,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 193 treesize of output 165 [2022-07-12 18:57:05,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:05,738 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:57:05,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 249 treesize of output 137 [2022-07-12 18:57:05,801 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-12 18:57:05,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:57:07,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [284340819] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:57:07,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:57:07,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 43] total 44 [2022-07-12 18:57:07,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003539193] [2022-07-12 18:57:07,575 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:57:07,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-12 18:57:07,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:07,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-12 18:57:07,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=3825, Unknown=13, NotChecked=250, Total=4290 [2022-07-12 18:57:07,577 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand has 44 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 41 states have internal predecessors, (69), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-12 18:57:11,221 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2561 (_ BitVec 8)) (v_ArrVal_2564 (_ BitVec 8))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2561) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2564)))) (exists ((v_ArrVal_2765 (_ BitVec 8)) (v_ArrVal_2561 (_ BitVec 8))) (= (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2561) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2765)) |c_#memory_int|))) is different from true [2022-07-12 18:57:52,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:52,793 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2022-07-12 18:57:52,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-12 18:57:52,794 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 41 states have internal predecessors, (69), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 79 [2022-07-12 18:57:52,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:52,794 INFO L225 Difference]: With dead ends: 99 [2022-07-12 18:57:52,794 INFO L226 Difference]: Without dead ends: 95 [2022-07-12 18:57:52,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 171 SyntacticMatches, 3 SemanticMatches, 90 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1807 ImplicationChecksByTransitivity, 79.1s TimeCoverageRelationStatistics Valid=523, Invalid=7297, Unknown=24, NotChecked=528, Total=8372 [2022-07-12 18:57:52,797 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 121 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 240 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:57:52,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 898 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1282 Invalid, 0 Unknown, 240 Unchecked, 2.0s Time] [2022-07-12 18:57:52,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-12 18:57:52,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-07-12 18:57:52,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 86 states have internal predecessors, (88), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:57:52,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2022-07-12 18:57:52,799 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 79 [2022-07-12 18:57:52,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:52,799 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2022-07-12 18:57:52,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 41 states have internal predecessors, (69), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-12 18:57:52,799 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2022-07-12 18:57:52,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-12 18:57:52,800 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:52,800 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:57:52,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-07-12 18:57:53,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2022-07-12 18:57:53,209 WARN L477 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 [2022-07-12 18:57:53,209 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:57:53,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:53,209 INFO L85 PathProgramCache]: Analyzing trace with hash -826672710, now seen corresponding path program 1 times [2022-07-12 18:57:53,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:53,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754433616] [2022-07-12 18:57:53,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:53,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:53,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:53,217 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) [2022-07-12 18:57:53,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-12 18:57:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:53,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 156 conjunts are in the unsatisfiable core [2022-07-12 18:57:53,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:53,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:57:53,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:53,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:53,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:53,833 INFO L390 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 21 [2022-07-12 18:57:53,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:53,901 INFO L390 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 21 [2022-07-12 18:57:53,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:53,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:53,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:53,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:53,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:53,999 INFO L390 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 21 [2022-07-12 18:57:54,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:54,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:54,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:54,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:54,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:54,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:54,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:54,136 INFO L390 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 21 [2022-07-12 18:57:54,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:54,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:54,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:54,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:54,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:54,291 INFO L390 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 21 [2022-07-12 18:57:54,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:54,335 INFO L390 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 21 [2022-07-12 18:57:54,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:54,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:54,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:54,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:54,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:54,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:54,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:54,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:54,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:54,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:54,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:54,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:54,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-12 18:57:59,559 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3001 (_ BitVec 32)) (v_ArrVal_2999 (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2999) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3001)))) is different from true [2022-07-12 18:57:59,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:59,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:59,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:59,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-12 18:57:59,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:59,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:59,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:59,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:59,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:59,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:59,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:59,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:59,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:59,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:59,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-12 18:58:01,905 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3010 (_ BitVec 32)) (v_ArrVal_3009 (_ BitVec 32)) (v_ArrVal_3007 (_ BitVec 32)) (v_ArrVal_3008 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_put_#in~kobj#1.base| (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_put_#in~kobj#1.base|) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)) v_ArrVal_3007) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32)) v_ArrVal_3009) (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|) v_ArrVal_3008) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32)) v_ArrVal_3010)) |c_#memory_$Pointer$.offset|)) is different from true [2022-07-12 18:58:01,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:01,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:01,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:01,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:01,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:01,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:01,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:01,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:01,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:01,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:01,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-12 18:58:02,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:02,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:02,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:02,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:02,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:02,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:02,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:02,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:02,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:02,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2022-07-12 18:58:02,223 INFO L390 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 [2022-07-12 18:58:02,293 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-12 18:58:02,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:58:04,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:58:04,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [754433616] [2022-07-12 18:58:04,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [754433616] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:58:04,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [678056297] [2022-07-12 18:58:04,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:58:04,574 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 18:58:04,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 18:58:04,576 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) [2022-07-12 18:58:04,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2022-07-12 18:58:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:58:05,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 152 conjunts are in the unsatisfiable core [2022-07-12 18:58:05,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:58:05,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:58:05,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:05,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:58:05,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:05,372 INFO L390 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 21 [2022-07-12 18:58:05,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:05,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:58:05,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:05,432 INFO L390 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 21 [2022-07-12 18:58:05,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:05,474 INFO L390 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 21 [2022-07-12 18:58:05,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:05,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:58:05,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:05,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:58:05,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:05,572 INFO L390 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 21 [2022-07-12 18:58:05,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:05,608 INFO L390 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 21 [2022-07-12 18:58:05,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:05,640 INFO L390 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 21 [2022-07-12 18:58:05,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:05,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:58:05,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:05,675 INFO L390 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 21 [2022-07-12 18:58:05,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:05,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:58:05,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:05,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:58:05,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:05,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:58:05,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:05,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:05,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:05,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:05,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:05,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:05,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:05,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:05,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:05,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:05,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-12 18:58:08,961 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2999 (_ BitVec 32)) (v_ArrVal_3248 (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2999) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3248)))) is different from true [2022-07-12 18:58:08,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:08,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:08,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:08,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-12 18:58:09,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:09,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:09,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:09,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:09,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:09,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:09,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:09,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:09,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:09,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:09,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-12 18:58:11,080 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3256 (_ BitVec 32)) (v_ArrVal_3257 (_ BitVec 32)) (v_ArrVal_3258 (_ BitVec 32)) (v_ArrVal_3259 (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_put_#in~kobj#1.base| (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_put_#in~kobj#1.base|) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)) v_ArrVal_3256) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32)) v_ArrVal_3257) (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|) v_ArrVal_3259) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32)) v_ArrVal_3258)))) is different from true [2022-07-12 18:58:11,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:11,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:11,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:11,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:11,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:11,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:11,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:11,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:11,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:11,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:11,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-12 18:58:11,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 39 [2022-07-12 18:58:11,334 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:58:11,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-12 18:58:11,435 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-12 18:58:11,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:58:12,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [678056297] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:58:12,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:58:12,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 44] total 50 [2022-07-12 18:58:12,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240137969] [2022-07-12 18:58:12,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:58:12,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-12 18:58:12,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:58:12,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-12 18:58:12,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=3927, Unknown=5, NotChecked=516, Total=4692 [2022-07-12 18:58:12,864 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand has 51 states, 50 states have (on average 1.84) internal successors, (92), 48 states have internal predecessors, (92), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 18:58:17,550 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2999 (_ BitVec 32)) (v_ArrVal_3248 (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2999) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3248)))) (exists ((v_ArrVal_3001 (_ BitVec 32)) (v_ArrVal_2999 (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2999) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3001))))) is different from true [2022-07-12 18:58:25,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:58:25,085 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2022-07-12 18:58:25,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-12 18:58:25,086 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.84) internal successors, (92), 48 states have internal predecessors, (92), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 80 [2022-07-12 18:58:25,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:58:25,087 INFO L225 Difference]: With dead ends: 94 [2022-07-12 18:58:25,087 INFO L226 Difference]: Without dead ends: 94 [2022-07-12 18:58:25,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 139 SyntacticMatches, 11 SemanticMatches, 97 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2283 ImplicationChecksByTransitivity, 25.8s TimeCoverageRelationStatistics Valid=520, Invalid=8235, Unknown=7, NotChecked=940, Total=9702 [2022-07-12 18:58:25,098 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 163 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 2073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 398 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:58:25,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 838 Invalid, 2073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1606 Invalid, 0 Unknown, 398 Unchecked, 2.5s Time] [2022-07-12 18:58:25,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-12 18:58:25,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-12 18:58:25,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 85 states have internal predecessors, (87), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:58:25,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2022-07-12 18:58:25,100 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 80 [2022-07-12 18:58:25,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:58:25,100 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2022-07-12 18:58:25,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.84) internal successors, (92), 48 states have internal predecessors, (92), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 18:58:25,101 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2022-07-12 18:58:25,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-12 18:58:25,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:58:25,101 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:58:25,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2022-07-12 18:58:25,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-07-12 18:58:25,504 WARN L477 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 [2022-07-12 18:58:25,504 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_kobject_putErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:58:25,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:58:25,505 INFO L85 PathProgramCache]: Analyzing trace with hash 142949917, now seen corresponding path program 1 times [2022-07-12 18:58:25,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:58:25,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393556586] [2022-07-12 18:58:25,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:58:25,505 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:58:25,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:58:25,506 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) [2022-07-12 18:58:25,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-07-12 18:58:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:58:26,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 156 conjunts are in the unsatisfiable core [2022-07-12 18:58:26,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:58:26,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:58:26,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:26,141 INFO L390 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 21 [2022-07-12 18:58:26,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:26,167 INFO L390 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 21 [2022-07-12 18:58:26,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:26,210 INFO L390 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 21 [2022-07-12 18:58:26,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:26,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:58:26,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:26,286 INFO L390 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 21 [2022-07-12 18:58:26,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:26,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:58:26,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:26,356 INFO L390 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 21 [2022-07-12 18:58:26,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:26,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:58:26,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:26,432 INFO L390 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 21 [2022-07-12 18:58:26,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:26,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:58:26,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:26,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:58:26,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:26,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:58:26,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:26,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:58:26,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:26,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:58:26,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:26,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:58:26,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:26,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:26,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:26,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:26,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:26,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:26,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:26,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:26,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:26,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:26,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-12 18:58:32,107 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3486 (_ BitVec 32)) (v_ArrVal_3489 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_3486) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3489)) |c_#memory_$Pointer$.base|)) is different from true [2022-07-12 18:58:32,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:32,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:32,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:32,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-12 18:58:32,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:32,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:32,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:32,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:32,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:32,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:32,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:32,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:32,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:32,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:32,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-12 18:58:34,488 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3498 (_ BitVec 32)) (v_ArrVal_3499 (_ BitVec 32)) (v_ArrVal_3496 (_ BitVec 32)) (v_ArrVal_3497 (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_ldv_kobject_put_#in~kobj#1.base| (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_ldv_kobject_put_#in~kobj#1.base|) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)) v_ArrVal_3498) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32)) v_ArrVal_3499) (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|) v_ArrVal_3496) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32)) v_ArrVal_3497)))) is different from true [2022-07-12 18:58:34,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:34,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:34,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:34,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:34,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:34,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:34,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:34,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:34,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:34,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:34,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-12 18:58:34,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:34,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:34,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:34,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:34,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:34,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:34,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:34,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:34,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:34,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2022-07-12 18:58:34,829 INFO L390 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 [2022-07-12 18:58:34,936 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-12 18:58:34,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:58:37,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:58:37,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393556586] [2022-07-12 18:58:37,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393556586] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:58:37,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2025022288] [2022-07-12 18:58:37,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:58:37,468 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 18:58:37,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 18:58:37,469 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) [2022-07-12 18:58:37,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2022-07-12 18:58:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:58:38,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 152 conjunts are in the unsatisfiable core [2022-07-12 18:58:38,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:58:38,273 INFO L390 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 14 treesize of output 10 [2022-07-12 18:58:38,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,316 INFO L390 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 21 [2022-07-12 18:58:38,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:58:38,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:58:38,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,421 INFO L390 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 21 [2022-07-12 18:58:38,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:58:38,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:58:38,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:58:38,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:58:38,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,553 INFO L390 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 21 [2022-07-12 18:58:38,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,567 INFO L390 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 21 [2022-07-12 18:58:38,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,607 INFO L390 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 21 [2022-07-12 18:58:38,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,646 INFO L390 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 21 [2022-07-12 18:58:38,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:58:38,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:58:38,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:58:38,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:38,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-12 18:58:42,080 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3486 (_ BitVec 32)) (v_ArrVal_3736 (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_3486) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3736)))) is different from true [2022-07-12 18:58:42,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:42,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:42,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:42,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-12 18:58:42,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:42,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:42,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:42,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:42,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:42,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:42,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:42,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:42,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:42,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:42,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-12 18:58:44,212 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3746 (_ BitVec 32)) (v_ArrVal_3744 (_ BitVec 32)) (v_ArrVal_3745 (_ BitVec 32)) (v_ArrVal_3743 (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_ldv_kobject_put_#in~kobj#1.base| (store (store (store (store (select |c_old(#memory_$Pointer$.base)| |c_ldv_kobject_put_#in~kobj#1.base|) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)) v_ArrVal_3746) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32)) v_ArrVal_3744) (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|) v_ArrVal_3745) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32)) v_ArrVal_3743)))) is different from true [2022-07-12 18:58:44,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:44,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:44,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:44,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:44,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:44,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:44,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:44,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:44,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:44,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:58:44,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-12 18:58:44,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 39 [2022-07-12 18:58:44,507 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:58:44,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-12 18:58:44,620 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-12 18:58:44,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:58:46,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2025022288] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:58:46,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:58:46,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46] total 52 [2022-07-12 18:58:46,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183788984] [2022-07-12 18:58:46,140 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:58:46,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-12 18:58:46,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:58:46,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-12 18:58:46,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=4040, Unknown=5, NotChecked=524, Total=4830 [2022-07-12 18:58:46,142 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand has 52 states, 52 states have (on average 1.7884615384615385) internal successors, (93), 49 states have internal predecessors, (93), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 18:58:50,061 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3486 (_ BitVec 32)) (v_ArrVal_3489 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_3486) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3489)) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3486 (_ BitVec 32)) (v_ArrVal_3736 (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_3486) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3736))))) is different from true [2022-07-12 18:58:57,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:58:57,278 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2022-07-12 18:58:57,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-12 18:58:57,279 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.7884615384615385) internal successors, (93), 49 states have internal predecessors, (93), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 81 [2022-07-12 18:58:57,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:58:57,279 INFO L225 Difference]: With dead ends: 90 [2022-07-12 18:58:57,279 INFO L226 Difference]: Without dead ends: 89 [2022-07-12 18:58:57,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 142 SyntacticMatches, 11 SemanticMatches, 84 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1968 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=441, Invalid=6052, Unknown=7, NotChecked=810, Total=7310 [2022-07-12 18:58:57,281 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 141 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 1422 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 367 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:58:57,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 603 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1422 Invalid, 0 Unknown, 367 Unchecked, 2.2s Time] [2022-07-12 18:58:57,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-12 18:58:57,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-07-12 18:58:57,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 18:58:57,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2022-07-12 18:58:57,283 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 81 [2022-07-12 18:58:57,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:58:57,283 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2022-07-12 18:58:57,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.7884615384615385) internal successors, (93), 49 states have internal predecessors, (93), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 18:58:57,283 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2022-07-12 18:58:57,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-12 18:58:57,283 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:58:57,283 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:58:57,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2022-07-12 18:58:57,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2022-07-12 18:58:57,694 WARN L477 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 [2022-07-12 18:58:57,694 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:58:57,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:58:57,694 INFO L85 PathProgramCache]: Analyzing trace with hash -2138038455, now seen corresponding path program 1 times [2022-07-12 18:58:57,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:58:57,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181142743] [2022-07-12 18:58:57,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:58:57,695 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:58:57,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:58:57,696 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) [2022-07-12 18:58:57,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-07-12 18:58:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:58:58,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 18:58:58,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:58:58,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2022-07-12 18:58:58,731 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-12 18:58:58,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:59:03,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:59:03,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [181142743] [2022-07-12 18:59:03,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [181142743] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:59:03,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1784937835] [2022-07-12 18:59:03,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:59:03,233 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 18:59:03,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 18:59:03,234 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) [2022-07-12 18:59:03,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2022-07-12 18:59:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:59:04,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 18:59:04,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:59:04,293 INFO L356 Elim1Store]: treesize reduction 16, result has 42.9 percent of original size [2022-07-12 18:59:04,293 INFO L390 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 18 treesize of output 25 [2022-07-12 18:59:04,610 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-12 18:59:04,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:59:08,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1784937835] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:59:08,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:59:08,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2022-07-12 18:59:08,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145599440] [2022-07-12 18:59:08,954 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:59:08,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 18:59:08,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:59:08,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 18:59:08,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=721, Unknown=2, NotChecked=0, Total=812 [2022-07-12 18:59:08,954 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand has 20 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-12 18:59:09,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:59:09,063 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2022-07-12 18:59:09,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 18:59:09,063 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 88 [2022-07-12 18:59:09,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:59:09,064 INFO L225 Difference]: With dead ends: 88 [2022-07-12 18:59:09,064 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 18:59:09,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 306 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=108, Invalid=820, Unknown=2, NotChecked=0, Total=930 [2022-07-12 18:59:09,064 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 30 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 179 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:59:09,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 490 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 179 Unchecked, 0.1s Time] [2022-07-12 18:59:09,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 18:59:09,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 18:59:09,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-07-12 18:59:09,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 18:59:09,065 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2022-07-12 18:59:09,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:59:09,065 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 18:59:09,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-12 18:59:09,065 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 18:59:09,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 18:59:09,067 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (24 of 25 remaining) [2022-07-12 18:59:09,067 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (23 of 25 remaining) [2022-07-12 18:59:09,083 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 25 remaining) [2022-07-12 18:59:09,083 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 25 remaining) [2022-07-12 18:59:09,084 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 25 remaining) [2022-07-12 18:59:09,084 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 25 remaining) [2022-07-12 18:59:09,084 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 25 remaining) [2022-07-12 18:59:09,085 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 25 remaining) [2022-07-12 18:59:09,085 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (16 of 25 remaining) [2022-07-12 18:59:09,085 INFO L805 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 25 remaining) [2022-07-12 18:59:09,085 INFO L805 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 25 remaining) [2022-07-12 18:59:09,085 INFO L805 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 25 remaining) [2022-07-12 18:59:09,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 25 remaining) [2022-07-12 18:59:09,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 25 remaining) [2022-07-12 18:59:09,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 25 remaining) [2022-07-12 18:59:09,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 25 remaining) [2022-07-12 18:59:09,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 25 remaining) [2022-07-12 18:59:09,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 25 remaining) [2022-07-12 18:59:09,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 25 remaining) [2022-07-12 18:59:09,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr6ASSERT_VIOLATIONMEMORY_FREE (5 of 25 remaining) [2022-07-12 18:59:09,087 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE (4 of 25 remaining) [2022-07-12 18:59:09,087 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr8ASSERT_VIOLATIONMEMORY_FREE (3 of 25 remaining) [2022-07-12 18:59:09,087 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE (2 of 25 remaining) [2022-07-12 18:59:09,087 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr10ASSERT_VIOLATIONMEMORY_FREE (1 of 25 remaining) [2022-07-12 18:59:09,087 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr11ASSERT_VIOLATIONMEMORY_FREE (0 of 25 remaining) [2022-07-12 18:59:09,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:09,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2022-07-12 18:59:09,499 WARN L477 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 [2022-07-12 18:59:09,502 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:59:09,503 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 18:59:09,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 06:59:09 BoogieIcfgContainer [2022-07-12 18:59:09,507 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 18:59:09,507 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 18:59:09,507 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 18:59:09,508 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 18:59:09,517 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:56:01" (3/4) ... [2022-07-12 18:59:09,519 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 18:59:09,524 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-07-12 18:59:09,524 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2022-07-12 18:59:09,524 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2022-07-12 18:59:09,530 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 42 nodes and edges [2022-07-12 18:59:09,530 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-12 18:59:09,530 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-12 18:59:09,531 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 18:59:09,568 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 18:59:09,568 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 18:59:09,569 INFO L158 Benchmark]: Toolchain (without parser) took 189030.81ms. Allocated memory was 65.0MB in the beginning and 96.5MB in the end (delta: 31.5MB). Free memory was 44.3MB in the beginning and 59.7MB in the end (delta: -15.4MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. [2022-07-12 18:59:09,569 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 65.0MB. Free memory was 47.1MB in the beginning and 47.1MB in the end (delta: 43.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:59:09,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.56ms. Allocated memory is still 65.0MB. Free memory was 44.1MB in the beginning and 31.6MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 18:59:09,573 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.79ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 31.4MB in the beginning and 61.1MB in the end (delta: -29.7MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. [2022-07-12 18:59:09,573 INFO L158 Benchmark]: Boogie Preprocessor took 49.85ms. Allocated memory is still 79.7MB. Free memory was 61.1MB in the beginning and 59.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 18:59:09,575 INFO L158 Benchmark]: RCFGBuilder took 495.47ms. Allocated memory is still 79.7MB. Free memory was 59.0MB in the beginning and 59.6MB in the end (delta: -586.6kB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2022-07-12 18:59:09,575 INFO L158 Benchmark]: TraceAbstraction took 187890.45ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 59.1MB in the beginning and 52.5MB in the end (delta: 6.6MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. [2022-07-12 18:59:09,576 INFO L158 Benchmark]: Witness Printer took 60.96ms. Allocated memory is still 96.5MB. Free memory was 52.4MB in the beginning and 59.7MB in the end (delta: -7.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 18:59:09,577 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.17ms. Allocated memory is still 65.0MB. Free memory was 47.1MB in the beginning and 47.1MB in the end (delta: 43.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 481.56ms. Allocated memory is still 65.0MB. Free memory was 44.1MB in the beginning and 31.6MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.79ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 31.4MB in the beginning and 61.1MB in the end (delta: -29.7MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.85ms. Allocated memory is still 79.7MB. Free memory was 61.1MB in the beginning and 59.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 495.47ms. Allocated memory is still 79.7MB. Free memory was 59.0MB in the beginning and 59.6MB in the end (delta: -586.6kB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. * TraceAbstraction took 187890.45ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 59.1MB in the beginning and 52.5MB in the end (delta: 6.6MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. * Witness Printer took 60.96ms. Allocated memory is still 96.5MB. Free memory was 52.4MB in the beginning and 59.7MB in the end (delta: -7.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 764]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 90 locations, 25 error locations. Started 1 CEGAR loops. OverallTime: 187.8s, OverallIterations: 33, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 74.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2578 SdHoareTripleChecker+Valid, 10.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2555 mSDsluCounter, 15831 SdHoareTripleChecker+Invalid, 9.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1706 IncrementalHoareTripleChecker+Unchecked, 13372 mSDsCounter, 393 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8375 IncrementalHoareTripleChecker+Invalid, 10474 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 393 mSolverCounterUnsat, 2459 mSDtfsCounter, 8375 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2427 GetRequests, 1752 SyntacticMatches, 48 SemanticMatches, 627 ConstructedPredicates, 14 IntricatePredicates, 4 DeprecatedPredicates, 6959 ImplicationChecksByTransitivity, 146.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=27, InterpolantAutomatonStates: 436, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 33 MinimizatonAttempts, 304 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 5.2s SatisfiabilityAnalysisTime, 95.7s InterpolantComputationTime, 1724 NumberOfCodeBlocks, 1694 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1889 ConstructedInterpolants, 220 QuantifiedInterpolants, 19148 SizeOfPredicates, 778 NumberOfNonLiveVariables, 11005 ConjunctsInSsa, 1408 ConjunctsInUnsatCore, 42 InterpolantComputations, 24 PerfectInterpolantSequences, 2959/3841 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 25 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-07-12 18:59:09,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE